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.r485-tall-167912699300404.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 itstools
Input is Szymanski-PT-a02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912699300404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.4K Feb 26 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 26 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 26 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 26 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 16:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 16:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 101K Mar 5 18:23 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 Szymanski-PT-a02-LTLFireability-00
FORMULA_NAME Szymanski-PT-a02-LTLFireability-01
FORMULA_NAME Szymanski-PT-a02-LTLFireability-02
FORMULA_NAME Szymanski-PT-a02-LTLFireability-03
FORMULA_NAME Szymanski-PT-a02-LTLFireability-04
FORMULA_NAME Szymanski-PT-a02-LTLFireability-05
FORMULA_NAME Szymanski-PT-a02-LTLFireability-06
FORMULA_NAME Szymanski-PT-a02-LTLFireability-07
FORMULA_NAME Szymanski-PT-a02-LTLFireability-08
FORMULA_NAME Szymanski-PT-a02-LTLFireability-09
FORMULA_NAME Szymanski-PT-a02-LTLFireability-10
FORMULA_NAME Szymanski-PT-a02-LTLFireability-11
FORMULA_NAME Szymanski-PT-a02-LTLFireability-12
FORMULA_NAME Szymanski-PT-a02-LTLFireability-13
FORMULA_NAME Szymanski-PT-a02-LTLFireability-14
FORMULA_NAME Szymanski-PT-a02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679220344916

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-a02
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 10:05:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 10:05:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 10:05:46] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-19 10:05:46] [INFO ] Transformed 61 places.
[2023-03-19 10:05:46] [INFO ] Transformed 224 transitions.
[2023-03-19 10:05:46] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a02-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 44 transition count 204
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 44 transition count 204
Applied a total of 8 rules in 21 ms. Remains 44 /49 variables (removed 5) and now considering 204/216 (removed 12) transitions.
[2023-03-19 10:05:46] [INFO ] Flow matrix only has 76 transitions (discarded 128 similar events)
// Phase 1: matrix 76 rows 44 cols
[2023-03-19 10:05:46] [INFO ] Computed 1 place invariants in 9 ms
[2023-03-19 10:05:47] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-19 10:05:47] [INFO ] Flow matrix only has 76 transitions (discarded 128 similar events)
[2023-03-19 10:05:47] [INFO ] Invariant cache hit.
[2023-03-19 10:05:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 10:05:47] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2023-03-19 10:05:47] [INFO ] Flow matrix only has 76 transitions (discarded 128 similar events)
[2023-03-19 10:05:47] [INFO ] Invariant cache hit.
[2023-03-19 10:05:47] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/49 places, 204/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 535 ms. Remains : 44/49 places, 204/216 transitions.
Support contains 24 out of 44 places after structural reductions.
[2023-03-19 10:05:47] [INFO ] Flatten gal took : 39 ms
[2023-03-19 10:05:47] [INFO ] Flatten gal took : 26 ms
[2023-03-19 10:05:47] [INFO ] Input system was already deterministic with 204 transitions.
Incomplete random walk after 10001 steps, including 30 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 21) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-19 10:05:48] [INFO ] Flow matrix only has 76 transitions (discarded 128 similar events)
[2023-03-19 10:05:48] [INFO ] Invariant cache hit.
[2023-03-19 10:05:48] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:05:48] [INFO ] After 32ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:2
[2023-03-19 10:05:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 10:05:48] [INFO ] After 11ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :2 sat :0 real:3
[2023-03-19 10:05:48] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2023-03-19 10:05:48] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:05:48] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-19 10:05:48] [INFO ] After 15ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2023-03-19 10:05:48] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-19 10:05:48] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 204/204 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 44 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 43 transition count 198
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 43 transition count 198
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 20 place count 43 transition count 182
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 41 transition count 174
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 41 transition count 174
Applied a total of 24 rules in 24 ms. Remains 41 /44 variables (removed 3) and now considering 174/204 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 41/44 places, 174/204 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Finished probabilistic random walk after 125 steps, run visited all 3 properties in 7 ms. (steps per millisecond=17 )
Probabilistic random walk after 125 steps, saw 97 distinct states, run finished after 7 ms. (steps per millisecond=17 ) properties seen :3
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA Szymanski-PT-a02-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 36 stable transitions
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' '!(F((G(p0)||X(F(p1)))))'
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 204/204 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 42 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 42 transition count 196
Applied a total of 4 rules in 3 ms. Remains 42 /44 variables (removed 2) and now considering 196/204 (removed 8) transitions.
[2023-03-19 10:05:48] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2023-03-19 10:05:48] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 10:05:48] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-19 10:05:48] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 10:05:48] [INFO ] Invariant cache hit.
[2023-03-19 10:05:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 10:05:48] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-19 10:05:48] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 10:05:48] [INFO ] Invariant cache hit.
[2023-03-19 10:05:48] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 196/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 42/44 places, 196/204 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-a02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s29 1)), p1:(AND (GEQ s3 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 4 ms.
FORMULA Szymanski-PT-a02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a02-LTLFireability-00 finished in 477 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))||G(p1)||G(p2)))'
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 204/204 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 42 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 42 transition count 196
Applied a total of 4 rules in 3 ms. Remains 42 /44 variables (removed 2) and now considering 196/204 (removed 8) transitions.
[2023-03-19 10:05:49] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 10:05:49] [INFO ] Invariant cache hit.
[2023-03-19 10:05:49] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 10:05:49] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 10:05:49] [INFO ] Invariant cache hit.
[2023-03-19 10:05:49] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 10:05:49] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-19 10:05:49] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 10:05:49] [INFO ] Invariant cache hit.
[2023-03-19 10:05:49] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 196/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 42/44 places, 196/204 transitions.
Stuttering acceptance computed with spot in 364 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Szymanski-PT-a02-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p2), acceptance={} source=8 dest: 8}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s38 1)), p2:(AND (OR (LT s2 1) (LT s41 1)) (OR (LT s3 1) (LT s9 1))), p0:(OR (LT s2 1) (LT s41 1))], 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 176 steps with 0 reset in 7 ms.
FORMULA Szymanski-PT-a02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a02-LTLFireability-03 finished in 584 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((X(X(p0))||F(p1)))))'
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 204/204 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 43 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 200
Applied a total of 2 rules in 6 ms. Remains 43 /44 variables (removed 1) and now considering 200/204 (removed 4) transitions.
[2023-03-19 10:05:49] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2023-03-19 10:05:49] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 10:05:49] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-19 10:05:49] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 10:05:49] [INFO ] Invariant cache hit.
[2023-03-19 10:05:49] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 10:05:49] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-19 10:05:49] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 10:05:49] [INFO ] Invariant cache hit.
[2023-03-19 10:05:49] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/44 places, 200/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 43/44 places, 200/204 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Szymanski-PT-a02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s8 1)), p0:(AND (GEQ s2 1) (GEQ s36 1))], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-a02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a02-LTLFireability-04 finished in 390 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(X(G(p0)))))'
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 204/204 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 42 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 42 transition count 196
Applied a total of 4 rules in 6 ms. Remains 42 /44 variables (removed 2) and now considering 196/204 (removed 8) transitions.
[2023-03-19 10:05:50] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2023-03-19 10:05:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 10:05:50] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-19 10:05:50] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 10:05:50] [INFO ] Invariant cache hit.
[2023-03-19 10:05:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 10:05:50] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-19 10:05:50] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 10:05:50] [INFO ] Invariant cache hit.
[2023-03-19 10:05:50] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 196/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 42/44 places, 196/204 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-a02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s3 1) (GEQ s14 1)) (AND (OR (LT s0 1) (LT s8 1)) (OR (LT s1 1) (LT s24 1))))], 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 223 steps with 1 reset in 3 ms.
FORMULA Szymanski-PT-a02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a02-LTLFireability-05 finished in 338 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||G(F(p0))))))'
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 204/204 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 42 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 20 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 40 transition count 172
Applied a total of 24 rules in 21 ms. Remains 40 /44 variables (removed 4) and now considering 172/204 (removed 32) transitions.
[2023-03-19 10:05:50] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
// Phase 1: matrix 68 rows 40 cols
[2023-03-19 10:05:50] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-19 10:05:50] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-19 10:05:50] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 10:05:50] [INFO ] Invariant cache hit.
[2023-03-19 10:05:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 10:05:50] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-19 10:05:50] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 10:05:50] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 10:05:50] [INFO ] Invariant cache hit.
[2023-03-19 10:05:50] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/44 places, 172/204 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 40/44 places, 172/204 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-a02-LTLFireability-08 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:(AND (GEQ s1 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 579 steps with 4 reset in 4 ms.
FORMULA Szymanski-PT-a02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a02-LTLFireability-08 finished in 275 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' '!(F(X((!X(!p0) U !p1))))'
Support contains 2 out of 44 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 204/204 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 42 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 42 transition count 196
Applied a total of 4 rules in 3 ms. Remains 42 /44 variables (removed 2) and now considering 196/204 (removed 8) transitions.
[2023-03-19 10:05:50] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2023-03-19 10:05:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 10:05:50] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-19 10:05:50] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 10:05:50] [INFO ] Invariant cache hit.
[2023-03-19 10:05:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 10:05:50] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-19 10:05:50] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 10:05:50] [INFO ] Invariant cache hit.
[2023-03-19 10:05:50] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 196/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 42/44 places, 196/204 transitions.
Stuttering acceptance computed with spot in 67 ms :[p1, p1]
Running random walk in product with property : Szymanski-PT-a02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s13 1))], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Computed a total of 8 stabilizing places and 32 stable transitions
Computed a total of 8 stabilizing places and 32 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-a02-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-a02-LTLFireability-09 finished in 650 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(F((G(F((p0||G(!p1))))||(!p0&&F((p0||G(!p1)))&&X(F(!p2)))))))'
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 204/204 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 43 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 200
Applied a total of 2 rules in 7 ms. Remains 43 /44 variables (removed 1) and now considering 200/204 (removed 4) transitions.
[2023-03-19 10:05:51] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2023-03-19 10:05:51] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-19 10:05:51] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 10:05:51] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 10:05:51] [INFO ] Invariant cache hit.
[2023-03-19 10:05:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 10:05:51] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-19 10:05:51] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 10:05:51] [INFO ] Invariant cache hit.
[2023-03-19 10:05:51] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/44 places, 200/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 43/44 places, 200/204 transitions.
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1)]
Running random walk in product with property : Szymanski-PT-a02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(AND (GEQ s2 1) (GEQ s42 1)), p1:(AND (GEQ s5 1) (GEQ s11 1)), p2:(AND (GEQ s3 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2196 reset in 206 ms.
Product exploration explored 100000 steps with 2150 reset in 165 ms.
Computed a total of 9 stabilizing places and 36 stable transitions
Computed a total of 9 stabilizing places and 36 stable transitions
Detected a total of 9/43 stabilizing places and 36/200 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 367 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 25 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Finished Best-First random walk after 3674 steps, including 3 resets, run visited all 1 properties in 6 ms. (steps per millisecond=612 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 10 factoid took 409 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 102 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 4 out of 43 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-19 10:05:53] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 10:05:53] [INFO ] Invariant cache hit.
[2023-03-19 10:05:53] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-19 10:05:53] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 10:05:53] [INFO ] Invariant cache hit.
[2023-03-19 10:05:53] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 10:05:53] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-19 10:05:53] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 10:05:53] [INFO ] Invariant cache hit.
[2023-03-19 10:05:53] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 43/43 places, 200/200 transitions.
Computed a total of 9 stabilizing places and 36 stable transitions
Computed a total of 9 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 305 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 27 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 10:05:53] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 10:05:53] [INFO ] Invariant cache hit.
[2023-03-19 10:05:54] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 10:05:54] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:05:54] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 10:05:54] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:05:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 10:05:54] [INFO ] After 14ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 10:05:54] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-19 10:05:54] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 200/200 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 43 transition count 197
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 19 place count 43 transition count 181
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 41 transition count 173
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 41 transition count 173
Applied a total of 23 rules in 12 ms. Remains 41 /43 variables (removed 2) and now considering 173/200 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 41/43 places, 173/200 transitions.
Incomplete random walk after 10001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished Best-First random walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 1083 reset in 135 ms.
Product exploration explored 100000 steps with 1101 reset in 132 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 200/200 transitions.
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 43 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 41 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 41 transition count 176
Applied a total of 20 rules in 15 ms. Remains 41 /43 variables (removed 2) and now considering 176/200 (removed 24) transitions.
[2023-03-19 10:05:55] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-19 10:05:55] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
// Phase 1: matrix 69 rows 41 cols
[2023-03-19 10:05:55] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 10:05:55] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/43 places, 176/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 41/43 places, 176/200 transitions.
Built C files in :
/tmp/ltsmin8532429162030104296
[2023-03-19 10:05:55] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8532429162030104296
Running compilation step : cd /tmp/ltsmin8532429162030104296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 367 ms.
Running link step : cd /tmp/ltsmin8532429162030104296;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin8532429162030104296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2235675631673555687.hoa' '--buchi-type=spotba'
LTSmin run took 673 ms.
FORMULA Szymanski-PT-a02-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Szymanski-PT-a02-LTLFireability-10 finished in 4842 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' '!((F(p0)||X(G(p1))))'
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 204/204 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 42 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 42 transition count 196
Applied a total of 4 rules in 4 ms. Remains 42 /44 variables (removed 2) and now considering 196/204 (removed 8) transitions.
[2023-03-19 10:05:56] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2023-03-19 10:05:56] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 10:05:56] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-19 10:05:56] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 10:05:56] [INFO ] Invariant cache hit.
[2023-03-19 10:05:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 10:05:56] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-19 10:05:56] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 10:05:56] [INFO ] Invariant cache hit.
[2023-03-19 10:05:56] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 196/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 42/44 places, 196/204 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-a02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s36 1)), p1:(OR (LT s2 1) (LT s15 1))], 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]]
Stuttering criterion allowed to conclude after 366 steps with 0 reset in 2 ms.
FORMULA Szymanski-PT-a02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a02-LTLFireability-11 finished in 310 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' '!(F(p0))'
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 204/204 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 42 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 20 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 40 transition count 172
Applied a total of 24 rules in 16 ms. Remains 40 /44 variables (removed 4) and now considering 172/204 (removed 32) transitions.
[2023-03-19 10:05:56] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
// Phase 1: matrix 68 rows 40 cols
[2023-03-19 10:05:56] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 10:05:56] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-19 10:05:56] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 10:05:56] [INFO ] Invariant cache hit.
[2023-03-19 10:05:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 10:05:56] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-19 10:05:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 10:05:56] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 10:05:56] [INFO ] Invariant cache hit.
[2023-03-19 10:05:56] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/44 places, 172/204 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 40/44 places, 172/204 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-a02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-a02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a02-LTLFireability-12 finished in 235 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&&X((F(G(p0))&&p1))))))'
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 204/204 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 43 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 200
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 18 place count 43 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 41 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 41 transition count 176
Applied a total of 22 rules in 11 ms. Remains 41 /44 variables (removed 3) and now considering 176/204 (removed 28) transitions.
[2023-03-19 10:05:56] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
// Phase 1: matrix 69 rows 41 cols
[2023-03-19 10:05:56] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 10:05:56] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 10:05:56] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 10:05:56] [INFO ] Invariant cache hit.
[2023-03-19 10:05:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 10:05:56] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-19 10:05:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 10:05:56] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 10:05:56] [INFO ] Invariant cache hit.
[2023-03-19 10:05:56] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/44 places, 176/204 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 41/44 places, 176/204 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Szymanski-PT-a02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s40 1)), p1:(AND (OR (LT s3 1) (LT s40 1)) (OR (LT s1 1) (LT s38 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 430 reset in 188 ms.
Product exploration explored 100000 steps with 416 reset in 188 ms.
Computed a total of 9 stabilizing places and 36 stable transitions
Computed a total of 9 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 374 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 10:05:58] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 10:05:58] [INFO ] Invariant cache hit.
[2023-03-19 10:05:58] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:05:58] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 10:05:58] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 10:05:58] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 10:05:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 10:05:58] [INFO ] After 7ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 10:05:58] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-19 10:05:58] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 176/176 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 41 transition count 172
Applied a total of 4 rules in 11 ms. Remains 41 /41 variables (removed 0) and now considering 172/176 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 41/41 places, 172/176 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Finished probabilistic random walk after 88 steps, run visited all 2 properties in 7 ms. (steps per millisecond=12 )
Probabilistic random walk after 88 steps, saw 69 distinct states, run finished after 7 ms. (steps per millisecond=12 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 633 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-19 10:05:59] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 10:05:59] [INFO ] Invariant cache hit.
[2023-03-19 10:05:59] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-19 10:05:59] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 10:05:59] [INFO ] Invariant cache hit.
[2023-03-19 10:05:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 10:05:59] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-19 10:05:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 10:05:59] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 10:05:59] [INFO ] Invariant cache hit.
[2023-03-19 10:05:59] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 41/41 places, 176/176 transitions.
Computed a total of 9 stabilizing places and 36 stable transitions
Computed a total of 9 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 343 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 10:06:00] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 10:06:00] [INFO ] Invariant cache hit.
[2023-03-19 10:06:00] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:06:00] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 10:06:00] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:06:00] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 10:06:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 10:06:00] [INFO ] After 7ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 10:06:00] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-19 10:06:00] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 176/176 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 41 transition count 172
Applied a total of 4 rules in 5 ms. Remains 41 /41 variables (removed 0) and now considering 172/176 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 41/41 places, 172/176 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Finished probabilistic random walk after 88 steps, run visited all 2 properties in 6 ms. (steps per millisecond=14 )
Probabilistic random walk after 88 steps, saw 69 distinct states, run finished after 6 ms. (steps per millisecond=14 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 415 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 396 reset in 98 ms.
Product exploration explored 100000 steps with 426 reset in 107 ms.
Built C files in :
/tmp/ltsmin6321991189475886646
[2023-03-19 10:06:01] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2023-03-19 10:06:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:06:01] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2023-03-19 10:06:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:06:01] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2023-03-19 10:06:01] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:06:01] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6321991189475886646
Running compilation step : cd /tmp/ltsmin6321991189475886646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 308 ms.
Running link step : cd /tmp/ltsmin6321991189475886646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6321991189475886646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased392019335426393785.hoa' '--buchi-type=spotba'
LTSmin run took 1505 ms.
FORMULA Szymanski-PT-a02-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Szymanski-PT-a02-LTLFireability-15 finished in 6691 ms.
All properties solved by simple procedures.
Total runtime 17120 ms.

BK_STOP 1679220364491

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Szymanski-PT-a02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Szymanski-PT-a02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r485-tall-167912699300404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-a02.tgz
mv Szymanski-PT-a02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;