Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690600644.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CANConstruction-PT-040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690600644
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 11K Feb 25 21:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 21:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 21:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 21:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 21:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.5M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678367856268

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=CANConstruction-PT-040
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 13:17:37] [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-09 13:17:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 13:17:37] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-03-09 13:17:38] [INFO ] Transformed 3682 places.
[2023-03-09 13:17:38] [INFO ] Transformed 6720 transitions.
[2023-03-09 13:17:38] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CANConstruction-PT-040-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 3682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Discarding 1509 places :
Symmetric choice reduction at 0 with 1509 rule applications. Total rules 1509 place count 2173 transition count 3702
Iterating global reduction 0 with 1509 rules applied. Total rules applied 3018 place count 2173 transition count 3702
Applied a total of 3018 rules in 421 ms. Remains 2173 /3682 variables (removed 1509) and now considering 3702/6720 (removed 3018) transitions.
// Phase 1: matrix 3702 rows 2173 cols
[2023-03-09 13:17:38] [INFO ] Computed 81 place invariants in 83 ms
[2023-03-09 13:17:40] [INFO ] Implicit Places using invariants in 1508 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1749 ms to find 40 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2133/3682 places, 3702/6720 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 2093 transition count 3662
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 2093 transition count 3662
Applied a total of 80 rules in 491 ms. Remains 2093 /2133 variables (removed 40) and now considering 3662/3702 (removed 40) transitions.
// Phase 1: matrix 3662 rows 2093 cols
[2023-03-09 13:17:40] [INFO ] Computed 41 place invariants in 51 ms
[2023-03-09 13:17:42] [INFO ] Implicit Places using invariants in 1170 ms returned []
[2023-03-09 13:17:42] [INFO ] Invariant cache hit.
[2023-03-09 13:17:43] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:18:10] [INFO ] Implicit Places using invariants and state equation in 28596 ms returned []
Implicit Place search using SMT with State Equation took 29773 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2093/3682 places, 3662/6720 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32436 ms. Remains : 2093/3682 places, 3662/6720 transitions.
Support contains 32 out of 2093 places after structural reductions.
[2023-03-09 13:18:11] [INFO ] Flatten gal took : 368 ms
[2023-03-09 13:18:11] [INFO ] Flatten gal took : 213 ms
[2023-03-09 13:18:12] [INFO ] Input system was already deterministic with 3662 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 609 ms. (steps per millisecond=16 ) properties (out of 20) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-09 13:18:12] [INFO ] Invariant cache hit.
[2023-03-09 13:18:13] [INFO ] [Real]Absence check using 41 positive place invariants in 33 ms returned sat
[2023-03-09 13:18:15] [INFO ] After 1725ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-09 13:18:15] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:18:16] [INFO ] After 1530ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 13:18:16] [INFO ] After 3985ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 13:18:17] [INFO ] [Nat]Absence check using 41 positive place invariants in 44 ms returned sat
[2023-03-09 13:18:19] [INFO ] After 1616ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 13:18:20] [INFO ] After 1246ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 13:18:22] [INFO ] After 2913ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 927 ms.
[2023-03-09 13:18:23] [INFO ] After 6154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 5 properties in 32 ms.
Support contains 4 out of 2093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2093/2093 places, 3662/3662 transitions.
Drop transitions removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 270 rules applied. Total rules applied 270 place count 2093 transition count 3392
Reduce places removed 270 places and 0 transitions.
Iterating post reduction 1 with 270 rules applied. Total rules applied 540 place count 1823 transition count 3392
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 540 place count 1823 transition count 3352
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 620 place count 1783 transition count 3352
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 631 place count 1772 transition count 3330
Iterating global reduction 2 with 11 rules applied. Total rules applied 642 place count 1772 transition count 3330
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 651 place count 1772 transition count 3321
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 660 place count 1763 transition count 3321
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 736 place count 1725 transition count 3283
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 738 place count 1725 transition count 3281
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 740 place count 1723 transition count 3281
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 741 place count 1723 transition count 3281
Applied a total of 741 rules in 997 ms. Remains 1723 /2093 variables (removed 370) and now considering 3281/3662 (removed 381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 998 ms. Remains : 1723/2093 places, 3281/3662 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 148325 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148325 steps, saw 41903 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3281 rows 1723 cols
[2023-03-09 13:18:27] [INFO ] Computed 41 place invariants in 52 ms
[2023-03-09 13:18:27] [INFO ] [Real]Absence check using 41 positive place invariants in 34 ms returned sat
[2023-03-09 13:18:28] [INFO ] After 886ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 13:18:28] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:18:28] [INFO ] After 411ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:18:28] [INFO ] After 1589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:18:29] [INFO ] [Nat]Absence check using 41 positive place invariants in 31 ms returned sat
[2023-03-09 13:18:30] [INFO ] After 898ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 13:18:30] [INFO ] After 420ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 13:18:30] [INFO ] After 641ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-09 13:18:30] [INFO ] After 2021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 1723 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1723/1723 places, 3281/3281 transitions.
Applied a total of 0 rules in 152 ms. Remains 1723 /1723 variables (removed 0) and now considering 3281/3281 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 1723/1723 places, 3281/3281 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1723/1723 places, 3281/3281 transitions.
Applied a total of 0 rules in 135 ms. Remains 1723 /1723 variables (removed 0) and now considering 3281/3281 (removed 0) transitions.
[2023-03-09 13:18:31] [INFO ] Invariant cache hit.
[2023-03-09 13:18:32] [INFO ] Implicit Places using invariants in 1084 ms returned []
[2023-03-09 13:18:32] [INFO ] Invariant cache hit.
[2023-03-09 13:18:33] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:18:51] [INFO ] Implicit Places using invariants and state equation in 19511 ms returned []
Implicit Place search using SMT with State Equation took 20602 ms to find 0 implicit places.
[2023-03-09 13:18:51] [INFO ] Redundant transitions in 203 ms returned []
[2023-03-09 13:18:52] [INFO ] Invariant cache hit.
[2023-03-09 13:18:53] [INFO ] Dead Transitions using invariants and state equation in 1385 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22354 ms. Remains : 1723/1723 places, 3281/3281 transitions.
Graph (trivial) has 3158 edges and 1723 vertex of which 1598 / 1723 are part of one of the 39 SCC in 7 ms
Free SCC test removed 1559 places
Drop transitions removed 3079 transitions
Reduce isomorphic transitions removed 3079 transitions.
Graph (complete) has 323 edges and 164 vertex of which 53 are kept as prefixes of interest. Removing 111 places using SCC suffix rule.1 ms
Discarding 111 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 53 transition count 51
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 158 place count 14 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 158 place count 14 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 13 transition count 12
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 12 transition count 11
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 12 transition count 11
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 164 place count 12 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 166 place count 10 transition count 9
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 10 transition count 9
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 9 transition count 8
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 9 transition count 8
Applied a total of 169 rules in 19 ms. Remains 9 /1723 variables (removed 1714) and now considering 8/3281 (removed 3273) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 9 cols
[2023-03-09 13:18:53] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 13:18:53] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 13:18:53] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 13:18:53] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 13:18:53] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Computed a total of 121 stabilizing places and 160 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' '!(G(F(p0)))'
Support contains 3 out of 2093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2093/2093 places, 3662/3662 transitions.
Drop transitions removed 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 271 rules applied. Total rules applied 271 place count 2093 transition count 3391
Reduce places removed 271 places and 0 transitions.
Iterating post reduction 1 with 271 rules applied. Total rules applied 542 place count 1822 transition count 3391
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 542 place count 1822 transition count 3351
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 622 place count 1782 transition count 3351
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 632 place count 1772 transition count 3331
Iterating global reduction 2 with 10 rules applied. Total rules applied 642 place count 1772 transition count 3331
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 650 place count 1772 transition count 3323
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 658 place count 1764 transition count 3323
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 738 place count 1724 transition count 3283
Applied a total of 738 rules in 692 ms. Remains 1724 /2093 variables (removed 369) and now considering 3283/3662 (removed 379) transitions.
// Phase 1: matrix 3283 rows 1724 cols
[2023-03-09 13:18:54] [INFO ] Computed 41 place invariants in 46 ms
[2023-03-09 13:19:02] [INFO ] Implicit Places using invariants in 7787 ms returned []
[2023-03-09 13:19:02] [INFO ] Invariant cache hit.
[2023-03-09 13:19:03] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:19:26] [INFO ] Implicit Places using invariants and state equation in 24009 ms returned []
Implicit Place search using SMT with State Equation took 31801 ms to find 0 implicit places.
[2023-03-09 13:19:26] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-09 13:19:26] [INFO ] Invariant cache hit.
[2023-03-09 13:19:28] [INFO ] Dead Transitions using invariants and state equation in 1990 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1724/2093 places, 3283/3662 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34592 ms. Remains : 1724/2093 places, 3283/3662 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s1585 1) (AND (GEQ s28 1) (GEQ s990 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 245 steps with 0 reset in 16 ms.
FORMULA CANConstruction-PT-040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-01 finished in 34936 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&&F(p1)))))'
Support contains 4 out of 2093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2093/2093 places, 3662/3662 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2082 transition count 3640
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2082 transition count 3640
Applied a total of 22 rules in 288 ms. Remains 2082 /2093 variables (removed 11) and now considering 3640/3662 (removed 22) transitions.
// Phase 1: matrix 3640 rows 2082 cols
[2023-03-09 13:19:29] [INFO ] Computed 41 place invariants in 20 ms
[2023-03-09 13:19:30] [INFO ] Implicit Places using invariants in 1466 ms returned []
[2023-03-09 13:19:30] [INFO ] Invariant cache hit.
[2023-03-09 13:19:31] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:19:55] [INFO ] Implicit Places using invariants and state equation in 25191 ms returned []
Implicit Place search using SMT with State Equation took 26663 ms to find 0 implicit places.
[2023-03-09 13:19:55] [INFO ] Invariant cache hit.
[2023-03-09 13:19:57] [INFO ] Dead Transitions using invariants and state equation in 1813 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2082/2093 places, 3640/3662 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28768 ms. Remains : 2082/2093 places, 3640/3662 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s11 1) (LT s54 1) (LT s90 1) (LT s1855 1)), p1:(OR (LT s11 1) (LT s54 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 162 reset in 720 ms.
Product exploration explored 100000 steps with 164 reset in 786 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 238 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 13:19:59] [INFO ] Invariant cache hit.
[2023-03-09 13:19:59] [INFO ] [Real]Absence check using 41 positive place invariants in 42 ms returned sat
[2023-03-09 13:20:00] [INFO ] After 941ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 13:20:00] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:20:01] [INFO ] After 323ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:20:01] [INFO ] After 1648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:20:01] [INFO ] [Nat]Absence check using 41 positive place invariants in 28 ms returned sat
[2023-03-09 13:20:02] [INFO ] After 970ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 13:20:02] [INFO ] After 449ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 13:20:03] [INFO ] After 665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-03-09 13:20:03] [INFO ] After 2125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 2082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2082/2082 places, 3640/3640 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 2082 transition count 3361
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 1803 transition count 3361
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 558 place count 1803 transition count 3321
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 638 place count 1763 transition count 3321
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 714 place count 1725 transition count 3283
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 716 place count 1725 transition count 3281
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 718 place count 1723 transition count 3281
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 719 place count 1723 transition count 3281
Applied a total of 719 rules in 577 ms. Remains 1723 /2082 variables (removed 359) and now considering 3281/3640 (removed 359) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 577 ms. Remains : 1723/2082 places, 3281/3640 transitions.
Finished random walk after 9523 steps, including 34 resets, run visited all 1 properties in 96 ms. (steps per millisecond=99 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 497 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 4 out of 2082 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2082/2082 places, 3640/3640 transitions.
Applied a total of 0 rules in 100 ms. Remains 2082 /2082 variables (removed 0) and now considering 3640/3640 (removed 0) transitions.
[2023-03-09 13:20:04] [INFO ] Invariant cache hit.
[2023-03-09 13:20:05] [INFO ] Implicit Places using invariants in 982 ms returned []
[2023-03-09 13:20:05] [INFO ] Invariant cache hit.
[2023-03-09 13:20:06] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:20:11] [INFO ] Implicit Places using invariants and state equation in 5549 ms returned []
Implicit Place search using SMT with State Equation took 6533 ms to find 0 implicit places.
[2023-03-09 13:20:11] [INFO ] Invariant cache hit.
[2023-03-09 13:20:12] [INFO ] Dead Transitions using invariants and state equation in 1535 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8171 ms. Remains : 2082/2082 places, 3640/3640 transitions.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p1) p0))), true, (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 13:20:13] [INFO ] Invariant cache hit.
[2023-03-09 13:20:13] [INFO ] [Real]Absence check using 41 positive place invariants in 35 ms returned sat
[2023-03-09 13:20:14] [INFO ] After 945ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 13:20:14] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:20:15] [INFO ] After 284ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:20:15] [INFO ] After 1619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:20:15] [INFO ] [Nat]Absence check using 41 positive place invariants in 35 ms returned sat
[2023-03-09 13:20:16] [INFO ] After 1037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 13:20:17] [INFO ] After 542ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 13:20:17] [INFO ] After 726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-09 13:20:17] [INFO ] After 2218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 2082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2082/2082 places, 3640/3640 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 2082 transition count 3361
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 1803 transition count 3361
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 558 place count 1803 transition count 3321
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 638 place count 1763 transition count 3321
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 714 place count 1725 transition count 3283
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 716 place count 1725 transition count 3281
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 718 place count 1723 transition count 3281
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 719 place count 1723 transition count 3281
Applied a total of 719 rules in 421 ms. Remains 1723 /2082 variables (removed 359) and now considering 3281/3640 (removed 359) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 422 ms. Remains : 1723/2082 places, 3281/3640 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Finished Best-First random walk after 2843 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=947 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p1) p0))), true, (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 378 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 160 reset in 702 ms.
Product exploration explored 100000 steps with 159 reset in 670 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 4 out of 2082 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2082/2082 places, 3640/3640 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 2082 transition count 3640
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 159 place count 2082 transition count 3640
Deduced a syphon composed of 200 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 200 place count 2082 transition count 3640
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 280 place count 2002 transition count 3560
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 360 place count 2002 transition count 3560
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 277 places in 0 ms
Iterating global reduction 1 with 157 rules applied. Total rules applied 517 place count 2002 transition count 3560
Discarding 196 places :
Symmetric choice reduction at 1 with 196 rule applications. Total rules 713 place count 1806 transition count 3364
Deduced a syphon composed of 81 places in 1 ms
Iterating global reduction 1 with 196 rules applied. Total rules applied 909 place count 1806 transition count 3364
Deduced a syphon composed of 81 places in 1 ms
Applied a total of 909 rules in 811 ms. Remains 1806 /2082 variables (removed 276) and now considering 3364/3640 (removed 276) transitions.
[2023-03-09 13:20:21] [INFO ] Redundant transitions in 190 ms returned []
// Phase 1: matrix 3364 rows 1806 cols
[2023-03-09 13:20:21] [INFO ] Computed 41 place invariants in 68 ms
[2023-03-09 13:20:22] [INFO ] Dead Transitions using invariants and state equation in 1525 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1806/2082 places, 3364/3640 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2537 ms. Remains : 1806/2082 places, 3364/3640 transitions.
Built C files in :
/tmp/ltsmin11054338140095831294
[2023-03-09 13:20:22] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11054338140095831294
Running compilation step : cd /tmp/ltsmin11054338140095831294;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11054338140095831294;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11054338140095831294;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2082 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2082/2082 places, 3640/3640 transitions.
Applied a total of 0 rules in 103 ms. Remains 2082 /2082 variables (removed 0) and now considering 3640/3640 (removed 0) transitions.
// Phase 1: matrix 3640 rows 2082 cols
[2023-03-09 13:20:26] [INFO ] Computed 41 place invariants in 43 ms
[2023-03-09 13:20:27] [INFO ] Implicit Places using invariants in 1304 ms returned []
[2023-03-09 13:20:27] [INFO ] Invariant cache hit.
[2023-03-09 13:20:28] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:20:50] [INFO ] Implicit Places using invariants and state equation in 23110 ms returned []
Implicit Place search using SMT with State Equation took 24417 ms to find 0 implicit places.
[2023-03-09 13:20:50] [INFO ] Invariant cache hit.
[2023-03-09 13:20:52] [INFO ] Dead Transitions using invariants and state equation in 1857 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26382 ms. Remains : 2082/2082 places, 3640/3640 transitions.
Built C files in :
/tmp/ltsmin11745021120080778888
[2023-03-09 13:20:52] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11745021120080778888
Running compilation step : cd /tmp/ltsmin11745021120080778888;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11745021120080778888;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11745021120080778888;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 13:20:55] [INFO ] Flatten gal took : 141 ms
[2023-03-09 13:20:55] [INFO ] Flatten gal took : 144 ms
[2023-03-09 13:20:55] [INFO ] Time to serialize gal into /tmp/LTL17205989342918519750.gal : 33 ms
[2023-03-09 13:20:55] [INFO ] Time to serialize properties into /tmp/LTL9335862362446376817.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/LTL17205989342918519750.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16422172091712688232.hoa' '-atoms' '/tmp/LTL9335862362446376817.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...319
Loading property file /tmp/LTL9335862362446376817.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16422172091712688232.hoa
Detected timeout of ITS tools.
[2023-03-09 13:21:11] [INFO ] Flatten gal took : 80 ms
[2023-03-09 13:21:11] [INFO ] Flatten gal took : 86 ms
[2023-03-09 13:21:11] [INFO ] Time to serialize gal into /tmp/LTL1821745218989537216.gal : 28 ms
[2023-03-09 13:21:11] [INFO ] Time to serialize properties into /tmp/LTL13836174384031045527.ltl : 8 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/LTL1821745218989537216.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13836174384031045527.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...276
Read 1 LTL properties
Checking formula 0 : !((X(G((F("((Node0Request<1)||(Node4IsInserted<1))"))&&("(((Node0Request<1)||(Node4IsInserted<1))||((Node7IsInserted<1)||(Node34reques...172
Formula 0 simplified : XF(!"(((Node0Request<1)||(Node4IsInserted<1))||((Node7IsInserted<1)||(Node34requestsent7<1)))" | G!"((Node0Request<1)||(Node4IsInser...164
Detected timeout of ITS tools.
[2023-03-09 13:21:26] [INFO ] Flatten gal took : 118 ms
[2023-03-09 13:21:26] [INFO ] Applying decomposition
[2023-03-09 13:21:26] [INFO ] Flatten gal took : 105 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/graph1290175367820797943.txt' '-o' '/tmp/graph1290175367820797943.bin' '-w' '/tmp/graph1290175367820797943.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1290175367820797943.bin' '-l' '-1' '-v' '-w' '/tmp/graph1290175367820797943.weights' '-q' '0' '-e' '0.001'
[2023-03-09 13:21:26] [INFO ] Decomposing Gal with order
[2023-03-09 13:21:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 13:21:27] [INFO ] Removed a total of 3235 redundant transitions.
[2023-03-09 13:21:28] [INFO ] Flatten gal took : 908 ms
[2023-03-09 13:21:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 6318 labels/synchronizations in 362 ms.
[2023-03-09 13:21:28] [INFO ] Time to serialize gal into /tmp/LTL1266549422351118303.gal : 36 ms
[2023-03-09 13:21:28] [INFO ] Time to serialize properties into /tmp/LTL11937075105079181318.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/LTL1266549422351118303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11937075105079181318.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...255
Read 1 LTL properties
Checking formula 0 : !((X(G((F("((i0.u2.Node0Request<1)||(i4.u17.Node4IsInserted<1))"))&&("(((i0.u2.Node0Request<1)||(i4.u17.Node4IsInserted<1))||((i7.u30....214
Formula 0 simplified : XF(!"(((i0.u2.Node0Request<1)||(i4.u17.Node4IsInserted<1))||((i7.u30.Node7IsInserted<1)||(i34.u148.Node34requestsent7<1)))" | G!"((i...206
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7913614681500045899
[2023-03-09 13:21:43] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7913614681500045899
Running compilation step : cd /tmp/ltsmin7913614681500045899;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7913614681500045899;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7913614681500045899;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANConstruction-PT-040-LTLFireability-02 finished in 138040 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 1 out of 2093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2093/2093 places, 3662/3662 transitions.
Drop transitions removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 270 rules applied. Total rules applied 270 place count 2093 transition count 3392
Reduce places removed 270 places and 0 transitions.
Iterating post reduction 1 with 270 rules applied. Total rules applied 540 place count 1823 transition count 3392
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 540 place count 1823 transition count 3352
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 620 place count 1783 transition count 3352
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 631 place count 1772 transition count 3330
Iterating global reduction 2 with 11 rules applied. Total rules applied 642 place count 1772 transition count 3330
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 650 place count 1772 transition count 3322
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 658 place count 1764 transition count 3322
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 738 place count 1724 transition count 3282
Applied a total of 738 rules in 437 ms. Remains 1724 /2093 variables (removed 369) and now considering 3282/3662 (removed 380) transitions.
// Phase 1: matrix 3282 rows 1724 cols
[2023-03-09 13:21:47] [INFO ] Computed 41 place invariants in 26 ms
[2023-03-09 13:21:48] [INFO ] Implicit Places using invariants in 1124 ms returned []
[2023-03-09 13:21:48] [INFO ] Invariant cache hit.
[2023-03-09 13:21:49] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:22:09] [INFO ] Implicit Places using invariants and state equation in 21265 ms returned []
Implicit Place search using SMT with State Equation took 22392 ms to find 0 implicit places.
[2023-03-09 13:22:09] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-09 13:22:09] [INFO ] Invariant cache hit.
[2023-03-09 13:22:11] [INFO ] Dead Transitions using invariants and state equation in 1508 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1724/2093 places, 3282/3662 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24413 ms. Remains : 1724/2093 places, 3282/3662 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s123 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 265 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-040-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-05 finished in 24477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 3 out of 2093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2093/2093 places, 3662/3662 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2083 transition count 3642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2083 transition count 3642
Applied a total of 20 rules in 216 ms. Remains 2083 /2093 variables (removed 10) and now considering 3642/3662 (removed 20) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2023-03-09 13:22:11] [INFO ] Computed 41 place invariants in 27 ms
[2023-03-09 13:22:12] [INFO ] Implicit Places using invariants in 1028 ms returned []
[2023-03-09 13:22:12] [INFO ] Invariant cache hit.
[2023-03-09 13:22:13] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:22:35] [INFO ] Implicit Places using invariants and state equation in 22783 ms returned []
Implicit Place search using SMT with State Equation took 23820 ms to find 0 implicit places.
[2023-03-09 13:22:35] [INFO ] Invariant cache hit.
[2023-03-09 13:22:37] [INFO ] Dead Transitions using invariants and state equation in 2134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2093 places, 3642/3662 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26172 ms. Remains : 2083/2093 places, 3642/3662 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LT s2034 1), p0:(OR (LT s47 1) (LT s366 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1643 ms.
Product exploration explored 100000 steps with 50000 reset in 1618 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-040-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-040-LTLFireability-07 finished in 29758 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(X(F(G(X(G(X((X(p0) U p1)))))))))'
Support contains 2 out of 2093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2093/2093 places, 3662/3662 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2084 transition count 3644
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2084 transition count 3644
Applied a total of 18 rules in 178 ms. Remains 2084 /2093 variables (removed 9) and now considering 3644/3662 (removed 18) transitions.
// Phase 1: matrix 3644 rows 2084 cols
[2023-03-09 13:22:41] [INFO ] Computed 41 place invariants in 34 ms
[2023-03-09 13:22:42] [INFO ] Implicit Places using invariants in 1146 ms returned []
[2023-03-09 13:22:42] [INFO ] Invariant cache hit.
[2023-03-09 13:22:43] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:23:04] [INFO ] Implicit Places using invariants and state equation in 21929 ms returned []
Implicit Place search using SMT with State Equation took 23077 ms to find 0 implicit places.
[2023-03-09 13:23:04] [INFO ] Invariant cache hit.
[2023-03-09 13:23:05] [INFO ] Dead Transitions using invariants and state equation in 1508 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2084/2093 places, 3644/3662 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24767 ms. Remains : 2084/2093 places, 3644/3662 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s1491 1), p0:(GEQ s1692 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 814 steps with 0 reset in 6 ms.
FORMULA CANConstruction-PT-040-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-09 finished in 24883 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))&&F(p1)))'
Support contains 5 out of 2093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2093/2093 places, 3662/3662 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2083 transition count 3642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2083 transition count 3642
Applied a total of 20 rules in 176 ms. Remains 2083 /2093 variables (removed 10) and now considering 3642/3662 (removed 20) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2023-03-09 13:23:06] [INFO ] Computed 41 place invariants in 36 ms
[2023-03-09 13:23:07] [INFO ] Implicit Places using invariants in 1094 ms returned []
[2023-03-09 13:23:07] [INFO ] Invariant cache hit.
[2023-03-09 13:23:08] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:23:32] [INFO ] Implicit Places using invariants and state equation in 25557 ms returned []
Implicit Place search using SMT with State Equation took 26653 ms to find 0 implicit places.
[2023-03-09 13:23:32] [INFO ] Invariant cache hit.
[2023-03-09 13:23:34] [INFO ] Dead Transitions using invariants and state equation in 1528 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2093 places, 3642/3662 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28360 ms. Remains : 2083/2093 places, 3642/3662 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s246 1) (GEQ s1830 1)), p1:(OR (AND (GEQ s90 1) (GEQ s143 1)) (GEQ s1242 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-040-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-10 finished in 28500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2093/2093 places, 3662/3662 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2083 transition count 3642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2083 transition count 3642
Applied a total of 20 rules in 190 ms. Remains 2083 /2093 variables (removed 10) and now considering 3642/3662 (removed 20) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2023-03-09 13:23:34] [INFO ] Computed 41 place invariants in 42 ms
[2023-03-09 13:23:35] [INFO ] Implicit Places using invariants in 1072 ms returned []
[2023-03-09 13:23:35] [INFO ] Invariant cache hit.
[2023-03-09 13:23:36] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:24:00] [INFO ] Implicit Places using invariants and state equation in 24745 ms returned []
Implicit Place search using SMT with State Equation took 25825 ms to find 0 implicit places.
[2023-03-09 13:24:00] [INFO ] Invariant cache hit.
[2023-03-09 13:24:02] [INFO ] Dead Transitions using invariants and state equation in 1671 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2093 places, 3642/3662 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27688 ms. Remains : 2083/2093 places, 3642/3662 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s777 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 3381 steps with 4 reset in 24 ms.
FORMULA CANConstruction-PT-040-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-11 finished in 27820 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 1 out of 2093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2093/2093 places, 3662/3662 transitions.
Drop transitions removed 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 271 rules applied. Total rules applied 271 place count 2093 transition count 3391
Reduce places removed 271 places and 0 transitions.
Iterating post reduction 1 with 271 rules applied. Total rules applied 542 place count 1822 transition count 3391
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 542 place count 1822 transition count 3351
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 622 place count 1782 transition count 3351
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 632 place count 1772 transition count 3331
Iterating global reduction 2 with 10 rules applied. Total rules applied 642 place count 1772 transition count 3331
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 650 place count 1772 transition count 3323
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 658 place count 1764 transition count 3323
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 740 place count 1723 transition count 3282
Applied a total of 740 rules in 411 ms. Remains 1723 /2093 variables (removed 370) and now considering 3282/3662 (removed 380) transitions.
// Phase 1: matrix 3282 rows 1723 cols
[2023-03-09 13:24:02] [INFO ] Computed 41 place invariants in 39 ms
[2023-03-09 13:24:03] [INFO ] Implicit Places using invariants in 1388 ms returned []
[2023-03-09 13:24:03] [INFO ] Invariant cache hit.
[2023-03-09 13:24:04] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:24:25] [INFO ] Implicit Places using invariants and state equation in 21153 ms returned []
Implicit Place search using SMT with State Equation took 22555 ms to find 0 implicit places.
[2023-03-09 13:24:25] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-09 13:24:25] [INFO ] Invariant cache hit.
[2023-03-09 13:24:26] [INFO ] Dead Transitions using invariants and state equation in 1414 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1723/2093 places, 3282/3662 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24461 ms. Remains : 1723/2093 places, 3282/3662 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1098 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 295 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-040-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-12 finished in 24520 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||((p1||(F(p2) U X(p3))) U G(p4)))))'
Support contains 8 out of 2093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2093/2093 places, 3662/3662 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2083 transition count 3642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2083 transition count 3642
Applied a total of 20 rules in 238 ms. Remains 2083 /2093 variables (removed 10) and now considering 3642/3662 (removed 20) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2023-03-09 13:24:27] [INFO ] Computed 41 place invariants in 40 ms
[2023-03-09 13:24:28] [INFO ] Implicit Places using invariants in 1328 ms returned []
[2023-03-09 13:24:28] [INFO ] Invariant cache hit.
[2023-03-09 13:24:29] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:24:51] [INFO ] Implicit Places using invariants and state equation in 23677 ms returned []
Implicit Place search using SMT with State Equation took 25009 ms to find 0 implicit places.
[2023-03-09 13:24:51] [INFO ] Invariant cache hit.
[2023-03-09 13:24:53] [INFO ] Dead Transitions using invariants and state equation in 1749 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2093 places, 3642/3662 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26997 ms. Remains : 2083/2093 places, 3642/3662 transitions.
Stuttering acceptance computed with spot in 417 ms :[(AND (NOT p0) (NOT p4)), (NOT p4), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p4) (NOT p3)), (AND p1 (NOT p3) (NOT p4)), (NOT p2), (AND (NOT p2) (NOT p4))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p4) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p4) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p4 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p4 (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=p4, acceptance={} source=1 dest: 1}, { cond=(NOT p4), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p4) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p4) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p4 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p4 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p4) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND p4 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p4) p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p4) p1 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND p4 p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p4 p1 (NOT p3)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p4) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p4 (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s205 1), p4:(AND (GEQ s18 1) (GEQ s239 1)), p1:(AND (GEQ s42 1) (GEQ s915 1)), p2:(OR (GEQ s205 1) (GEQ s1609 1)), p3:(AND (GEQ s335 1) (GEQ s450 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 598 steps with 0 reset in 7 ms.
FORMULA CANConstruction-PT-040-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-13 finished in 27486 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 1 out of 2093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2093/2093 places, 3662/3662 transitions.
Drop transitions removed 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 271 rules applied. Total rules applied 271 place count 2093 transition count 3391
Reduce places removed 271 places and 0 transitions.
Iterating post reduction 1 with 271 rules applied. Total rules applied 542 place count 1822 transition count 3391
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 542 place count 1822 transition count 3351
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 622 place count 1782 transition count 3351
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 632 place count 1772 transition count 3331
Iterating global reduction 2 with 10 rules applied. Total rules applied 642 place count 1772 transition count 3331
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 650 place count 1772 transition count 3323
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 658 place count 1764 transition count 3323
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 740 place count 1723 transition count 3282
Applied a total of 740 rules in 463 ms. Remains 1723 /2093 variables (removed 370) and now considering 3282/3662 (removed 380) transitions.
// Phase 1: matrix 3282 rows 1723 cols
[2023-03-09 13:24:54] [INFO ] Computed 41 place invariants in 39 ms
[2023-03-09 13:24:55] [INFO ] Implicit Places using invariants in 1254 ms returned []
[2023-03-09 13:24:55] [INFO ] Invariant cache hit.
[2023-03-09 13:24:57] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:25:25] [INFO ] Implicit Places using invariants and state equation in 29547 ms returned []
Implicit Place search using SMT with State Equation took 30803 ms to find 0 implicit places.
[2023-03-09 13:25:25] [INFO ] Redundant transitions in 98 ms returned []
[2023-03-09 13:25:25] [INFO ] Invariant cache hit.
[2023-03-09 13:25:26] [INFO ] Dead Transitions using invariants and state equation in 1384 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1723/2093 places, 3282/3662 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32761 ms. Remains : 1723/2093 places, 3282/3662 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s230 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 449 steps with 1 reset in 4 ms.
FORMULA CANConstruction-PT-040-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-14 finished in 32819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 2093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2093/2093 places, 3662/3662 transitions.
Drop transitions removed 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 271 rules applied. Total rules applied 271 place count 2093 transition count 3391
Reduce places removed 271 places and 0 transitions.
Iterating post reduction 1 with 271 rules applied. Total rules applied 542 place count 1822 transition count 3391
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 542 place count 1822 transition count 3351
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 622 place count 1782 transition count 3351
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 631 place count 1773 transition count 3333
Iterating global reduction 2 with 9 rules applied. Total rules applied 640 place count 1773 transition count 3333
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 7 rules applied. Total rules applied 647 place count 1773 transition count 3326
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 654 place count 1766 transition count 3326
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 736 place count 1725 transition count 3285
Applied a total of 736 rules in 358 ms. Remains 1725 /2093 variables (removed 368) and now considering 3285/3662 (removed 377) transitions.
// Phase 1: matrix 3285 rows 1725 cols
[2023-03-09 13:25:27] [INFO ] Computed 41 place invariants in 46 ms
[2023-03-09 13:25:28] [INFO ] Implicit Places using invariants in 1106 ms returned []
[2023-03-09 13:25:28] [INFO ] Invariant cache hit.
[2023-03-09 13:25:29] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:25:52] [INFO ] Implicit Places using invariants and state equation in 23743 ms returned []
Implicit Place search using SMT with State Equation took 24853 ms to find 0 implicit places.
[2023-03-09 13:25:52] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-09 13:25:52] [INFO ] Invariant cache hit.
[2023-03-09 13:25:53] [INFO ] Dead Transitions using invariants and state equation in 1473 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1725/2093 places, 3285/3662 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26764 ms. Remains : 1725/2093 places, 3285/3662 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s1661 1) (OR (LT s43 1) (LT s147 1))), p0:(GEQ s974 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 361 reset in 806 ms.
Stack based approach found an accepted trace after 20963 steps with 76 reset with depth 195 and stack size 195 in 168 ms.
FORMULA CANConstruction-PT-040-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-15 finished in 27833 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&&F(p1)))))'
Found a Lengthening insensitive property : CANConstruction-PT-040-LTLFireability-02
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 4 out of 2093 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2093/2093 places, 3662/3662 transitions.
Drop transitions removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 270 rules applied. Total rules applied 270 place count 2093 transition count 3392
Reduce places removed 270 places and 0 transitions.
Iterating post reduction 1 with 270 rules applied. Total rules applied 540 place count 1823 transition count 3392
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 540 place count 1823 transition count 3352
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 620 place count 1783 transition count 3352
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 631 place count 1772 transition count 3330
Iterating global reduction 2 with 11 rules applied. Total rules applied 642 place count 1772 transition count 3330
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 651 place count 1772 transition count 3321
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 660 place count 1763 transition count 3321
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 736 place count 1725 transition count 3283
Applied a total of 736 rules in 366 ms. Remains 1725 /2093 variables (removed 368) and now considering 3283/3662 (removed 379) transitions.
// Phase 1: matrix 3283 rows 1725 cols
[2023-03-09 13:25:55] [INFO ] Computed 41 place invariants in 35 ms
[2023-03-09 13:25:56] [INFO ] Implicit Places using invariants in 1095 ms returned []
[2023-03-09 13:25:56] [INFO ] Invariant cache hit.
[2023-03-09 13:25:57] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 13:26:21] [INFO ] Implicit Places using invariants and state equation in 24487 ms returned []
Implicit Place search using SMT with State Equation took 25588 ms to find 0 implicit places.
[2023-03-09 13:26:21] [INFO ] Invariant cache hit.
[2023-03-09 13:26:22] [INFO ] Dead Transitions using invariants and state equation in 1466 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1725/2093 places, 3283/3662 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 27422 ms. Remains : 1725/2093 places, 3283/3662 transitions.
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s17 1) (LT s27 1) (LT s1498 1)), p1:(OR (LT s5 1) (LT s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 387 reset in 740 ms.
Stack based approach found an accepted trace after 86725 steps with 340 reset with depth 49 and stack size 49 in 659 ms.
Treatment of property CANConstruction-PT-040-LTLFireability-02 finished in 29164 ms.
FORMULA CANConstruction-PT-040-LTLFireability-02 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-09 13:26:24] [INFO ] Flatten gal took : 66 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 526319 ms.

BK_STOP 1678368384371

--------------------
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="CANConstruction-PT-040"
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 CANConstruction-PT-040, 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 r037-tajo-167813690600644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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