Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r169-tall-167838855400155.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Eratosthenes-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855400155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.6K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 50K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Eratosthenes-PT-050-LTLCardinality-00
FORMULA_NAME Eratosthenes-PT-050-LTLCardinality-01
FORMULA_NAME Eratosthenes-PT-050-LTLCardinality-02
FORMULA_NAME Eratosthenes-PT-050-LTLCardinality-03
FORMULA_NAME Eratosthenes-PT-050-LTLCardinality-04
FORMULA_NAME Eratosthenes-PT-050-LTLCardinality-05
FORMULA_NAME Eratosthenes-PT-050-LTLCardinality-06
FORMULA_NAME Eratosthenes-PT-050-LTLCardinality-07
FORMULA_NAME Eratosthenes-PT-050-LTLCardinality-08
FORMULA_NAME Eratosthenes-PT-050-LTLCardinality-09
FORMULA_NAME Eratosthenes-PT-050-LTLCardinality-10
FORMULA_NAME Eratosthenes-PT-050-LTLCardinality-11
FORMULA_NAME Eratosthenes-PT-050-LTLCardinality-12
FORMULA_NAME Eratosthenes-PT-050-LTLCardinality-13
FORMULA_NAME Eratosthenes-PT-050-LTLCardinality-14
FORMULA_NAME Eratosthenes-PT-050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678494800937

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Eratosthenes-PT-050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 00:33:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 00:33:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:33:22] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-11 00:33:22] [INFO ] Transformed 49 places.
[2023-03-11 00:33:22] [INFO ] Transformed 108 transitions.
[2023-03-11 00:33:22] [INFO ] Parsed PT model containing 49 places and 108 transitions and 324 arcs in 100 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA Eratosthenes-PT-050-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 80/80 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 30 transition count 76
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 30 transition count 76
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 0 with 46 rules applied. Total rules applied 54 place count 30 transition count 30
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 64 place count 20 transition count 20
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 20 transition count 20
Applied a total of 74 rules in 14 ms. Remains 20 /34 variables (removed 14) and now considering 20/80 (removed 60) transitions.
// Phase 1: matrix 20 rows 20 cols
[2023-03-11 00:33:22] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-11 00:33:23] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-11 00:33:23] [INFO ] Invariant cache hit.
[2023-03-11 00:33:23] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-11 00:33:23] [INFO ] Invariant cache hit.
[2023-03-11 00:33:23] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/34 places, 20/80 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. Remains : 20/34 places, 20/80 transitions.
Support contains 19 out of 20 places after structural reductions.
[2023-03-11 00:33:23] [INFO ] Flatten gal took : 19 ms
[2023-03-11 00:33:23] [INFO ] Flatten gal took : 3 ms
[2023-03-11 00:33:23] [INFO ] Input system was already deterministic with 20 transitions.
Support contains 18 out of 20 places (down from 19) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 277 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 00:33:24] [INFO ] Invariant cache hit.
[2023-03-11 00:33:24] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 00:33:24] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 10 simplifications.
FORMULA Eratosthenes-PT-050-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Eratosthenes-PT-050-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&((p2&&G(F(!p2)))||p1))))'
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 5 transition count 5
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 5 transition count 5
Applied a total of 30 rules in 3 ms. Remains 5 /20 variables (removed 15) and now considering 5/20 (removed 15) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-11 00:33:24] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:33:24] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 00:33:24] [INFO ] Invariant cache hit.
[2023-03-11 00:33:24] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-11 00:33:24] [INFO ] Invariant cache hit.
[2023-03-11 00:33:24] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/20 places, 5/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 5/20 places, 5/20 transitions.
Stuttering acceptance computed with spot in 433 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), p2, p2]
Running random walk in product with property : Eratosthenes-PT-050-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT 1 s4), p1:(OR (GT 1 s4) (GT 1 s1)), p2:(GT s2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Eratosthenes-PT-050-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLCardinality-00 finished in 563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 3 transition count 3
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 3 transition count 3
Applied a total of 34 rules in 2 ms. Remains 3 /20 variables (removed 17) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-11 00:33:24] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:33:24] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-11 00:33:24] [INFO ] Invariant cache hit.
[2023-03-11 00:33:24] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-11 00:33:24] [INFO ] Invariant cache hit.
[2023-03-11 00:33:24] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/20 places, 3/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 3/20 places, 3/20 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Eratosthenes-PT-050-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLCardinality-07 finished in 178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Graph (complete) has 0 edges and 20 vertex of which 4 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 2 ms. Remains 4 /20 variables (removed 16) and now considering 4/20 (removed 16) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-11 00:33:25] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:33:25] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 00:33:25] [INFO ] Invariant cache hit.
[2023-03-11 00:33:25] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-11 00:33:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 00:33:25] [INFO ] Invariant cache hit.
[2023-03-11 00:33:25] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/20 places, 4/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 4/20 places, 4/20 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s0 s1) (LEQ s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 20343 reset in 164 ms.
Product exploration explored 100000 steps with 20336 reset in 109 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-050-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-050-LTLCardinality-10 finished in 594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 2 transition count 2
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 2 transition count 2
Applied a total of 36 rules in 1 ms. Remains 2 /20 variables (removed 18) and now considering 2/20 (removed 18) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-11 00:33:25] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:33:25] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-11 00:33:25] [INFO ] Invariant cache hit.
[2023-03-11 00:33:25] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-11 00:33:25] [INFO ] Invariant cache hit.
[2023-03-11 00:33:25] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/20 places, 2/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 2/20 places, 2/20 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 106 steps with 3 reset in 1 ms.
FORMULA Eratosthenes-PT-050-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLCardinality-11 finished in 166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 3 transition count 3
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 3 transition count 3
Applied a total of 34 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-11 00:33:25] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 00:33:25] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-11 00:33:25] [INFO ] Invariant cache hit.
[2023-03-11 00:33:25] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-11 00:33:25] [INFO ] Invariant cache hit.
[2023-03-11 00:33:25] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/20 places, 3/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 3/20 places, 3/20 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 28146 reset in 134 ms.
Product exploration explored 100000 steps with 28120 reset in 91 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-050-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-050-LTLCardinality-13 finished in 547 ms.
All properties solved by simple procedures.
Total runtime 3924 ms.
ITS solved all properties within timeout

BK_STOP 1678494807767

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Eratosthenes-PT-050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Eratosthenes-PT-050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838855400155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-050.tgz
mv Eratosthenes-PT-050 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;