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.r293-tall-167873945800740.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 PolyORBNT-PT-S05J60, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945800740
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 39K Feb 25 23:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 208K Feb 25 23:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Feb 25 23:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 319K Feb 25 23:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 37K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 44K Feb 25 23:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 25 23:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 154K Feb 25 23:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 663K Feb 25 23:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 PolyORBNT-PT-S05J60-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678959193881

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=PolyORBNT-PT-S05J60
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 09:33:15] [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-16 09:33:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 09:33:15] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2023-03-16 09:33:15] [INFO ] Transformed 909 places.
[2023-03-16 09:33:15] [INFO ] Transformed 1970 transitions.
[2023-03-16 09:33:15] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2023-03-16 09:33:15] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-16 09:33:15] [INFO ] Reduced 10 identical enabling conditions.
[2023-03-16 09:33:15] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-16 09:33:15] [INFO ] Reduced 90 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 764 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 905 transition count 1315
Applied a total of 4 rules in 45 ms. Remains 905 /909 variables (removed 4) and now considering 1315/1315 (removed 0) transitions.
[2023-03-16 09:33:15] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 905 cols
[2023-03-16 09:33:15] [INFO ] Computed 138 place invariants in 94 ms
[2023-03-16 09:33:17] [INFO ] Dead Transitions using invariants and state equation in 2169 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2023-03-16 09:33:17] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
// Phase 1: matrix 1216 rows 905 cols
[2023-03-16 09:33:17] [INFO ] Computed 138 place invariants in 39 ms
[2023-03-16 09:33:18] [INFO ] Implicit Places using invariants in 650 ms returned []
[2023-03-16 09:33:18] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-16 09:33:18] [INFO ] Invariant cache hit.
[2023-03-16 09:33:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:33:25] [INFO ] Implicit Places using invariants and state equation in 7444 ms returned []
Implicit Place search using SMT with State Equation took 8098 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 905/909 places, 1220/1315 transitions.
Applied a total of 0 rules in 20 ms. Remains 905 /905 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10361 ms. Remains : 905/909 places, 1220/1315 transitions.
Support contains 764 out of 905 places after structural reductions.
[2023-03-16 09:33:26] [INFO ] Flatten gal took : 134 ms
[2023-03-16 09:33:26] [INFO ] Flatten gal took : 99 ms
[2023-03-16 09:33:26] [INFO ] Input system was already deterministic with 1220 transitions.
Support contains 641 out of 905 places (down from 764) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 680 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 26) seen :23
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 09:33:27] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-16 09:33:27] [INFO ] Invariant cache hit.
[2023-03-16 09:33:27] [INFO ] [Real]Absence check using 112 positive place invariants in 26 ms returned sat
[2023-03-16 09:33:27] [INFO ] [Real]Absence check using 112 positive and 26 generalized place invariants in 35 ms returned sat
[2023-03-16 09:33:27] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 09:33:27] [INFO ] [Nat]Absence check using 112 positive place invariants in 18 ms returned sat
[2023-03-16 09:33:27] [INFO ] [Nat]Absence check using 112 positive and 26 generalized place invariants in 38 ms returned sat
[2023-03-16 09:33:28] [INFO ] After 841ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 09:33:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:33:28] [INFO ] After 322ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 09:33:29] [INFO ] Deduced a trap composed of 523 places in 991 ms of which 4 ms to minimize.
[2023-03-16 09:33:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1720 ms
[2023-03-16 09:33:31] [INFO ] Deduced a trap composed of 140 places in 117 ms of which 1 ms to minimize.
[2023-03-16 09:33:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-16 09:33:31] [INFO ] After 3101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 365 ms.
[2023-03-16 09:33:31] [INFO ] After 4542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 905 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 904 transition count 1157
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 841 transition count 1155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 131 place count 839 transition count 1155
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 131 place count 839 transition count 1092
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 257 place count 776 transition count 1092
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 258 place count 775 transition count 1091
Iterating global reduction 3 with 1 rules applied. Total rules applied 259 place count 775 transition count 1091
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 263 place count 773 transition count 1089
Applied a total of 263 rules in 258 ms. Remains 773 /905 variables (removed 132) and now considering 1089/1220 (removed 131) transitions.
[2023-03-16 09:33:32] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
// Phase 1: matrix 1085 rows 773 cols
[2023-03-16 09:33:32] [INFO ] Computed 137 place invariants in 17 ms
[2023-03-16 09:33:33] [INFO ] Dead Transitions using invariants and state equation in 1101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1362 ms. Remains : 773/905 places, 1089/1220 transitions.
Finished random walk after 1343 steps, including 61 resets, run visited all 3 properties in 21 ms. (steps per millisecond=63 )
FORMULA PolyORBNT-PT-S05J60-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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' '!((X(X(G(p0)))&&F(p1)))'
Support contains 63 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Applied a total of 1 rules in 52 ms. Remains 904 /905 variables (removed 1) and now considering 1220/1220 (removed 0) transitions.
[2023-03-16 09:33:33] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
// Phase 1: matrix 1216 rows 904 cols
[2023-03-16 09:33:33] [INFO ] Computed 137 place invariants in 19 ms
[2023-03-16 09:33:35] [INFO ] Dead Transitions using invariants and state equation in 1875 ms found 0 transitions.
[2023-03-16 09:33:35] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-16 09:33:35] [INFO ] Invariant cache hit.
[2023-03-16 09:33:37] [INFO ] Implicit Places using invariants in 1401 ms returned []
[2023-03-16 09:33:37] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-16 09:33:37] [INFO ] Invariant cache hit.
[2023-03-16 09:33:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:33:52] [INFO ] Implicit Places using invariants and state equation in 15070 ms returned []
Implicit Place search using SMT with State Equation took 16480 ms to find 0 implicit places.
[2023-03-16 09:33:52] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-16 09:33:52] [INFO ] Invariant cache hit.
[2023-03-16 09:33:54] [INFO ] Dead Transitions using invariants and state equation in 1808 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 904/905 places, 1220/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20218 ms. Remains : 904/905 places, 1220/1220 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s350 1), p0:(OR (AND (GEQ s33 1) (GEQ s261 1)) (AND (GEQ s261 1) (GEQ s467 1)) (AND (GEQ s261 1) (GEQ s865 1)) (AND (GEQ s13 1) (GEQ s261 1)) (AND...], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-00 finished in 20578 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))))'
Support contains 62 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 52 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-16 09:33:54] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2023-03-16 09:33:54] [INFO ] Computed 137 place invariants in 24 ms
[2023-03-16 09:33:56] [INFO ] Dead Transitions using invariants and state equation in 1767 ms found 0 transitions.
[2023-03-16 09:33:56] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:33:56] [INFO ] Invariant cache hit.
[2023-03-16 09:33:57] [INFO ] Implicit Places using invariants in 1464 ms returned []
[2023-03-16 09:33:57] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:33:57] [INFO ] Invariant cache hit.
[2023-03-16 09:33:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:34:13] [INFO ] Implicit Places using invariants and state equation in 16288 ms returned []
Implicit Place search using SMT with State Equation took 17754 ms to find 0 implicit places.
[2023-03-16 09:34:13] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:34:13] [INFO ] Invariant cache hit.
[2023-03-16 09:34:15] [INFO ] Dead Transitions using invariants and state equation in 1885 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21462 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(GEQ s489 2), p0:(OR (GEQ s489 2) (GEQ s445 1) (GEQ s133 1) (GEQ s131 1) (GEQ s765 1) (GEQ s135 1) (GEQ s639 1) (GEQ s453 1) (GEQ s893 1) (GEQ s325 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 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-01 finished in 21648 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(p0)||F(G(p1))))'
Support contains 429 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1215
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 899 transition count 1215
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 10 place count 899 transition count 1150
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 140 place count 834 transition count 1150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 833 transition count 1149
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 833 transition count 1149
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 831 transition count 1147
Applied a total of 146 rules in 106 ms. Remains 831 /905 variables (removed 74) and now considering 1147/1220 (removed 73) transitions.
[2023-03-16 09:34:16] [INFO ] Flow matrix only has 1143 transitions (discarded 4 similar events)
// Phase 1: matrix 1143 rows 831 cols
[2023-03-16 09:34:16] [INFO ] Computed 137 place invariants in 30 ms
[2023-03-16 09:34:17] [INFO ] Dead Transitions using invariants and state equation in 1293 ms found 0 transitions.
[2023-03-16 09:34:17] [INFO ] Flow matrix only has 1143 transitions (discarded 4 similar events)
[2023-03-16 09:34:17] [INFO ] Invariant cache hit.
[2023-03-16 09:34:18] [INFO ] Implicit Places using invariants in 821 ms returned []
[2023-03-16 09:34:18] [INFO ] Flow matrix only has 1143 transitions (discarded 4 similar events)
[2023-03-16 09:34:18] [INFO ] Invariant cache hit.
[2023-03-16 09:34:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:34:28] [INFO ] Implicit Places using invariants and state equation in 10397 ms returned []
Implicit Place search using SMT with State Equation took 11221 ms to find 0 implicit places.
[2023-03-16 09:34:28] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-16 09:34:28] [INFO ] Flow matrix only has 1143 transitions (discarded 4 similar events)
[2023-03-16 09:34:28] [INFO ] Invariant cache hit.
[2023-03-16 09:34:29] [INFO ] Dead Transitions using invariants and state equation in 1270 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 831/905 places, 1147/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13983 ms. Remains : 831/905 places, 1147/1220 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s483 1)) (AND (GEQ s77 1) (GEQ s671 1)) (AND (GEQ s245 1) (GEQ s681 1)) (AND (GEQ s296 1) (GEQ s465 1)) (AND (GEQ s208 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-02 finished in 14075 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 7 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 48 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-16 09:34:30] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2023-03-16 09:34:30] [INFO ] Computed 137 place invariants in 30 ms
[2023-03-16 09:34:31] [INFO ] Dead Transitions using invariants and state equation in 1715 ms found 0 transitions.
[2023-03-16 09:34:31] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:34:31] [INFO ] Invariant cache hit.
[2023-03-16 09:34:33] [INFO ] Implicit Places using invariants in 1420 ms returned []
[2023-03-16 09:34:33] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:34:33] [INFO ] Invariant cache hit.
[2023-03-16 09:34:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:34:50] [INFO ] Implicit Places using invariants and state equation in 17328 ms returned []
Implicit Place search using SMT with State Equation took 18750 ms to find 0 implicit places.
[2023-03-16 09:34:50] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:34:50] [INFO ] Invariant cache hit.
[2023-03-16 09:34:52] [INFO ] Dead Transitions using invariants and state equation in 1900 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22425 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-03 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:(OR (AND (GEQ s119 1) (GEQ s212 2) (GEQ s528 1) (GEQ s710 7)) (AND (GEQ s119 1) (GEQ s528 1) (GEQ s536 1) (GEQ s710 7) (GEQ s819 1)) (AND (GEQ s119 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-03 finished in 22530 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||G(F(p1)))))'
Support contains 7 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 53 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-16 09:34:52] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:34:52] [INFO ] Invariant cache hit.
[2023-03-16 09:34:54] [INFO ] Dead Transitions using invariants and state equation in 1893 ms found 0 transitions.
[2023-03-16 09:34:54] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:34:54] [INFO ] Invariant cache hit.
[2023-03-16 09:34:55] [INFO ] Implicit Places using invariants in 1433 ms returned []
[2023-03-16 09:34:55] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:34:55] [INFO ] Invariant cache hit.
[2023-03-16 09:34:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:35:14] [INFO ] Implicit Places using invariants and state equation in 18598 ms returned []
Implicit Place search using SMT with State Equation took 20033 ms to find 0 implicit places.
[2023-03-16 09:35:14] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:35:14] [INFO ] Invariant cache hit.
[2023-03-16 09:35:16] [INFO ] Dead Transitions using invariants and state equation in 1905 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23887 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s119 1) (LT s457 1) (LT s536 2) (LT s710 6) (LT s819 1)) (OR (LT s119 1) (LT s212 1) (LT s457 2) (LT s528 1) (LT s710 6)) (OR (LT s119 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1100 ms.
Product exploration explored 100000 steps with 50000 reset in 1024 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J60-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-04 finished in 26329 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' '!(((p0 U p1) U (X(!X((!F(p2) U X(p3)))) U p3)))'
Support contains 73 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 51 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-16 09:35:18] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:35:18] [INFO ] Invariant cache hit.
[2023-03-16 09:35:20] [INFO ] Dead Transitions using invariants and state equation in 1789 ms found 0 transitions.
[2023-03-16 09:35:20] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:35:20] [INFO ] Invariant cache hit.
[2023-03-16 09:35:22] [INFO ] Implicit Places using invariants in 1305 ms returned []
[2023-03-16 09:35:22] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:35:22] [INFO ] Invariant cache hit.
[2023-03-16 09:35:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:35:37] [INFO ] Implicit Places using invariants and state equation in 15584 ms returned []
Implicit Place search using SMT with State Equation took 16897 ms to find 0 implicit places.
[2023-03-16 09:35:37] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:35:37] [INFO ] Invariant cache hit.
[2023-03-16 09:35:39] [INFO ] Dead Transitions using invariants and state equation in 1890 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20632 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 614 ms :[(NOT p3), true, (AND (NOT p1) p3), p3, p3, (AND (NOT p2) p3), true, (AND (NOT p1) p3), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) p3), (NOT p2), (AND (NOT p1) (NOT p2) p3), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=p3, acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 10}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=9 dest: 12}], [{ cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=10 dest: 6}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=10 dest: 13}], [{ cond=(NOT p2), acceptance={0} source=11 dest: 11}], [{ cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=12 dest: 11}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={} source=12 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=13 dest: 13}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=14 dest: 14}]], initial=0, aps=[p3:(OR (AND (GEQ s110 1) (GEQ s305 1) (GEQ s835 1)) (AND (GEQ s305 1) (GEQ s807 1) (GEQ s835 1)) (AND (GEQ s305 1) (GEQ s495 1) (GEQ s835 1)) (AND (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 50 steps with 4 reset in 5 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-05 finished in 21288 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 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 904 transition count 1156
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 840 transition count 1155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 839 transition count 1155
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 130 place count 839 transition count 1091
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 258 place count 775 transition count 1091
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 262 place count 773 transition count 1089
Applied a total of 262 rules in 97 ms. Remains 773 /905 variables (removed 132) and now considering 1089/1220 (removed 131) transitions.
[2023-03-16 09:35:40] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
// Phase 1: matrix 1085 rows 773 cols
[2023-03-16 09:35:40] [INFO ] Computed 137 place invariants in 27 ms
[2023-03-16 09:35:41] [INFO ] Dead Transitions using invariants and state equation in 1149 ms found 0 transitions.
[2023-03-16 09:35:41] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-16 09:35:41] [INFO ] Invariant cache hit.
[2023-03-16 09:35:42] [INFO ] Implicit Places using invariants in 1357 ms returned []
[2023-03-16 09:35:42] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-16 09:35:42] [INFO ] Invariant cache hit.
[2023-03-16 09:35:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:35:56] [INFO ] Implicit Places using invariants and state equation in 13497 ms returned []
Implicit Place search using SMT with State Equation took 14856 ms to find 0 implicit places.
[2023-03-16 09:35:56] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-16 09:35:56] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-16 09:35:56] [INFO ] Invariant cache hit.
[2023-03-16 09:35:57] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 773/905 places, 1089/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17184 ms. Remains : 773/905 places, 1089/1220 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s396 1) (GEQ s687 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 7 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-06 finished in 17233 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(p0) U ((p1 U p2)||F(p1))))||G(F(p3))))'
Support contains 7 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 52 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-16 09:35:57] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2023-03-16 09:35:57] [INFO ] Computed 137 place invariants in 27 ms
[2023-03-16 09:35:59] [INFO ] Dead Transitions using invariants and state equation in 1779 ms found 0 transitions.
[2023-03-16 09:35:59] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:35:59] [INFO ] Invariant cache hit.
[2023-03-16 09:36:00] [INFO ] Implicit Places using invariants in 1397 ms returned []
[2023-03-16 09:36:00] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:36:00] [INFO ] Invariant cache hit.
[2023-03-16 09:36:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:36:15] [INFO ] Implicit Places using invariants and state equation in 14986 ms returned []
Implicit Place search using SMT with State Equation took 16384 ms to find 0 implicit places.
[2023-03-16 09:36:15] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:36:15] [INFO ] Invariant cache hit.
[2023-03-16 09:36:17] [INFO ] Dead Transitions using invariants and state equation in 1899 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20123 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 831 ms :[(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1) p2 p0), (AND (NOT p3) p1)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(OR p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s158 1) (GEQ s835 1) (GEQ s866 1)), p3:(LT s689 1), p2:(AND (GEQ s90 1) (GEQ s345 1)), p0:(GEQ s208 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11357 reset in 413 ms.
Product exploration explored 100000 steps with 11608 reset in 391 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (OR p1 p2))), (X (X p3)), true, (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 473 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) p1)]
Incomplete random walk after 10000 steps, including 686 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-16 09:36:20] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:36:20] [INFO ] Invariant cache hit.
[2023-03-16 09:36:20] [INFO ] [Real]Absence check using 112 positive place invariants in 19 ms returned sat
[2023-03-16 09:36:20] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 35 ms returned sat
[2023-03-16 09:36:20] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (OR p1 p2))), (X (X p3)), true, (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p1))), (G (NOT (AND (NOT p3) p1)))]
False Knowledge obtained : [(F p1), (F (NOT p3)), (F (AND p0 (NOT p1))), (F (AND (NOT p3) (NOT p1)))]
Knowledge based reduction with 12 factoid took 850 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 425 ms :[(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (NOT p3), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p3) p1)]
Stuttering acceptance computed with spot in 389 ms :[(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (NOT p3), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p3) p1)]
Support contains 5 out of 903 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1219/1219 transitions.
Applied a total of 0 rules in 25 ms. Remains 903 /903 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
[2023-03-16 09:36:22] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:36:22] [INFO ] Invariant cache hit.
[2023-03-16 09:36:23] [INFO ] Dead Transitions using invariants and state equation in 1844 ms found 0 transitions.
[2023-03-16 09:36:23] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:36:23] [INFO ] Invariant cache hit.
[2023-03-16 09:36:25] [INFO ] Implicit Places using invariants in 1393 ms returned []
[2023-03-16 09:36:25] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:36:25] [INFO ] Invariant cache hit.
[2023-03-16 09:36:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:36:41] [INFO ] Implicit Places using invariants and state equation in 15880 ms returned []
Implicit Place search using SMT with State Equation took 17276 ms to find 0 implicit places.
[2023-03-16 09:36:41] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:36:41] [INFO ] Invariant cache hit.
[2023-03-16 09:36:42] [INFO ] Dead Transitions using invariants and state equation in 1791 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20939 ms. Remains : 903/903 places, 1219/1219 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), (NOT p3), (NOT p3), (AND (NOT p3) p1)]
Finished random walk after 4095 steps, including 284 resets, run visited all 2 properties in 46 ms. (steps per millisecond=89 )
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p3)), (F p1)]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), (NOT p3), (NOT p3), (AND (NOT p3) p1)]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), (NOT p3), (NOT p3), (AND (NOT p3) p1)]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), (NOT p3), (NOT p3), (AND (NOT p3) p1)]
Product exploration explored 100000 steps with 6933 reset in 302 ms.
Product exploration explored 100000 steps with 6902 reset in 324 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), (NOT p3), (NOT p3), (AND (NOT p3) p1)]
Support contains 4 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1219/1219 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 903 transition count 1219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 64 place count 903 transition count 1220
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 903 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 902 transition count 1219
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 902 transition count 1219
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 130 places in 0 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 133 place count 902 transition count 1219
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 197 place count 838 transition count 1155
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 64 rules applied. Total rules applied 261 place count 838 transition count 1155
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 261 rules in 214 ms. Remains 838 /903 variables (removed 65) and now considering 1155/1219 (removed 64) transitions.
[2023-03-16 09:36:45] [INFO ] Flow matrix only has 1151 transitions (discarded 4 similar events)
// Phase 1: matrix 1151 rows 838 cols
[2023-03-16 09:36:45] [INFO ] Computed 137 place invariants in 17 ms
[2023-03-16 09:36:46] [INFO ] Dead Transitions using invariants and state equation in 1035 ms found 0 transitions.
[2023-03-16 09:36:46] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-16 09:36:46] [INFO ] Flow matrix only has 1151 transitions (discarded 4 similar events)
[2023-03-16 09:36:46] [INFO ] Invariant cache hit.
[2023-03-16 09:36:47] [INFO ] Dead Transitions using invariants and state equation in 1019 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 838/903 places, 1155/1219 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2303 ms. Remains : 838/903 places, 1155/1219 transitions.
Built C files in :
/tmp/ltsmin16290788798661451516
[2023-03-16 09:36:47] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16290788798661451516
Running compilation step : cd /tmp/ltsmin16290788798661451516;'/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 2351 ms.
Running link step : cd /tmp/ltsmin16290788798661451516;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin16290788798661451516;'/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/stateBased11001552330705772848.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1219/1219 transitions.
Applied a total of 0 rules in 26 ms. Remains 903 /903 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
[2023-03-16 09:37:02] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2023-03-16 09:37:02] [INFO ] Computed 137 place invariants in 17 ms
[2023-03-16 09:37:04] [INFO ] Dead Transitions using invariants and state equation in 1777 ms found 0 transitions.
[2023-03-16 09:37:04] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:37:04] [INFO ] Invariant cache hit.
[2023-03-16 09:37:05] [INFO ] Implicit Places using invariants in 1438 ms returned []
[2023-03-16 09:37:05] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:37:05] [INFO ] Invariant cache hit.
[2023-03-16 09:37:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:37:23] [INFO ] Implicit Places using invariants and state equation in 17252 ms returned []
Implicit Place search using SMT with State Equation took 18692 ms to find 0 implicit places.
[2023-03-16 09:37:23] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:37:23] [INFO ] Invariant cache hit.
[2023-03-16 09:37:25] [INFO ] Dead Transitions using invariants and state equation in 1913 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22410 ms. Remains : 903/903 places, 1219/1219 transitions.
Built C files in :
/tmp/ltsmin8183974025469951245
[2023-03-16 09:37:25] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8183974025469951245
Running compilation step : cd /tmp/ltsmin8183974025469951245;'/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 2161 ms.
Running link step : cd /tmp/ltsmin8183974025469951245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8183974025469951245;'/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/stateBased1710245225999236869.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 09:37:40] [INFO ] Flatten gal took : 73 ms
[2023-03-16 09:37:40] [INFO ] Flatten gal took : 72 ms
[2023-03-16 09:37:40] [INFO ] Time to serialize gal into /tmp/LTL10497892726796453162.gal : 15 ms
[2023-03-16 09:37:40] [INFO ] Time to serialize properties into /tmp/LTL5231978115792605716.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10497892726796453162.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1122383817643242514.hoa' '-atoms' '/tmp/LTL5231978115792605716.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5231978115792605716.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1122383817643242514.hoa
Detected timeout of ITS tools.
[2023-03-16 09:37:55] [INFO ] Flatten gal took : 56 ms
[2023-03-16 09:37:55] [INFO ] Flatten gal took : 53 ms
[2023-03-16 09:37:55] [INFO ] Time to serialize gal into /tmp/LTL6025414612611399192.gal : 7 ms
[2023-03-16 09:37:55] [INFO ] Time to serialize properties into /tmp/LTL4309059140664652148.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6025414612611399192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4309059140664652148.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(!((X("(NotifyEventEndOfCheckSourcesB_1>=1)"))U((("(((mi2>=1)&&(block>=1))&&(QueueJobB_1_55>=1))")U("((place_782_1>=1)&&(JobCnt>=...248
Formula 0 simplified : X((X"(NotifyEventEndOfCheckSourcesB_1>=1)" U (("(((mi2>=1)&&(block>=1))&&(QueueJobB_1_55>=1))" U "((place_782_1>=1)&&(JobCnt>=1))") ...231
Detected timeout of ITS tools.
[2023-03-16 09:38:10] [INFO ] Flatten gal took : 49 ms
[2023-03-16 09:38:10] [INFO ] Applying decomposition
[2023-03-16 09:38:10] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9581290032811718125.txt' '-o' '/tmp/graph9581290032811718125.bin' '-w' '/tmp/graph9581290032811718125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9581290032811718125.bin' '-l' '-1' '-v' '-w' '/tmp/graph9581290032811718125.weights' '-q' '0' '-e' '0.001'
[2023-03-16 09:38:11] [INFO ] Decomposing Gal with order
[2023-03-16 09:38:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 09:38:11] [INFO ] Removed a total of 1321 redundant transitions.
[2023-03-16 09:38:11] [INFO ] Flatten gal took : 372 ms
[2023-03-16 09:38:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 401 labels/synchronizations in 67 ms.
[2023-03-16 09:38:11] [INFO ] Time to serialize gal into /tmp/LTL4464740075058567177.gal : 15 ms
[2023-03-16 09:38:12] [INFO ] Time to serialize properties into /tmp/LTL6262689917711406664.ltl : 431 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4464740075058567177.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6262689917711406664.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X(!((X("(i24.i6.u69.NotifyEventEndOfCheckSourcesB_1>=1)"))U((("(((i39.u112.mi2>=1)&&(i39.u115.block>=1))&&(i39.u112.QueueJobB_1_55...337
Formula 0 simplified : X((X"(i24.i6.u69.NotifyEventEndOfCheckSourcesB_1>=1)" U (("(((i39.u112.mi2>=1)&&(i39.u115.block>=1))&&(i39.u112.QueueJobB_1_55>=1))"...320
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15526598588677456476
[2023-03-16 09:38:27] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15526598588677456476
Running compilation step : cd /tmp/ltsmin15526598588677456476;'/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 2161 ms.
Running link step : cd /tmp/ltsmin15526598588677456476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15526598588677456476;'/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' '--ltl' '(X(!(X((LTLAPp0==true)) U (((LTLAPp1==true) U (LTLAPp2==true))||<>((LTLAPp1==true)))))||[](<>((LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-10 finished in 164827 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' '!(((!p0||F((G(p1)||(F(p3)&&p2)))) U (p4 U p1)))'
Support contains 10 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 905 transition count 1157
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 842 transition count 1156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 841 transition count 1156
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 128 place count 841 transition count 1094
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 252 place count 779 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 253 place count 778 transition count 1093
Iterating global reduction 3 with 1 rules applied. Total rules applied 254 place count 778 transition count 1093
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 256 place count 777 transition count 1092
Applied a total of 256 rules in 108 ms. Remains 777 /905 variables (removed 128) and now considering 1092/1220 (removed 128) transitions.
[2023-03-16 09:38:42] [INFO ] Flow matrix only has 1088 transitions (discarded 4 similar events)
// Phase 1: matrix 1088 rows 777 cols
[2023-03-16 09:38:42] [INFO ] Computed 138 place invariants in 19 ms
[2023-03-16 09:38:43] [INFO ] Dead Transitions using invariants and state equation in 1138 ms found 0 transitions.
[2023-03-16 09:38:43] [INFO ] Flow matrix only has 1088 transitions (discarded 4 similar events)
[2023-03-16 09:38:43] [INFO ] Invariant cache hit.
[2023-03-16 09:38:44] [INFO ] Implicit Places using invariants in 1228 ms returned []
[2023-03-16 09:38:44] [INFO ] Flow matrix only has 1088 transitions (discarded 4 similar events)
[2023-03-16 09:38:44] [INFO ] Invariant cache hit.
[2023-03-16 09:38:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:38:59] [INFO ] Implicit Places using invariants and state equation in 14464 ms returned []
Implicit Place search using SMT with State Equation took 15692 ms to find 0 implicit places.
[2023-03-16 09:38:59] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-16 09:38:59] [INFO ] Flow matrix only has 1088 transitions (discarded 4 similar events)
[2023-03-16 09:38:59] [INFO ] Invariant cache hit.
[2023-03-16 09:39:00] [INFO ] Dead Transitions using invariants and state equation in 1116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 777/905 places, 1092/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18086 ms. Remains : 777/905 places, 1092/1220 transitions.
Stuttering acceptance computed with spot in 348 ms :[(NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p4) p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p4) p0 p2 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p4 p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p4 p0 p2 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p4) (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p4 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p4 (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p4) (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p4) (NOT p2) (NOT p3))), acceptance={} source=4 dest: 2}, { cond=(OR (AND (NOT p1) p4 (NOT p0) (NOT p3)) (AND (NOT p1) p4 (NOT p2) (NOT p3))), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s602 1), p4:(GEQ s691 1), p0:(AND (GEQ s57 1) (GEQ s70 1) (GEQ s612 1) (GEQ s636 1)), p2:(AND (GEQ s125 1) (GEQ s261 1)), p3:(AND (GEQ s80 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-11 finished in 18463 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(G(((p0&&X(G(p1))) U p2))))'
Support contains 4 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 904 transition count 1157
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 128 place count 841 transition count 1155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 839 transition count 1155
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 130 place count 839 transition count 1092
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 256 place count 776 transition count 1092
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 257 place count 775 transition count 1091
Iterating global reduction 3 with 1 rules applied. Total rules applied 258 place count 775 transition count 1091
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 262 place count 773 transition count 1089
Applied a total of 262 rules in 90 ms. Remains 773 /905 variables (removed 132) and now considering 1089/1220 (removed 131) transitions.
[2023-03-16 09:39:00] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
// Phase 1: matrix 1085 rows 773 cols
[2023-03-16 09:39:00] [INFO ] Computed 137 place invariants in 25 ms
[2023-03-16 09:39:01] [INFO ] Dead Transitions using invariants and state equation in 1049 ms found 0 transitions.
[2023-03-16 09:39:01] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-16 09:39:01] [INFO ] Invariant cache hit.
[2023-03-16 09:39:03] [INFO ] Implicit Places using invariants in 1243 ms returned []
[2023-03-16 09:39:03] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-16 09:39:03] [INFO ] Invariant cache hit.
[2023-03-16 09:39:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:39:21] [INFO ] Implicit Places using invariants and state equation in 18349 ms returned []
Implicit Place search using SMT with State Equation took 19594 ms to find 0 implicit places.
[2023-03-16 09:39:21] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-16 09:39:21] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-16 09:39:21] [INFO ] Invariant cache hit.
[2023-03-16 09:39:22] [INFO ] Dead Transitions using invariants and state equation in 1114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 773/905 places, 1089/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21877 ms. Remains : 773/905 places, 1089/1220 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s599 1), p0:(GEQ s598 1), p1:(AND (GEQ s221 1) (GEQ s371 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 1 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-13 finished in 22010 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(G(p0)))'
Support contains 2 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1155
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 839 transition count 1155
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 839 transition count 1090
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 774 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 773 transition count 1089
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 773 transition count 1089
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 771 transition count 1087
Applied a total of 266 rules in 83 ms. Remains 771 /905 variables (removed 134) and now considering 1087/1220 (removed 133) transitions.
[2023-03-16 09:39:22] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-16 09:39:22] [INFO ] Computed 137 place invariants in 26 ms
[2023-03-16 09:39:23] [INFO ] Dead Transitions using invariants and state equation in 1118 ms found 0 transitions.
[2023-03-16 09:39:23] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-16 09:39:23] [INFO ] Invariant cache hit.
[2023-03-16 09:39:25] [INFO ] Implicit Places using invariants in 1264 ms returned []
[2023-03-16 09:39:25] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-16 09:39:25] [INFO ] Invariant cache hit.
[2023-03-16 09:39:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:39:38] [INFO ] Implicit Places using invariants and state equation in 13383 ms returned []
Implicit Place search using SMT with State Equation took 14649 ms to find 0 implicit places.
[2023-03-16 09:39:38] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-16 09:39:38] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-16 09:39:38] [INFO ] Invariant cache hit.
[2023-03-16 09:39:39] [INFO ] Dead Transitions using invariants and state equation in 1124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 771/905 places, 1087/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17009 ms. Remains : 771/905 places, 1087/1220 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s75 1) (GEQ s707 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-14 finished in 17065 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)||(!p1&&X(X(F(p2)))))))'
Support contains 6 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 44 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-16 09:39:39] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2023-03-16 09:39:39] [INFO ] Computed 137 place invariants in 23 ms
[2023-03-16 09:39:41] [INFO ] Dead Transitions using invariants and state equation in 1825 ms found 0 transitions.
[2023-03-16 09:39:41] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:39:41] [INFO ] Invariant cache hit.
[2023-03-16 09:39:43] [INFO ] Implicit Places using invariants in 1462 ms returned []
[2023-03-16 09:39:43] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:39:43] [INFO ] Invariant cache hit.
[2023-03-16 09:39:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:40:02] [INFO ] Implicit Places using invariants and state equation in 19323 ms returned []
Implicit Place search using SMT with State Equation took 20787 ms to find 0 implicit places.
[2023-03-16 09:40:02] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-16 09:40:02] [INFO ] Invariant cache hit.
[2023-03-16 09:40:04] [INFO ] Dead Transitions using invariants and state equation in 1903 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24562 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=1, aps=[p2:(GEQ s379 1), p0:(AND (GEQ s305 1) (GEQ s664 1) (GEQ s835 1)), p1:(AND (GEQ s158 1) (GEQ s835 1) (GEQ s866 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, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-15 finished in 24860 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(p0) U ((p1 U p2)||F(p1))))||G(F(p3))))'
[2023-03-16 09:40:04] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14236120023059998447
[2023-03-16 09:40:04] [INFO ] Computing symmetric may disable matrix : 1220 transitions.
[2023-03-16 09:40:04] [INFO ] Applying decomposition
[2023-03-16 09:40:04] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 09:40:04] [INFO ] Computing symmetric may enable matrix : 1220 transitions.
[2023-03-16 09:40:04] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 09:40:04] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1676832461588808787.txt' '-o' '/tmp/graph1676832461588808787.bin' '-w' '/tmp/graph1676832461588808787.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1676832461588808787.bin' '-l' '-1' '-v' '-w' '/tmp/graph1676832461588808787.weights' '-q' '0' '-e' '0.001'
[2023-03-16 09:40:05] [INFO ] Decomposing Gal with order
[2023-03-16 09:40:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 09:40:05] [INFO ] Computing Do-Not-Accords matrix : 1220 transitions.
[2023-03-16 09:40:05] [INFO ] Removed a total of 1379 redundant transitions.
[2023-03-16 09:40:05] [INFO ] Flatten gal took : 152 ms
[2023-03-16 09:40:05] [INFO ] Computation of Completed DNA matrix. took 65 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 09:40:05] [INFO ] Built C files in 415ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14236120023059998447
Running compilation step : cd /tmp/ltsmin14236120023059998447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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'
[2023-03-16 09:40:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 406 labels/synchronizations in 34 ms.
[2023-03-16 09:40:05] [INFO ] Time to serialize gal into /tmp/LTLFireability11955555272311814231.gal : 12 ms
[2023-03-16 09:40:05] [INFO ] Time to serialize properties into /tmp/LTLFireability10831693798124677894.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11955555272311814231.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10831693798124677894.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !(((X(!((X("(i8.i0.u34.NotifyEventEndOfCheckSourcesB_1>=1)"))U((("(((i40.u110.mi2>=1)&&(i40.u113.block>=1))&&(i40.u110.QueueJobB_1_55>...338
Formula 0 simplified : X((X"(i8.i0.u34.NotifyEventEndOfCheckSourcesB_1>=1)" U (("(((i40.u110.mi2>=1)&&(i40.u113.block>=1))&&(i40.u110.QueueJobB_1_55>=1))" ...321
Compilation finished in 4002 ms.
Running link step : cd /tmp/ltsmin14236120023059998447;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin14236120023059998447;'/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' '--ltl' '(X(!(X((LTLAPp0==true)) U (((LTLAPp1==true) U (LTLAPp2==true))||<>((LTLAPp1==true)))))||[](<>((LTLAPp3==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.171: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.171: LTL layer: formula: (X(!(X((LTLAPp0==true)) U (((LTLAPp1==true) U (LTLAPp2==true))||<>((LTLAPp1==true)))))||[](<>((LTLAPp3==true))))
pins2lts-mc-linux64( 1/ 8), 0.171: "(X(!(X((LTLAPp0==true)) U (((LTLAPp1==true) U (LTLAPp2==true))||<>((LTLAPp1==true)))))||[](<>((LTLAPp3==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.172: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.175: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.190: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.192: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.196: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.209: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.216: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.221: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.239: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.478: DFS-FIFO for weak LTL, using special progress label 1225
pins2lts-mc-linux64( 0/ 8), 0.478: There are 1226 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.478: State length is 906, there are 1236 groups
pins2lts-mc-linux64( 0/ 8), 0.478: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.478: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.478: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.478: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.588: ~1 levels ~960 states ~5560 transitions
pins2lts-mc-linux64( 5/ 8), 0.651: ~1 levels ~1920 states ~2496 transitions
pins2lts-mc-linux64( 5/ 8), 0.809: ~1 levels ~3840 states ~7568 transitions
pins2lts-mc-linux64( 5/ 8), 1.071: ~1 levels ~7680 states ~22528 transitions
pins2lts-mc-linux64( 5/ 8), 1.520: ~1 levels ~15360 states ~48072 transitions
pins2lts-mc-linux64( 4/ 8), 2.352: ~1 levels ~30720 states ~90504 transitions
pins2lts-mc-linux64( 5/ 8), 3.905: ~1 levels ~61440 states ~186280 transitions
pins2lts-mc-linux64( 4/ 8), 6.974: ~1 levels ~122880 states ~268192 transitions
pins2lts-mc-linux64( 4/ 8), 12.422: ~2 levels ~245760 states ~538104 transitions
pins2lts-mc-linux64( 6/ 8), 23.457: ~1 levels ~491520 states ~1105320 transitions
pins2lts-mc-linux64( 0/ 8), 44.510: ~2 levels ~983040 states ~1948576 transitions
pins2lts-mc-linux64( 0/ 8), 87.883: ~2 levels ~1966080 states ~4640984 transitions
pins2lts-mc-linux64( 4/ 8), 174.226: ~2 levels ~3932160 states ~8779776 transitions
pins2lts-mc-linux64( 4/ 8), 346.577: ~2 levels ~7864320 states ~17377528 transitions
pins2lts-mc-linux64( 0/ 8), 395.690: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 396.223:
pins2lts-mc-linux64( 0/ 8), 396.223: mean standard work distribution: 27.4% (states) 50.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 396.224:
pins2lts-mc-linux64( 0/ 8), 396.224: Explored 6444505 states 59998676 transitions, fanout: 9.310
pins2lts-mc-linux64( 0/ 8), 396.224: Total exploration time 395.700 sec (395.200 sec minimum, 395.286 sec on average)
pins2lts-mc-linux64( 0/ 8), 396.224: States per second: 16286, Transitions per second: 151627
pins2lts-mc-linux64( 0/ 8), 396.224:
pins2lts-mc-linux64( 0/ 8), 396.224: Progress states detected: 22935481
pins2lts-mc-linux64( 0/ 8), 396.224: Redundant explorations: -71.9029
pins2lts-mc-linux64( 0/ 8), 396.224:
pins2lts-mc-linux64( 0/ 8), 396.224: Queue width: 8B, total height: 27245004, memory: 207.86MB
pins2lts-mc-linux64( 0/ 8), 396.224: Tree memory: 431.0MB, 19.7 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 396.224: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 396.224: Stored 1249 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 396.224: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 396.224: Est. total memory use: 638.9MB (~1231.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14236120023059998447;'/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' '--ltl' '(X(!(X((LTLAPp0==true)) U (((LTLAPp1==true) U (LTLAPp2==true))||<>((LTLAPp1==true)))))||[](<>((LTLAPp3==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14236120023059998447;'/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' '--ltl' '(X(!(X((LTLAPp0==true)) U (((LTLAPp1==true) U (LTLAPp2==true))||<>((LTLAPp1==true)))))||[](<>((LTLAPp3==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-16 10:02:39] [INFO ] Flatten gal took : 15626 ms
[2023-03-16 10:02:39] [INFO ] Time to serialize gal into /tmp/LTLFireability3053931218410148979.gal : 48 ms
[2023-03-16 10:02:39] [INFO ] Time to serialize properties into /tmp/LTLFireability7691976957629684326.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3053931218410148979.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7691976957629684326.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !(((X(!((X("(NotifyEventEndOfCheckSourcesB_1>=1)"))U((("(((mi2>=1)&&(block>=1))&&(QueueJobB_1_55>=1))")U("((place_782_1>=1)&&(JobCnt>=...248
Formula 0 simplified : X((X"(NotifyEventEndOfCheckSourcesB_1>=1)" U (("(((mi2>=1)&&(block>=1))&&(QueueJobB_1_55>=1))" U "((place_782_1>=1)&&(JobCnt>=1))") ...231
Detected timeout of ITS tools.
[2023-03-16 10:25:02] [INFO ] Flatten gal took : 807 ms
[2023-03-16 10:25:03] [INFO ] Input system was already deterministic with 1220 transitions.
[2023-03-16 10:25:03] [INFO ] Transformed 905 places.
[2023-03-16 10:25:03] [INFO ] Transformed 1220 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 10:25:33] [INFO ] Time to serialize gal into /tmp/LTLFireability4059541520881421955.gal : 10 ms
[2023-03-16 10:25:33] [INFO ] Time to serialize properties into /tmp/LTLFireability16023350589475639348.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4059541520881421955.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16023350589475639348.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(!((X("(NotifyEventEndOfCheckSourcesB_1>=1)"))U((("(((mi2>=1)&&(block>=1))&&(QueueJobB_1_55>=1))")U("((place_782_1>=1)&&(JobCnt>=...248
Formula 0 simplified : X((X"(NotifyEventEndOfCheckSourcesB_1>=1)" U (("(((mi2>=1)&&(block>=1))&&(QueueJobB_1_55>=1))" U "((place_782_1>=1)&&(JobCnt>=1))") ...231
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 3670140 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15709540 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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="PolyORBNT-PT-S05J60"
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 PolyORBNT-PT-S05J60, 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 r293-tall-167873945800740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J60.tgz
mv PolyORBNT-PT-S05J60 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 ;