Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460800257.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBNT-COL-S10J30, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460800257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.9K Apr 12 11:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 11:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 11:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 13:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 13:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717128669197

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J30
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-31 04:11:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 04:11:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 04:11:10] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 04:11:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 04:11:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 478 ms
[2024-05-31 04:11:11] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 04:11:11] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 8 ms.
[2024-05-31 04:11:11] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10008 steps, including 570 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 33) seen :3
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :17
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 13) seen :4
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 38 rows 48 cols
[2024-05-31 04:11:11] [INFO ] Computed 13 invariants in 5 ms
[2024-05-31 04:11:12] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 04:11:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 04:11:12] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2024-05-31 04:11:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:11:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:11:12] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2024-05-31 04:11:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:11:12] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :5 sat :1
[2024-05-31 04:11:12] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 4 ms to minimize.
[2024-05-31 04:11:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-31 04:11:12] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-31 04:11:12] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 47 transition count 35
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 44 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 9 place count 43 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 41 transition count 32
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 39 transition count 30
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 39 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 39 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 36 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 35 transition count 29
Applied a total of 25 rules in 22 ms. Remains 35 /48 variables (removed 13) and now considering 29/38 (removed 9) transitions.
// Phase 1: matrix 29 rows 35 cols
[2024-05-31 04:11:12] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 04:11:12] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 35/48 places, 29/38 transitions.
Incomplete random walk after 10000 steps, including 737 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Probably explored full state space saw : 595 states, properties seen :0
Probabilistic random walk after 1641 steps, saw 595 distinct states, run finished after 19 ms. (steps per millisecond=86 ) properties seen :0
Explored full state space saw : 595 states, properties seen :0
Exhaustive walk after 1641 steps, saw 595 distinct states, run finished after 3 ms. (steps per millisecond=547 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 04:11:12] [INFO ] Flatten gal took : 30 ms
[2024-05-31 04:11:12] [INFO ] Flatten gal took : 6 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-31 04:11:12] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 237 ms.
[2024-05-31 04:11:12] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Deduced a syphon composed of 30 places in 22 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 469 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 81 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
[2024-05-31 04:11:12] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-05-31 04:11:12] [INFO ] Computed 82 invariants in 110 ms
[2024-05-31 04:11:13] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2024-05-31 04:11:13] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2024-05-31 04:11:13] [INFO ] Computed 82 invariants in 49 ms
[2024-05-31 04:11:14] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-31 04:11:14] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:11:14] [INFO ] Invariant cache hit.
[2024-05-31 04:11:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:11:16] [INFO ] Implicit Places using invariants and state equation in 2660 ms returned []
Implicit Place search using SMT with State Equation took 3012 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1940 transitions.
Applied a total of 0 rules in 8 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4111 ms. Remains : 653/664 places, 1324/1940 transitions.
Support contains 469 out of 653 places after structural reductions.
[2024-05-31 04:11:17] [INFO ] Flatten gal took : 141 ms
[2024-05-31 04:11:17] [INFO ] Flatten gal took : 111 ms
[2024-05-31 04:11:17] [INFO ] Input system was already deterministic with 1324 transitions.
Support contains 468 out of 653 places (down from 469) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 28) seen :2
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 147720 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{0=1, 2=1, 5=1, 10=1, 11=1, 13=1, 18=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1}
Probabilistic random walk after 147720 steps, saw 42846 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :13
Running SMT prover for 13 properties.
[2024-05-31 04:11:21] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:11:21] [INFO ] Invariant cache hit.
[2024-05-31 04:11:21] [INFO ] [Real]Absence check using 76 positive place invariants in 20 ms returned sat
[2024-05-31 04:11:21] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 10 ms returned sat
[2024-05-31 04:11:21] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:10
[2024-05-31 04:11:21] [INFO ] [Nat]Absence check using 76 positive place invariants in 20 ms returned sat
[2024-05-31 04:11:21] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 11 ms returned sat
[2024-05-31 04:11:26] [INFO ] After 4154ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :9
[2024-05-31 04:11:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:11:32] [INFO ] After 5895ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :4 sat :9
[2024-05-31 04:11:36] [INFO ] Deduced a trap composed of 292 places in 389 ms of which 1 ms to minimize.
[2024-05-31 04:11:36] [INFO ] Deduced a trap composed of 306 places in 345 ms of which 2 ms to minimize.
[2024-05-31 04:11:37] [INFO ] Deduced a trap composed of 302 places in 347 ms of which 0 ms to minimize.
[2024-05-31 04:11:37] [INFO ] Deduced a trap composed of 310 places in 373 ms of which 1 ms to minimize.
[2024-05-31 04:11:38] [INFO ] Deduced a trap composed of 302 places in 320 ms of which 0 ms to minimize.
[2024-05-31 04:11:38] [INFO ] Deduced a trap composed of 300 places in 337 ms of which 1 ms to minimize.
[2024-05-31 04:11:38] [INFO ] Deduced a trap composed of 306 places in 330 ms of which 0 ms to minimize.
[2024-05-31 04:11:39] [INFO ] Deduced a trap composed of 310 places in 470 ms of which 1 ms to minimize.
[2024-05-31 04:11:40] [INFO ] Deduced a trap composed of 302 places in 396 ms of which 1 ms to minimize.
[2024-05-31 04:11:41] [INFO ] Deduced a trap composed of 305 places in 361 ms of which 1 ms to minimize.
[2024-05-31 04:11:42] [INFO ] Deduced a trap composed of 302 places in 385 ms of which 1 ms to minimize.
[2024-05-31 04:11:42] [INFO ] Deduced a trap composed of 306 places in 430 ms of which 2 ms to minimize.
[2024-05-31 04:11:43] [INFO ] Deduced a trap composed of 308 places in 431 ms of which 0 ms to minimize.
[2024-05-31 04:11:43] [INFO ] Deduced a trap composed of 308 places in 427 ms of which 1 ms to minimize.
[2024-05-31 04:11:44] [INFO ] Deduced a trap composed of 304 places in 395 ms of which 1 ms to minimize.
[2024-05-31 04:11:44] [INFO ] Deduced a trap composed of 304 places in 399 ms of which 0 ms to minimize.
[2024-05-31 04:11:45] [INFO ] Deduced a trap composed of 302 places in 409 ms of which 1 ms to minimize.
[2024-05-31 04:11:45] [INFO ] Deduced a trap composed of 302 places in 427 ms of which 1 ms to minimize.
[2024-05-31 04:11:46] [INFO ] Deduced a trap composed of 306 places in 404 ms of which 0 ms to minimize.
[2024-05-31 04:11:46] [INFO ] Deduced a trap composed of 306 places in 415 ms of which 1 ms to minimize.
[2024-05-31 04:11:47] [INFO ] Deduced a trap composed of 306 places in 370 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 04:11:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 04:11:47] [INFO ] After 25380ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:10
Fused 13 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 361 out of 653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 653 transition count 1290
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 619 transition count 1290
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 68 place count 619 transition count 1256
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 136 place count 585 transition count 1256
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 583 transition count 1254
Applied a total of 140 rules in 124 ms. Remains 583 /653 variables (removed 70) and now considering 1254/1324 (removed 70) transitions.
[2024-05-31 04:11:47] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2024-05-31 04:11:47] [INFO ] Computed 82 invariants in 27 ms
[2024-05-31 04:11:47] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 764 ms. Remains : 583/653 places, 1254/1324 transitions.
Incomplete random walk after 10000 steps, including 713 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 04:11:47] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2024-05-31 04:11:47] [INFO ] Invariant cache hit.
[2024-05-31 04:11:48] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:11:48] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2024-05-31 04:11:48] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 26 ms returned sat
[2024-05-31 04:11:49] [INFO ] After 1724ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 04:11:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:11:50] [INFO ] After 151ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 04:11:50] [INFO ] Deduced a trap composed of 105 places in 338 ms of which 1 ms to minimize.
[2024-05-31 04:11:50] [INFO ] Deduced a trap composed of 118 places in 354 ms of which 0 ms to minimize.
[2024-05-31 04:11:51] [INFO ] Deduced a trap composed of 135 places in 340 ms of which 1 ms to minimize.
[2024-05-31 04:11:51] [INFO ] Deduced a trap composed of 118 places in 292 ms of which 1 ms to minimize.
[2024-05-31 04:11:52] [INFO ] Deduced a trap composed of 100 places in 356 ms of which 0 ms to minimize.
[2024-05-31 04:11:52] [INFO ] Deduced a trap composed of 106 places in 361 ms of which 0 ms to minimize.
[2024-05-31 04:11:52] [INFO ] Deduced a trap composed of 106 places in 341 ms of which 1 ms to minimize.
[2024-05-31 04:11:53] [INFO ] Deduced a trap composed of 106 places in 339 ms of which 1 ms to minimize.
[2024-05-31 04:11:53] [INFO ] Deduced a trap composed of 106 places in 286 ms of which 0 ms to minimize.
[2024-05-31 04:11:53] [INFO ] Deduced a trap composed of 118 places in 347 ms of which 1 ms to minimize.
[2024-05-31 04:11:54] [INFO ] Deduced a trap composed of 100 places in 314 ms of which 2 ms to minimize.
[2024-05-31 04:11:54] [INFO ] Deduced a trap composed of 100 places in 356 ms of which 1 ms to minimize.
[2024-05-31 04:11:55] [INFO ] Deduced a trap composed of 100 places in 383 ms of which 1 ms to minimize.
[2024-05-31 04:11:55] [INFO ] Deduced a trap composed of 106 places in 321 ms of which 0 ms to minimize.
[2024-05-31 04:11:56] [INFO ] Deduced a trap composed of 100 places in 336 ms of which 1 ms to minimize.
[2024-05-31 04:11:56] [INFO ] Deduced a trap composed of 106 places in 370 ms of which 0 ms to minimize.
[2024-05-31 04:11:56] [INFO ] Deduced a trap composed of 106 places in 387 ms of which 1 ms to minimize.
[2024-05-31 04:11:57] [INFO ] Deduced a trap composed of 112 places in 394 ms of which 1 ms to minimize.
[2024-05-31 04:11:57] [INFO ] Deduced a trap composed of 112 places in 394 ms of which 1 ms to minimize.
[2024-05-31 04:11:58] [INFO ] Deduced a trap composed of 114 places in 380 ms of which 1 ms to minimize.
[2024-05-31 04:11:58] [INFO ] Deduced a trap composed of 138 places in 385 ms of which 1 ms to minimize.
[2024-05-31 04:11:59] [INFO ] Deduced a trap composed of 111 places in 339 ms of which 0 ms to minimize.
[2024-05-31 04:11:59] [INFO ] Deduced a trap composed of 108 places in 348 ms of which 1 ms to minimize.
[2024-05-31 04:12:00] [INFO ] Deduced a trap composed of 114 places in 347 ms of which 1 ms to minimize.
[2024-05-31 04:12:00] [INFO ] Deduced a trap composed of 120 places in 396 ms of which 1 ms to minimize.
[2024-05-31 04:12:01] [INFO ] Deduced a trap composed of 120 places in 408 ms of which 1 ms to minimize.
[2024-05-31 04:12:01] [INFO ] Deduced a trap composed of 105 places in 421 ms of which 1 ms to minimize.
[2024-05-31 04:12:01] [INFO ] Deduced a trap composed of 114 places in 371 ms of which 1 ms to minimize.
[2024-05-31 04:12:02] [INFO ] Deduced a trap composed of 114 places in 414 ms of which 1 ms to minimize.
[2024-05-31 04:12:02] [INFO ] Deduced a trap composed of 105 places in 421 ms of which 2 ms to minimize.
[2024-05-31 04:12:03] [INFO ] Deduced a trap composed of 111 places in 420 ms of which 1 ms to minimize.
[2024-05-31 04:12:03] [INFO ] Deduced a trap composed of 120 places in 365 ms of which 0 ms to minimize.
[2024-05-31 04:12:04] [INFO ] Deduced a trap composed of 99 places in 369 ms of which 1 ms to minimize.
[2024-05-31 04:12:04] [INFO ] Deduced a trap composed of 108 places in 405 ms of which 1 ms to minimize.
[2024-05-31 04:12:05] [INFO ] Deduced a trap composed of 120 places in 389 ms of which 0 ms to minimize.
[2024-05-31 04:12:05] [INFO ] Deduced a trap composed of 99 places in 393 ms of which 1 ms to minimize.
[2024-05-31 04:12:06] [INFO ] Deduced a trap composed of 99 places in 409 ms of which 1 ms to minimize.
[2024-05-31 04:12:06] [INFO ] Deduced a trap composed of 111 places in 348 ms of which 0 ms to minimize.
[2024-05-31 04:12:07] [INFO ] Deduced a trap composed of 105 places in 399 ms of which 1 ms to minimize.
[2024-05-31 04:12:08] [INFO ] Deduced a trap composed of 99 places in 387 ms of which 1 ms to minimize.
[2024-05-31 04:12:08] [INFO ] Deduced a trap composed of 105 places in 391 ms of which 0 ms to minimize.
[2024-05-31 04:12:09] [INFO ] Deduced a trap composed of 105 places in 388 ms of which 0 ms to minimize.
[2024-05-31 04:12:09] [INFO ] Deduced a trap composed of 105 places in 411 ms of which 3 ms to minimize.
[2024-05-31 04:12:10] [INFO ] Deduced a trap composed of 111 places in 405 ms of which 0 ms to minimize.
[2024-05-31 04:12:10] [INFO ] Deduced a trap composed of 105 places in 374 ms of which 5 ms to minimize.
[2024-05-31 04:12:10] [INFO ] Deduced a trap composed of 105 places in 372 ms of which 1 ms to minimize.
[2024-05-31 04:12:11] [INFO ] Deduced a trap composed of 99 places in 355 ms of which 1 ms to minimize.
[2024-05-31 04:12:13] [INFO ] Deduced a trap composed of 123 places in 420 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 04:12:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 04:12:13] [INFO ] After 25438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 583 transition count 1253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 582 transition count 1253
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 581 transition count 1252
Applied a total of 4 rules in 105 ms. Remains 581 /583 variables (removed 2) and now considering 1252/1254 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 581/583 places, 1252/1254 transitions.
Incomplete random walk after 10000 steps, including 695 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 511757 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 511757 steps, saw 82852 distinct states, run finished after 3002 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 04:12:16] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2024-05-31 04:12:16] [INFO ] Computed 82 invariants in 47 ms
[2024-05-31 04:12:16] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:12:16] [INFO ] [Nat]Absence check using 75 positive place invariants in 20 ms returned sat
[2024-05-31 04:12:16] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-31 04:12:17] [INFO ] After 562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 04:12:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:12:17] [INFO ] After 118ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 04:12:18] [INFO ] Deduced a trap composed of 104 places in 320 ms of which 0 ms to minimize.
[2024-05-31 04:12:18] [INFO ] Deduced a trap composed of 109 places in 375 ms of which 1 ms to minimize.
[2024-05-31 04:12:19] [INFO ] Deduced a trap composed of 126 places in 372 ms of which 0 ms to minimize.
[2024-05-31 04:12:19] [INFO ] Deduced a trap composed of 118 places in 386 ms of which 1 ms to minimize.
[2024-05-31 04:12:19] [INFO ] Deduced a trap composed of 118 places in 337 ms of which 0 ms to minimize.
[2024-05-31 04:12:20] [INFO ] Deduced a trap composed of 109 places in 334 ms of which 0 ms to minimize.
[2024-05-31 04:12:20] [INFO ] Deduced a trap composed of 109 places in 371 ms of which 1 ms to minimize.
[2024-05-31 04:12:21] [INFO ] Deduced a trap composed of 118 places in 355 ms of which 1 ms to minimize.
[2024-05-31 04:12:21] [INFO ] Deduced a trap composed of 118 places in 310 ms of which 1 ms to minimize.
[2024-05-31 04:12:21] [INFO ] Deduced a trap composed of 110 places in 288 ms of which 0 ms to minimize.
[2024-05-31 04:12:22] [INFO ] Deduced a trap composed of 126 places in 299 ms of which 1 ms to minimize.
[2024-05-31 04:12:22] [INFO ] Deduced a trap composed of 109 places in 297 ms of which 0 ms to minimize.
[2024-05-31 04:12:22] [INFO ] Deduced a trap composed of 101 places in 366 ms of which 0 ms to minimize.
[2024-05-31 04:12:23] [INFO ] Deduced a trap composed of 109 places in 288 ms of which 1 ms to minimize.
[2024-05-31 04:12:23] [INFO ] Deduced a trap composed of 133 places in 309 ms of which 0 ms to minimize.
[2024-05-31 04:12:24] [INFO ] Deduced a trap composed of 126 places in 295 ms of which 1 ms to minimize.
[2024-05-31 04:12:24] [INFO ] Deduced a trap composed of 110 places in 314 ms of which 1 ms to minimize.
[2024-05-31 04:12:24] [INFO ] Deduced a trap composed of 109 places in 357 ms of which 1 ms to minimize.
[2024-05-31 04:12:25] [INFO ] Deduced a trap composed of 109 places in 406 ms of which 1 ms to minimize.
[2024-05-31 04:12:25] [INFO ] Deduced a trap composed of 109 places in 412 ms of which 1 ms to minimize.
[2024-05-31 04:12:26] [INFO ] Deduced a trap composed of 109 places in 412 ms of which 1 ms to minimize.
[2024-05-31 04:12:26] [INFO ] Deduced a trap composed of 126 places in 414 ms of which 1 ms to minimize.
[2024-05-31 04:12:27] [INFO ] Deduced a trap composed of 109 places in 397 ms of which 1 ms to minimize.
[2024-05-31 04:12:27] [INFO ] Deduced a trap composed of 125 places in 416 ms of which 1 ms to minimize.
[2024-05-31 04:12:28] [INFO ] Deduced a trap composed of 126 places in 412 ms of which 1 ms to minimize.
[2024-05-31 04:12:28] [INFO ] Deduced a trap composed of 117 places in 393 ms of which 1 ms to minimize.
[2024-05-31 04:12:29] [INFO ] Deduced a trap composed of 101 places in 397 ms of which 0 ms to minimize.
[2024-05-31 04:12:29] [INFO ] Deduced a trap composed of 125 places in 379 ms of which 1 ms to minimize.
[2024-05-31 04:12:29] [INFO ] Deduced a trap composed of 134 places in 373 ms of which 1 ms to minimize.
[2024-05-31 04:12:30] [INFO ] Deduced a trap composed of 101 places in 359 ms of which 1 ms to minimize.
[2024-05-31 04:12:30] [INFO ] Deduced a trap composed of 125 places in 361 ms of which 0 ms to minimize.
[2024-05-31 04:12:31] [INFO ] Deduced a trap composed of 109 places in 422 ms of which 1 ms to minimize.
[2024-05-31 04:12:31] [INFO ] Deduced a trap composed of 109 places in 400 ms of which 1 ms to minimize.
[2024-05-31 04:12:32] [INFO ] Deduced a trap composed of 118 places in 370 ms of which 1 ms to minimize.
[2024-05-31 04:12:32] [INFO ] Deduced a trap composed of 125 places in 411 ms of which 0 ms to minimize.
[2024-05-31 04:12:33] [INFO ] Deduced a trap composed of 117 places in 427 ms of which 0 ms to minimize.
[2024-05-31 04:12:33] [INFO ] Deduced a trap composed of 118 places in 373 ms of which 0 ms to minimize.
[2024-05-31 04:12:34] [INFO ] Deduced a trap composed of 118 places in 366 ms of which 1 ms to minimize.
[2024-05-31 04:12:34] [INFO ] Deduced a trap composed of 118 places in 356 ms of which 0 ms to minimize.
[2024-05-31 04:12:34] [INFO ] Deduced a trap composed of 118 places in 358 ms of which 1 ms to minimize.
[2024-05-31 04:12:35] [INFO ] Deduced a trap composed of 125 places in 385 ms of which 1 ms to minimize.
[2024-05-31 04:12:35] [INFO ] Deduced a trap composed of 110 places in 374 ms of which 1 ms to minimize.
[2024-05-31 04:12:36] [INFO ] Deduced a trap composed of 125 places in 405 ms of which 1 ms to minimize.
[2024-05-31 04:12:36] [INFO ] Deduced a trap composed of 133 places in 422 ms of which 0 ms to minimize.
[2024-05-31 04:12:38] [INFO ] Deduced a trap composed of 264 places in 410 ms of which 0 ms to minimize.
[2024-05-31 04:12:39] [INFO ] Deduced a trap composed of 256 places in 403 ms of which 0 ms to minimize.
[2024-05-31 04:12:40] [INFO ] Deduced a trap composed of 240 places in 416 ms of which 1 ms to minimize.
[2024-05-31 04:12:40] [INFO ] Deduced a trap composed of 244 places in 406 ms of which 1 ms to minimize.
[2024-05-31 04:12:41] [INFO ] Deduced a trap composed of 260 places in 386 ms of which 1 ms to minimize.
[2024-05-31 04:12:41] [INFO ] Deduced a trap composed of 269 places in 334 ms of which 1 ms to minimize.
[2024-05-31 04:12:42] [INFO ] Deduced a trap composed of 268 places in 404 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 04:12:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 04:12:42] [INFO ] After 25311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 64 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 45 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2024-05-31 04:12:42] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2024-05-31 04:12:42] [INFO ] Invariant cache hit.
[2024-05-31 04:12:42] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-05-31 04:12:42] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2024-05-31 04:12:42] [INFO ] Invariant cache hit.
[2024-05-31 04:12:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:12:44] [INFO ] Implicit Places using invariants and state equation in 1973 ms returned []
Implicit Place search using SMT with State Equation took 2504 ms to find 0 implicit places.
[2024-05-31 04:12:44] [INFO ] Redundant transitions in 110 ms returned []
[2024-05-31 04:12:44] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2024-05-31 04:12:44] [INFO ] Invariant cache hit.
[2024-05-31 04:12:45] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3378 ms. Remains : 581/581 places, 1252/1252 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 581 transition count 1243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 581 transition count 1242
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 580 transition count 1242
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 580 transition count 1241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 579 transition count 1241
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 579 transition count 1231
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 569 transition count 1231
Applied a total of 33 rules in 159 ms. Remains 569 /581 variables (removed 12) and now considering 1231/1252 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1231 rows 569 cols
[2024-05-31 04:12:45] [INFO ] Computed 82 invariants in 56 ms
[2024-05-31 04:12:45] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:12:46] [INFO ] [Nat]Absence check using 75 positive place invariants in 20 ms returned sat
[2024-05-31 04:12:46] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-31 04:12:46] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 04:12:47] [INFO ] Deduced a trap composed of 238 places in 328 ms of which 1 ms to minimize.
[2024-05-31 04:12:47] [INFO ] Deduced a trap composed of 97 places in 316 ms of which 1 ms to minimize.
[2024-05-31 04:12:47] [INFO ] Deduced a trap composed of 97 places in 302 ms of which 1 ms to minimize.
[2024-05-31 04:12:48] [INFO ] Deduced a trap composed of 104 places in 359 ms of which 3 ms to minimize.
[2024-05-31 04:12:48] [INFO ] Deduced a trap composed of 91 places in 330 ms of which 1 ms to minimize.
[2024-05-31 04:12:49] [INFO ] Deduced a trap composed of 97 places in 358 ms of which 0 ms to minimize.
[2024-05-31 04:12:49] [INFO ] Deduced a trap composed of 98 places in 356 ms of which 0 ms to minimize.
[2024-05-31 04:12:49] [INFO ] Deduced a trap composed of 104 places in 360 ms of which 1 ms to minimize.
[2024-05-31 04:12:50] [INFO ] Deduced a trap composed of 98 places in 343 ms of which 0 ms to minimize.
[2024-05-31 04:12:50] [INFO ] Deduced a trap composed of 90 places in 338 ms of which 1 ms to minimize.
[2024-05-31 04:12:51] [INFO ] Deduced a trap composed of 91 places in 335 ms of which 1 ms to minimize.
[2024-05-31 04:12:51] [INFO ] Deduced a trap composed of 98 places in 369 ms of which 1 ms to minimize.
[2024-05-31 04:12:51] [INFO ] Deduced a trap composed of 98 places in 339 ms of which 0 ms to minimize.
[2024-05-31 04:12:52] [INFO ] Deduced a trap composed of 91 places in 349 ms of which 1 ms to minimize.
[2024-05-31 04:12:52] [INFO ] Deduced a trap composed of 98 places in 249 ms of which 0 ms to minimize.
[2024-05-31 04:12:52] [INFO ] Deduced a trap composed of 91 places in 327 ms of which 0 ms to minimize.
[2024-05-31 04:12:53] [INFO ] Deduced a trap composed of 104 places in 343 ms of which 1 ms to minimize.
[2024-05-31 04:12:53] [INFO ] Deduced a trap composed of 84 places in 331 ms of which 1 ms to minimize.
[2024-05-31 04:12:54] [INFO ] Deduced a trap composed of 98 places in 311 ms of which 0 ms to minimize.
[2024-05-31 04:12:54] [INFO ] Deduced a trap composed of 91 places in 295 ms of which 1 ms to minimize.
[2024-05-31 04:12:54] [INFO ] Deduced a trap composed of 105 places in 272 ms of which 2 ms to minimize.
[2024-05-31 04:12:55] [INFO ] Deduced a trap composed of 91 places in 341 ms of which 1 ms to minimize.
[2024-05-31 04:12:55] [INFO ] Deduced a trap composed of 98 places in 358 ms of which 1 ms to minimize.
[2024-05-31 04:12:56] [INFO ] Deduced a trap composed of 91 places in 352 ms of which 1 ms to minimize.
[2024-05-31 04:12:56] [INFO ] Deduced a trap composed of 91 places in 360 ms of which 1 ms to minimize.
[2024-05-31 04:12:56] [INFO ] Deduced a trap composed of 84 places in 341 ms of which 1 ms to minimize.
[2024-05-31 04:12:57] [INFO ] Deduced a trap composed of 98 places in 354 ms of which 1 ms to minimize.
[2024-05-31 04:12:57] [INFO ] Deduced a trap composed of 84 places in 346 ms of which 0 ms to minimize.
[2024-05-31 04:12:58] [INFO ] Deduced a trap composed of 84 places in 331 ms of which 1 ms to minimize.
[2024-05-31 04:12:58] [INFO ] Deduced a trap composed of 91 places in 337 ms of which 1 ms to minimize.
[2024-05-31 04:12:58] [INFO ] Deduced a trap composed of 105 places in 341 ms of which 1 ms to minimize.
[2024-05-31 04:12:59] [INFO ] Deduced a trap composed of 98 places in 342 ms of which 1 ms to minimize.
[2024-05-31 04:12:59] [INFO ] Deduced a trap composed of 91 places in 349 ms of which 1 ms to minimize.
[2024-05-31 04:13:00] [INFO ] Deduced a trap composed of 91 places in 343 ms of which 1 ms to minimize.
[2024-05-31 04:13:00] [INFO ] Deduced a trap composed of 91 places in 345 ms of which 0 ms to minimize.
[2024-05-31 04:13:00] [INFO ] Deduced a trap composed of 98 places in 337 ms of which 1 ms to minimize.
[2024-05-31 04:13:01] [INFO ] Deduced a trap composed of 91 places in 359 ms of which 0 ms to minimize.
[2024-05-31 04:13:01] [INFO ] Deduced a trap composed of 91 places in 339 ms of which 1 ms to minimize.
[2024-05-31 04:13:02] [INFO ] Deduced a trap composed of 91 places in 355 ms of which 1 ms to minimize.
[2024-05-31 04:13:02] [INFO ] Deduced a trap composed of 91 places in 338 ms of which 1 ms to minimize.
[2024-05-31 04:13:02] [INFO ] Deduced a trap composed of 91 places in 338 ms of which 1 ms to minimize.
[2024-05-31 04:13:03] [INFO ] Deduced a trap composed of 84 places in 354 ms of which 1 ms to minimize.
[2024-05-31 04:13:03] [INFO ] Deduced a trap composed of 98 places in 357 ms of which 0 ms to minimize.
[2024-05-31 04:13:04] [INFO ] Deduced a trap composed of 91 places in 339 ms of which 1 ms to minimize.
[2024-05-31 04:13:04] [INFO ] Deduced a trap composed of 98 places in 300 ms of which 1 ms to minimize.
[2024-05-31 04:13:05] [INFO ] Deduced a trap composed of 91 places in 337 ms of which 1 ms to minimize.
[2024-05-31 04:13:05] [INFO ] Deduced a trap composed of 84 places in 322 ms of which 1 ms to minimize.
[2024-05-31 04:13:05] [INFO ] Deduced a trap composed of 91 places in 340 ms of which 0 ms to minimize.
[2024-05-31 04:13:06] [INFO ] Deduced a trap composed of 91 places in 326 ms of which 1 ms to minimize.
[2024-05-31 04:13:06] [INFO ] Deduced a trap composed of 98 places in 344 ms of which 1 ms to minimize.
[2024-05-31 04:13:07] [INFO ] Deduced a trap composed of 91 places in 335 ms of which 1 ms to minimize.
[2024-05-31 04:13:07] [INFO ] Deduced a trap composed of 105 places in 338 ms of which 0 ms to minimize.
[2024-05-31 04:13:08] [INFO ] Deduced a trap composed of 84 places in 342 ms of which 1 ms to minimize.
[2024-05-31 04:13:08] [INFO ] Deduced a trap composed of 98 places in 332 ms of which 0 ms to minimize.
[2024-05-31 04:13:08] [INFO ] Deduced a trap composed of 84 places in 359 ms of which 1 ms to minimize.
[2024-05-31 04:13:09] [INFO ] Deduced a trap composed of 112 places in 338 ms of which 1 ms to minimize.
[2024-05-31 04:13:09] [INFO ] Deduced a trap composed of 98 places in 329 ms of which 0 ms to minimize.
[2024-05-31 04:13:10] [INFO ] Deduced a trap composed of 98 places in 333 ms of which 1 ms to minimize.
[2024-05-31 04:13:10] [INFO ] Deduced a trap composed of 98 places in 330 ms of which 0 ms to minimize.
[2024-05-31 04:13:10] [INFO ] Deduced a trap composed of 91 places in 333 ms of which 1 ms to minimize.
[2024-05-31 04:13:11] [INFO ] Deduced a trap composed of 91 places in 341 ms of which 1 ms to minimize.
[2024-05-31 04:13:11] [INFO ] Deduced a trap composed of 91 places in 340 ms of which 1 ms to minimize.
[2024-05-31 04:13:12] [INFO ] Deduced a trap composed of 91 places in 346 ms of which 1 ms to minimize.
[2024-05-31 04:13:12] [INFO ] Deduced a trap composed of 91 places in 335 ms of which 1 ms to minimize.
[2024-05-31 04:13:12] [INFO ] Deduced a trap composed of 112 places in 332 ms of which 1 ms to minimize.
[2024-05-31 04:13:13] [INFO ] Deduced a trap composed of 91 places in 344 ms of which 1 ms to minimize.
[2024-05-31 04:13:13] [INFO ] Deduced a trap composed of 120 places in 332 ms of which 1 ms to minimize.
[2024-05-31 04:13:14] [INFO ] Deduced a trap composed of 90 places in 348 ms of which 0 ms to minimize.
[2024-05-31 04:13:14] [INFO ] Deduced a trap composed of 108 places in 326 ms of which 1 ms to minimize.
[2024-05-31 04:13:15] [INFO ] Deduced a trap composed of 90 places in 350 ms of which 0 ms to minimize.
[2024-05-31 04:13:15] [INFO ] Deduced a trap composed of 97 places in 333 ms of which 0 ms to minimize.
[2024-05-31 04:13:16] [INFO ] Deduced a trap composed of 90 places in 314 ms of which 1 ms to minimize.
[2024-05-31 04:13:16] [INFO ] Deduced a trap composed of 97 places in 336 ms of which 1 ms to minimize.
[2024-05-31 04:13:16] [INFO ] Deduced a trap composed of 90 places in 336 ms of which 1 ms to minimize.
[2024-05-31 04:13:17] [INFO ] Deduced a trap composed of 83 places in 321 ms of which 1 ms to minimize.
[2024-05-31 04:13:17] [INFO ] Deduced a trap composed of 97 places in 332 ms of which 1 ms to minimize.
[2024-05-31 04:13:17] [INFO ] Deduced a trap composed of 90 places in 326 ms of which 1 ms to minimize.
[2024-05-31 04:13:18] [INFO ] Deduced a trap composed of 90 places in 315 ms of which 1 ms to minimize.
[2024-05-31 04:13:18] [INFO ] Deduced a trap composed of 90 places in 294 ms of which 0 ms to minimize.
[2024-05-31 04:13:19] [INFO ] Deduced a trap composed of 90 places in 299 ms of which 0 ms to minimize.
[2024-05-31 04:13:19] [INFO ] Deduced a trap composed of 90 places in 359 ms of which 1 ms to minimize.
[2024-05-31 04:13:19] [INFO ] Deduced a trap composed of 90 places in 309 ms of which 0 ms to minimize.
[2024-05-31 04:13:20] [INFO ] Deduced a trap composed of 90 places in 293 ms of which 0 ms to minimize.
[2024-05-31 04:13:20] [INFO ] Deduced a trap composed of 83 places in 327 ms of which 1 ms to minimize.
[2024-05-31 04:13:20] [INFO ] Deduced a trap composed of 104 places in 325 ms of which 1 ms to minimize.
[2024-05-31 04:13:21] [INFO ] Deduced a trap composed of 90 places in 384 ms of which 1 ms to minimize.
[2024-05-31 04:13:21] [INFO ] Deduced a trap composed of 104 places in 312 ms of which 1 ms to minimize.
[2024-05-31 04:13:22] [INFO ] Deduced a trap composed of 97 places in 338 ms of which 1 ms to minimize.
[2024-05-31 04:13:22] [INFO ] Deduced a trap composed of 111 places in 326 ms of which 0 ms to minimize.
[2024-05-31 04:13:22] [INFO ] Deduced a trap composed of 118 places in 327 ms of which 1 ms to minimize.
[2024-05-31 04:13:23] [INFO ] Deduced a trap composed of 104 places in 317 ms of which 0 ms to minimize.
[2024-05-31 04:13:23] [INFO ] Deduced a trap composed of 90 places in 296 ms of which 1 ms to minimize.
[2024-05-31 04:13:23] [INFO ] Deduced a trap composed of 97 places in 303 ms of which 1 ms to minimize.
[2024-05-31 04:13:24] [INFO ] Deduced a trap composed of 90 places in 265 ms of which 1 ms to minimize.
[2024-05-31 04:13:24] [INFO ] Deduced a trap composed of 97 places in 282 ms of which 0 ms to minimize.
[2024-05-31 04:13:24] [INFO ] Deduced a trap composed of 104 places in 298 ms of which 0 ms to minimize.
[2024-05-31 04:13:25] [INFO ] Deduced a trap composed of 104 places in 299 ms of which 1 ms to minimize.
[2024-05-31 04:13:25] [INFO ] Deduced a trap composed of 97 places in 300 ms of which 1 ms to minimize.
[2024-05-31 04:13:26] [INFO ] Deduced a trap composed of 118 places in 293 ms of which 1 ms to minimize.
[2024-05-31 04:13:26] [INFO ] Deduced a trap composed of 90 places in 333 ms of which 0 ms to minimize.
[2024-05-31 04:13:26] [INFO ] Deduced a trap composed of 83 places in 288 ms of which 1 ms to minimize.
[2024-05-31 04:13:27] [INFO ] Deduced a trap composed of 83 places in 316 ms of which 1 ms to minimize.
[2024-05-31 04:13:27] [INFO ] Deduced a trap composed of 83 places in 322 ms of which 0 ms to minimize.
[2024-05-31 04:13:27] [INFO ] Deduced a trap composed of 104 places in 300 ms of which 1 ms to minimize.
[2024-05-31 04:13:28] [INFO ] Deduced a trap composed of 83 places in 316 ms of which 1 ms to minimize.
[2024-05-31 04:13:28] [INFO ] Deduced a trap composed of 90 places in 295 ms of which 1 ms to minimize.
[2024-05-31 04:13:28] [INFO ] Deduced a trap composed of 90 places in 259 ms of which 1 ms to minimize.
[2024-05-31 04:13:29] [INFO ] Deduced a trap composed of 90 places in 277 ms of which 1 ms to minimize.
[2024-05-31 04:13:29] [INFO ] Deduced a trap composed of 83 places in 296 ms of which 1 ms to minimize.
[2024-05-31 04:13:29] [INFO ] Deduced a trap composed of 83 places in 308 ms of which 2 ms to minimize.
[2024-05-31 04:13:30] [INFO ] Deduced a trap composed of 97 places in 277 ms of which 0 ms to minimize.
[2024-05-31 04:13:30] [INFO ] Deduced a trap composed of 83 places in 295 ms of which 1 ms to minimize.
[2024-05-31 04:13:31] [INFO ] Deduced a trap composed of 90 places in 285 ms of which 0 ms to minimize.
[2024-05-31 04:13:31] [INFO ] Deduced a trap composed of 97 places in 240 ms of which 0 ms to minimize.
[2024-05-31 04:13:31] [INFO ] Deduced a trap composed of 104 places in 309 ms of which 0 ms to minimize.
[2024-05-31 04:13:32] [INFO ] Deduced a trap composed of 97 places in 264 ms of which 0 ms to minimize.
[2024-05-31 04:13:32] [INFO ] Deduced a trap composed of 83 places in 219 ms of which 0 ms to minimize.
[2024-05-31 04:13:32] [INFO ] Deduced a trap composed of 90 places in 259 ms of which 1 ms to minimize.
[2024-05-31 04:13:32] [INFO ] Deduced a trap composed of 83 places in 240 ms of which 1 ms to minimize.
[2024-05-31 04:13:33] [INFO ] Deduced a trap composed of 90 places in 252 ms of which 0 ms to minimize.
[2024-05-31 04:13:33] [INFO ] Deduced a trap composed of 83 places in 252 ms of which 0 ms to minimize.
[2024-05-31 04:13:33] [INFO ] Deduced a trap composed of 90 places in 213 ms of which 1 ms to minimize.
[2024-05-31 04:13:34] [INFO ] Deduced a trap composed of 104 places in 237 ms of which 0 ms to minimize.
[2024-05-31 04:13:34] [INFO ] Deduced a trap composed of 97 places in 236 ms of which 1 ms to minimize.
[2024-05-31 04:13:34] [INFO ] Deduced a trap composed of 90 places in 307 ms of which 1 ms to minimize.
[2024-05-31 04:13:35] [INFO ] Deduced a trap composed of 90 places in 257 ms of which 1 ms to minimize.
[2024-05-31 04:13:35] [INFO ] Deduced a trap composed of 90 places in 261 ms of which 2 ms to minimize.
[2024-05-31 04:13:35] [INFO ] Deduced a trap composed of 90 places in 238 ms of which 0 ms to minimize.
[2024-05-31 04:13:36] [INFO ] Deduced a trap composed of 104 places in 298 ms of which 1 ms to minimize.
[2024-05-31 04:13:36] [INFO ] Deduced a trap composed of 90 places in 288 ms of which 1 ms to minimize.
[2024-05-31 04:13:36] [INFO ] Deduced a trap composed of 97 places in 312 ms of which 1 ms to minimize.
[2024-05-31 04:13:37] [INFO ] Deduced a trap composed of 97 places in 274 ms of which 1 ms to minimize.
[2024-05-31 04:13:37] [INFO ] Deduced a trap composed of 90 places in 261 ms of which 13 ms to minimize.
[2024-05-31 04:13:37] [INFO ] Deduced a trap composed of 83 places in 253 ms of which 3 ms to minimize.
[2024-05-31 04:13:38] [INFO ] Deduced a trap composed of 90 places in 304 ms of which 0 ms to minimize.
[2024-05-31 04:13:38] [INFO ] Deduced a trap composed of 90 places in 313 ms of which 1 ms to minimize.
[2024-05-31 04:13:38] [INFO ] Deduced a trap composed of 104 places in 327 ms of which 1 ms to minimize.
[2024-05-31 04:13:39] [INFO ] Deduced a trap composed of 83 places in 312 ms of which 1 ms to minimize.
[2024-05-31 04:13:39] [INFO ] Deduced a trap composed of 97 places in 304 ms of which 1 ms to minimize.
[2024-05-31 04:13:39] [INFO ] Deduced a trap composed of 90 places in 292 ms of which 1 ms to minimize.
[2024-05-31 04:13:40] [INFO ] Deduced a trap composed of 83 places in 302 ms of which 1 ms to minimize.
[2024-05-31 04:13:40] [INFO ] Deduced a trap composed of 83 places in 288 ms of which 1 ms to minimize.
[2024-05-31 04:13:40] [INFO ] Deduced a trap composed of 90 places in 267 ms of which 0 ms to minimize.
[2024-05-31 04:13:41] [INFO ] Deduced a trap composed of 90 places in 355 ms of which 0 ms to minimize.
[2024-05-31 04:13:41] [INFO ] Deduced a trap composed of 90 places in 332 ms of which 0 ms to minimize.
[2024-05-31 04:13:42] [INFO ] Deduced a trap composed of 90 places in 322 ms of which 1 ms to minimize.
[2024-05-31 04:13:42] [INFO ] Deduced a trap composed of 90 places in 306 ms of which 1 ms to minimize.
[2024-05-31 04:13:42] [INFO ] Deduced a trap composed of 90 places in 326 ms of which 0 ms to minimize.
[2024-05-31 04:13:43] [INFO ] Deduced a trap composed of 97 places in 344 ms of which 0 ms to minimize.
[2024-05-31 04:13:43] [INFO ] Deduced a trap composed of 104 places in 359 ms of which 1 ms to minimize.
[2024-05-31 04:13:44] [INFO ] Deduced a trap composed of 97 places in 358 ms of which 1 ms to minimize.
[2024-05-31 04:13:44] [INFO ] Deduced a trap composed of 83 places in 334 ms of which 0 ms to minimize.
[2024-05-31 04:13:44] [INFO ] Deduced a trap composed of 97 places in 339 ms of which 1 ms to minimize.
[2024-05-31 04:13:45] [INFO ] Deduced a trap composed of 97 places in 364 ms of which 1 ms to minimize.
[2024-05-31 04:13:45] [INFO ] Deduced a trap composed of 104 places in 322 ms of which 1 ms to minimize.
[2024-05-31 04:13:46] [INFO ] Deduced a trap composed of 97 places in 285 ms of which 1 ms to minimize.
[2024-05-31 04:13:46] [INFO ] Deduced a trap composed of 83 places in 315 ms of which 0 ms to minimize.
[2024-05-31 04:13:46] [INFO ] Deduced a trap composed of 83 places in 305 ms of which 1 ms to minimize.
[2024-05-31 04:13:47] [INFO ] Deduced a trap composed of 104 places in 322 ms of which 1 ms to minimize.
[2024-05-31 04:13:47] [INFO ] Deduced a trap composed of 97 places in 302 ms of which 0 ms to minimize.
[2024-05-31 04:13:47] [INFO ] Deduced a trap composed of 90 places in 407 ms of which 1 ms to minimize.
[2024-05-31 04:13:48] [INFO ] Deduced a trap composed of 132 places in 334 ms of which 1 ms to minimize.
[2024-05-31 04:13:48] [INFO ] Deduced a trap composed of 111 places in 310 ms of which 0 ms to minimize.
[2024-05-31 04:13:49] [INFO ] Deduced a trap composed of 139 places in 317 ms of which 1 ms to minimize.
[2024-05-31 04:13:49] [INFO ] Deduced a trap composed of 118 places in 313 ms of which 1 ms to minimize.
[2024-05-31 04:13:49] [INFO ] Deduced a trap composed of 90 places in 327 ms of which 1 ms to minimize.
[2024-05-31 04:13:50] [INFO ] Deduced a trap composed of 90 places in 310 ms of which 1 ms to minimize.
[2024-05-31 04:13:50] [INFO ] Deduced a trap composed of 90 places in 300 ms of which 1 ms to minimize.
[2024-05-31 04:13:50] [INFO ] Deduced a trap composed of 90 places in 298 ms of which 0 ms to minimize.
[2024-05-31 04:13:51] [INFO ] Deduced a trap composed of 104 places in 298 ms of which 1 ms to minimize.
[2024-05-31 04:13:51] [INFO ] Deduced a trap composed of 97 places in 330 ms of which 1 ms to minimize.
[2024-05-31 04:13:52] [INFO ] Deduced a trap composed of 90 places in 301 ms of which 0 ms to minimize.
[2024-05-31 04:13:52] [INFO ] Deduced a trap composed of 97 places in 310 ms of which 1 ms to minimize.
[2024-05-31 04:13:52] [INFO ] Deduced a trap composed of 104 places in 300 ms of which 0 ms to minimize.
[2024-05-31 04:13:53] [INFO ] Deduced a trap composed of 90 places in 321 ms of which 0 ms to minimize.
[2024-05-31 04:13:53] [INFO ] Deduced a trap composed of 97 places in 331 ms of which 1 ms to minimize.
[2024-05-31 04:13:53] [INFO ] Deduced a trap composed of 90 places in 298 ms of which 0 ms to minimize.
[2024-05-31 04:13:54] [INFO ] Deduced a trap composed of 90 places in 305 ms of which 1 ms to minimize.
[2024-05-31 04:13:54] [INFO ] Deduced a trap composed of 90 places in 312 ms of which 0 ms to minimize.
[2024-05-31 04:13:55] [INFO ] Deduced a trap composed of 90 places in 317 ms of which 1 ms to minimize.
[2024-05-31 04:13:55] [INFO ] Deduced a trap composed of 97 places in 328 ms of which 0 ms to minimize.
[2024-05-31 04:13:55] [INFO ] Deduced a trap composed of 104 places in 315 ms of which 1 ms to minimize.
[2024-05-31 04:13:56] [INFO ] Deduced a trap composed of 90 places in 311 ms of which 1 ms to minimize.
[2024-05-31 04:13:56] [INFO ] Deduced a trap composed of 111 places in 326 ms of which 1 ms to minimize.
[2024-05-31 04:13:56] [INFO ] Deduced a trap composed of 90 places in 297 ms of which 1 ms to minimize.
[2024-05-31 04:13:57] [INFO ] Deduced a trap composed of 90 places in 341 ms of which 1 ms to minimize.
[2024-05-31 04:13:57] [INFO ] Deduced a trap composed of 83 places in 304 ms of which 0 ms to minimize.
[2024-05-31 04:13:58] [INFO ] Deduced a trap composed of 83 places in 337 ms of which 1 ms to minimize.
[2024-05-31 04:13:58] [INFO ] Deduced a trap composed of 90 places in 304 ms of which 1 ms to minimize.
[2024-05-31 04:13:58] [INFO ] Deduced a trap composed of 97 places in 301 ms of which 0 ms to minimize.
[2024-05-31 04:13:59] [INFO ] Deduced a trap composed of 90 places in 326 ms of which 0 ms to minimize.
[2024-05-31 04:13:59] [INFO ] Deduced a trap composed of 90 places in 311 ms of which 1 ms to minimize.
[2024-05-31 04:13:59] [INFO ] Deduced a trap composed of 97 places in 312 ms of which 1 ms to minimize.
[2024-05-31 04:14:00] [INFO ] Deduced a trap composed of 90 places in 352 ms of which 1 ms to minimize.
[2024-05-31 04:14:00] [INFO ] Deduced a trap composed of 104 places in 299 ms of which 1 ms to minimize.
[2024-05-31 04:14:01] [INFO ] Deduced a trap composed of 90 places in 309 ms of which 0 ms to minimize.
[2024-05-31 04:14:01] [INFO ] Deduced a trap composed of 97 places in 308 ms of which 1 ms to minimize.
[2024-05-31 04:14:01] [INFO ] Deduced a trap composed of 104 places in 313 ms of which 1 ms to minimize.
[2024-05-31 04:14:02] [INFO ] Deduced a trap composed of 97 places in 311 ms of which 1 ms to minimize.
[2024-05-31 04:14:02] [INFO ] Deduced a trap composed of 97 places in 303 ms of which 1 ms to minimize.
[2024-05-31 04:14:03] [INFO ] Deduced a trap composed of 90 places in 327 ms of which 1 ms to minimize.
[2024-05-31 04:14:03] [INFO ] Deduced a trap composed of 90 places in 337 ms of which 1 ms to minimize.
[2024-05-31 04:14:03] [INFO ] Deduced a trap composed of 104 places in 339 ms of which 1 ms to minimize.
[2024-05-31 04:14:04] [INFO ] Deduced a trap composed of 104 places in 330 ms of which 1 ms to minimize.
[2024-05-31 04:14:04] [INFO ] Deduced a trap composed of 90 places in 342 ms of which 1 ms to minimize.
[2024-05-31 04:14:05] [INFO ] Deduced a trap composed of 104 places in 336 ms of which 1 ms to minimize.
[2024-05-31 04:14:05] [INFO ] Deduced a trap composed of 97 places in 368 ms of which 1 ms to minimize.
[2024-05-31 04:14:05] [INFO ] Deduced a trap composed of 90 places in 337 ms of which 1 ms to minimize.
[2024-05-31 04:14:06] [INFO ] Deduced a trap composed of 104 places in 248 ms of which 0 ms to minimize.
[2024-05-31 04:14:06] [INFO ] Deduced a trap composed of 83 places in 285 ms of which 0 ms to minimize.
[2024-05-31 04:14:06] [INFO ] Deduced a trap composed of 104 places in 292 ms of which 1 ms to minimize.
[2024-05-31 04:14:07] [INFO ] Deduced a trap composed of 97 places in 294 ms of which 1 ms to minimize.
[2024-05-31 04:14:07] [INFO ] Deduced a trap composed of 104 places in 258 ms of which 1 ms to minimize.
[2024-05-31 04:14:07] [INFO ] Deduced a trap composed of 90 places in 285 ms of which 1 ms to minimize.
[2024-05-31 04:14:08] [INFO ] Deduced a trap composed of 104 places in 251 ms of which 1 ms to minimize.
[2024-05-31 04:14:08] [INFO ] Deduced a trap composed of 97 places in 346 ms of which 1 ms to minimize.
[2024-05-31 04:14:08] [INFO ] Deduced a trap composed of 104 places in 270 ms of which 0 ms to minimize.
[2024-05-31 04:14:09] [INFO ] Deduced a trap composed of 97 places in 239 ms of which 0 ms to minimize.
[2024-05-31 04:14:09] [INFO ] Deduced a trap composed of 90 places in 267 ms of which 0 ms to minimize.
[2024-05-31 04:14:09] [INFO ] Deduced a trap composed of 90 places in 249 ms of which 0 ms to minimize.
[2024-05-31 04:14:10] [INFO ] Deduced a trap composed of 90 places in 356 ms of which 1 ms to minimize.
[2024-05-31 04:14:10] [INFO ] Deduced a trap composed of 83 places in 355 ms of which 1 ms to minimize.
[2024-05-31 04:14:11] [INFO ] Deduced a trap composed of 90 places in 334 ms of which 1 ms to minimize.
[2024-05-31 04:14:11] [INFO ] Deduced a trap composed of 97 places in 344 ms of which 4 ms to minimize.
[2024-05-31 04:14:12] [INFO ] Deduced a trap composed of 97 places in 343 ms of which 0 ms to minimize.
[2024-05-31 04:14:12] [INFO ] Deduced a trap composed of 97 places in 336 ms of which 0 ms to minimize.
[2024-05-31 04:14:13] [INFO ] Deduced a trap composed of 104 places in 360 ms of which 1 ms to minimize.
[2024-05-31 04:14:13] [INFO ] Deduced a trap composed of 104 places in 287 ms of which 0 ms to minimize.
[2024-05-31 04:14:13] [INFO ] Deduced a trap composed of 90 places in 318 ms of which 1 ms to minimize.
[2024-05-31 04:14:14] [INFO ] Deduced a trap composed of 90 places in 205 ms of which 0 ms to minimize.
[2024-05-31 04:14:21] [INFO ] Deduced a trap composed of 111 places in 301 ms of which 0 ms to minimize.
[2024-05-31 04:14:21] [INFO ] Deduced a trap composed of 111 places in 322 ms of which 1 ms to minimize.
[2024-05-31 04:14:23] [INFO ] Deduced a trap composed of 95 places in 349 ms of which 0 ms to minimize.
[2024-05-31 04:14:23] [INFO ] Deduced a trap composed of 101 places in 348 ms of which 1 ms to minimize.
[2024-05-31 04:14:24] [INFO ] Deduced a trap composed of 102 places in 347 ms of which 1 ms to minimize.
[2024-05-31 04:14:25] [INFO ] Deduced a trap composed of 111 places in 349 ms of which 1 ms to minimize.
[2024-05-31 04:14:34] [INFO ] Trap strengthening (SAT) tested/added 236/236 trap constraints in 107441 ms
[2024-05-31 04:14:34] [INFO ] After 108402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 04:14:34] [INFO ] After 108535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 9 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2024-05-31 04:14:34] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2024-05-31 04:14:34] [INFO ] Computed 82 invariants in 36 ms
[2024-05-31 04:14:35] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
[2024-05-31 04:14:35] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:14:35] [INFO ] Invariant cache hit.
[2024-05-31 04:14:36] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-31 04:14:36] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:14:36] [INFO ] Invariant cache hit.
[2024-05-31 04:14:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:14:39] [INFO ] Implicit Places using invariants and state equation in 3054 ms returned []
Implicit Place search using SMT with State Equation took 3512 ms to find 0 implicit places.
[2024-05-31 04:14:39] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:14:39] [INFO ] Invariant cache hit.
[2024-05-31 04:14:40] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5213 ms. Remains : 653/653 places, 1324/1324 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 233 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-00 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:(LEQ 1 s198)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 7 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-00 finished in 5514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 653 transition count 1290
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 619 transition count 1290
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 68 place count 619 transition count 1256
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 136 place count 585 transition count 1256
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 582 transition count 1253
Applied a total of 142 rules in 161 ms. Remains 582 /653 variables (removed 71) and now considering 1253/1324 (removed 71) transitions.
[2024-05-31 04:14:40] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2024-05-31 04:14:40] [INFO ] Computed 82 invariants in 42 ms
[2024-05-31 04:14:41] [INFO ] Dead Transitions using invariants and state equation in 731 ms found 0 transitions.
[2024-05-31 04:14:41] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:14:41] [INFO ] Invariant cache hit.
[2024-05-31 04:14:41] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-31 04:14:41] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:14:41] [INFO ] Invariant cache hit.
[2024-05-31 04:14:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:14:44] [INFO ] Implicit Places using invariants and state equation in 3167 ms returned []
Implicit Place search using SMT with State Equation took 3513 ms to find 0 implicit places.
[2024-05-31 04:14:44] [INFO ] Redundant transitions in 79 ms returned []
[2024-05-31 04:14:44] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:14:44] [INFO ] Invariant cache hit.
[2024-05-31 04:14:45] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/653 places, 1253/1324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5126 ms. Remains : 582/653 places, 1253/1324 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-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:(LEQ s210 s576)], 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 19 steps with 1 reset in 2 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-01 finished in 5217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 9 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2024-05-31 04:14:45] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2024-05-31 04:14:45] [INFO ] Computed 82 invariants in 14 ms
[2024-05-31 04:14:46] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
[2024-05-31 04:14:46] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:14:46] [INFO ] Invariant cache hit.
[2024-05-31 04:14:46] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-31 04:14:46] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:14:46] [INFO ] Invariant cache hit.
[2024-05-31 04:14:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:14:49] [INFO ] Implicit Places using invariants and state equation in 2269 ms returned []
Implicit Place search using SMT with State Equation took 2725 ms to find 0 implicit places.
[2024-05-31 04:14:49] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:14:49] [INFO ] Invariant cache hit.
[2024-05-31 04:14:49] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4308 ms. Remains : 653/653 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s33)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 698 ms.
Product exploration explored 100000 steps with 50000 reset in 662 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 38 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-03 finished in 5806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 653 transition count 1290
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 619 transition count 1290
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 68 place count 619 transition count 1255
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 138 place count 584 transition count 1255
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 581 transition count 1252
Applied a total of 144 rules in 90 ms. Remains 581 /653 variables (removed 72) and now considering 1252/1324 (removed 72) transitions.
[2024-05-31 04:14:51] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2024-05-31 04:14:51] [INFO ] Computed 82 invariants in 33 ms
[2024-05-31 04:14:52] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
[2024-05-31 04:14:52] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2024-05-31 04:14:52] [INFO ] Invariant cache hit.
[2024-05-31 04:14:52] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-31 04:14:52] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2024-05-31 04:14:52] [INFO ] Invariant cache hit.
[2024-05-31 04:14:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:14:55] [INFO ] Implicit Places using invariants and state equation in 2574 ms returned []
Implicit Place search using SMT with State Equation took 2974 ms to find 0 implicit places.
[2024-05-31 04:14:55] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 04:14:55] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2024-05-31 04:14:55] [INFO ] Invariant cache hit.
[2024-05-31 04:14:55] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/653 places, 1252/1324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4485 ms. Remains : 581/653 places, 1252/1324 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s97 s198)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 75 steps with 4 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-05 finished in 4565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 653 transition count 1289
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 583 transition count 1254
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 580 transition count 1251
Applied a total of 146 rules in 57 ms. Remains 580 /653 variables (removed 73) and now considering 1251/1324 (removed 73) transitions.
[2024-05-31 04:14:56] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 04:14:56] [INFO ] Computed 82 invariants in 22 ms
[2024-05-31 04:14:56] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
[2024-05-31 04:14:56] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 04:14:56] [INFO ] Invariant cache hit.
[2024-05-31 04:14:57] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-05-31 04:14:57] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 04:14:57] [INFO ] Invariant cache hit.
[2024-05-31 04:14:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:14:59] [INFO ] Implicit Places using invariants and state equation in 2246 ms returned []
Implicit Place search using SMT with State Equation took 2760 ms to find 0 implicit places.
[2024-05-31 04:14:59] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 04:14:59] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 04:14:59] [INFO ] Invariant cache hit.
[2024-05-31 04:15:00] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 580/653 places, 1251/1324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4097 ms. Remains : 580/653 places, 1251/1324 transitions.
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s578 s97)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 111 steps with 9 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-07 finished in 4167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&((p0 U p1) U p2)))&&F(G(p3)))))'
Support contains 107 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 653 transition count 1291
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 620 transition count 1290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 619 transition count 1290
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 68 place count 619 transition count 1256
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 136 place count 585 transition count 1256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 584 transition count 1255
Applied a total of 138 rules in 75 ms. Remains 584 /653 variables (removed 69) and now considering 1255/1324 (removed 69) transitions.
[2024-05-31 04:15:00] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2024-05-31 04:15:00] [INFO ] Computed 82 invariants in 26 ms
[2024-05-31 04:15:00] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
[2024-05-31 04:15:00] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2024-05-31 04:15:00] [INFO ] Invariant cache hit.
[2024-05-31 04:15:01] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-31 04:15:01] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2024-05-31 04:15:01] [INFO ] Invariant cache hit.
[2024-05-31 04:15:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:15:04] [INFO ] Implicit Places using invariants and state equation in 2975 ms returned []
Implicit Place search using SMT with State Equation took 3324 ms to find 0 implicit places.
[2024-05-31 04:15:04] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 04:15:04] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2024-05-31 04:15:04] [INFO ] Invariant cache hit.
[2024-05-31 04:15:04] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 584/653 places, 1255/1324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4825 ms. Remains : 584/653 places, 1255/1324 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p3), (AND (NOT p0) p2 (NOT p1)), (NOT p2)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=3 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 92044 steps with 6516 reset in 1042 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-09 finished in 6152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 2 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 14 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2024-05-31 04:15:06] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2024-05-31 04:15:06] [INFO ] Computed 82 invariants in 39 ms
[2024-05-31 04:15:07] [INFO ] Dead Transitions using invariants and state equation in 818 ms found 0 transitions.
[2024-05-31 04:15:07] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:15:07] [INFO ] Invariant cache hit.
[2024-05-31 04:15:07] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-31 04:15:07] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:15:07] [INFO ] Invariant cache hit.
[2024-05-31 04:15:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:15:11] [INFO ] Implicit Places using invariants and state equation in 3539 ms returned []
Implicit Place search using SMT with State Equation took 4003 ms to find 0 implicit places.
[2024-05-31 04:15:11] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:15:11] [INFO ] Invariant cache hit.
[2024-05-31 04:15:12] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5699 ms. Remains : 653/653 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GT 3 s199), p1:(LEQ 1 s162)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5600 reset in 556 ms.
Product exploration explored 100000 steps with 5602 reset in 579 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 308215 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{1=1}
Probabilistic random walk after 308215 steps, saw 87416 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-31 04:15:16] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:15:16] [INFO ] Invariant cache hit.
[2024-05-31 04:15:16] [INFO ] [Real]Absence check using 76 positive place invariants in 24 ms returned sat
[2024-05-31 04:15:16] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 14 ms returned sat
[2024-05-31 04:15:16] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:15:17] [INFO ] [Nat]Absence check using 76 positive place invariants in 25 ms returned sat
[2024-05-31 04:15:17] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 14 ms returned sat
[2024-05-31 04:15:17] [INFO ] After 679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 04:15:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:15:17] [INFO ] After 68ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 04:15:17] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-31 04:15:17] [INFO ] After 1034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 653 transition count 1289
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 583 transition count 1254
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 580 transition count 1251
Applied a total of 146 rules in 54 ms. Remains 580 /653 variables (removed 73) and now considering 1251/1324 (removed 73) transitions.
[2024-05-31 04:15:18] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 04:15:18] [INFO ] Computed 82 invariants in 34 ms
[2024-05-31 04:15:18] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 625 ms. Remains : 580/653 places, 1251/1324 transitions.
Finished random walk after 221 steps, including 14 resets, run visited all 1 properties in 3 ms. (steps per millisecond=73 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 653 transition count 1289
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 583 transition count 1254
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 580 transition count 1251
Applied a total of 146 rules in 65 ms. Remains 580 /653 variables (removed 73) and now considering 1251/1324 (removed 73) transitions.
[2024-05-31 04:15:18] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 04:15:18] [INFO ] Invariant cache hit.
[2024-05-31 04:15:19] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
[2024-05-31 04:15:19] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 04:15:19] [INFO ] Invariant cache hit.
[2024-05-31 04:15:19] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-31 04:15:20] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 04:15:20] [INFO ] Invariant cache hit.
[2024-05-31 04:15:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:15:22] [INFO ] Implicit Places using invariants and state equation in 2323 ms returned []
Implicit Place search using SMT with State Equation took 2712 ms to find 0 implicit places.
[2024-05-31 04:15:22] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-31 04:15:22] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 04:15:22] [INFO ] Invariant cache hit.
[2024-05-31 04:15:23] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 580/653 places, 1251/1324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4156 ms. Remains : 580/653 places, 1251/1324 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 149 steps, including 10 resets, run visited all 2 properties in 5 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering criterion allowed to conclude after 453 steps with 35 reset in 10 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-10 finished in 17371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(p1))))'
Support contains 4 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 18 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2024-05-31 04:15:23] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2024-05-31 04:15:23] [INFO ] Computed 82 invariants in 28 ms
[2024-05-31 04:15:24] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
[2024-05-31 04:15:24] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:15:24] [INFO ] Invariant cache hit.
[2024-05-31 04:15:25] [INFO ] Implicit Places using invariants in 566 ms returned []
[2024-05-31 04:15:25] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:15:25] [INFO ] Invariant cache hit.
[2024-05-31 04:15:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:15:27] [INFO ] Implicit Places using invariants and state equation in 2940 ms returned []
Implicit Place search using SMT with State Equation took 3522 ms to find 0 implicit places.
[2024-05-31 04:15:27] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:15:27] [INFO ] Invariant cache hit.
[2024-05-31 04:15:28] [INFO ] Dead Transitions using invariants and state equation in 989 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5307 ms. Remains : 653/653 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT s537 s198), p1:(GT s97 s581)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-11 finished in 5493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||X((p1 U p2)))))))'
Support contains 313 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 4 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2024-05-31 04:15:29] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:15:29] [INFO ] Invariant cache hit.
[2024-05-31 04:15:29] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
[2024-05-31 04:15:29] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:15:29] [INFO ] Invariant cache hit.
[2024-05-31 04:15:30] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-31 04:15:30] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:15:30] [INFO ] Invariant cache hit.
[2024-05-31 04:15:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:15:32] [INFO ] Implicit Places using invariants and state equation in 2385 ms returned []
Implicit Place search using SMT with State Equation took 2771 ms to find 0 implicit places.
[2024-05-31 04:15:32] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:15:32] [INFO ] Invariant cache hit.
[2024-05-31 04:15:33] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4105 ms. Remains : 653/653 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p0:(GT s161 (ADD s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-12 finished in 4311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 34 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 653 transition count 1291
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 620 transition count 1291
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 66 place count 620 transition count 1256
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 136 place count 585 transition count 1256
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 582 transition count 1253
Applied a total of 142 rules in 73 ms. Remains 582 /653 variables (removed 71) and now considering 1253/1324 (removed 71) transitions.
[2024-05-31 04:15:33] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2024-05-31 04:15:33] [INFO ] Computed 82 invariants in 18 ms
[2024-05-31 04:15:34] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
[2024-05-31 04:15:34] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:15:34] [INFO ] Invariant cache hit.
[2024-05-31 04:15:34] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-31 04:15:34] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:15:34] [INFO ] Invariant cache hit.
[2024-05-31 04:15:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:15:36] [INFO ] Implicit Places using invariants and state equation in 1968 ms returned []
Implicit Place search using SMT with State Equation took 2416 ms to find 0 implicit places.
[2024-05-31 04:15:36] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-31 04:15:36] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:15:36] [INFO ] Invariant cache hit.
[2024-05-31 04:15:37] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/653 places, 1253/1324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3669 ms. Remains : 582/653 places, 1253/1324 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LEQ 1 (ADD s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6920 reset in 1328 ms.
Product exploration explored 100000 steps with 6920 reset in 1101 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 687 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 04:15:40] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:15:40] [INFO ] Invariant cache hit.
[2024-05-31 04:15:40] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:15:40] [INFO ] [Nat]Absence check using 75 positive place invariants in 19 ms returned sat
[2024-05-31 04:15:40] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-31 04:15:42] [INFO ] After 2218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 04:15:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:15:42] [INFO ] After 241ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 04:15:43] [INFO ] Deduced a trap composed of 254 places in 409 ms of which 1 ms to minimize.
[2024-05-31 04:15:43] [INFO ] Deduced a trap composed of 237 places in 387 ms of which 0 ms to minimize.
[2024-05-31 04:15:44] [INFO ] Deduced a trap composed of 251 places in 388 ms of which 1 ms to minimize.
[2024-05-31 04:15:44] [INFO ] Deduced a trap composed of 247 places in 382 ms of which 1 ms to minimize.
[2024-05-31 04:15:45] [INFO ] Deduced a trap composed of 223 places in 409 ms of which 1 ms to minimize.
[2024-05-31 04:15:45] [INFO ] Deduced a trap composed of 266 places in 378 ms of which 0 ms to minimize.
[2024-05-31 04:15:46] [INFO ] Deduced a trap composed of 254 places in 402 ms of which 1 ms to minimize.
[2024-05-31 04:15:46] [INFO ] Deduced a trap composed of 263 places in 397 ms of which 1 ms to minimize.
[2024-05-31 04:15:47] [INFO ] Deduced a trap composed of 248 places in 414 ms of which 1 ms to minimize.
[2024-05-31 04:15:48] [INFO ] Deduced a trap composed of 246 places in 418 ms of which 1 ms to minimize.
[2024-05-31 04:15:49] [INFO ] Deduced a trap composed of 260 places in 417 ms of which 1 ms to minimize.
[2024-05-31 04:15:50] [INFO ] Deduced a trap composed of 257 places in 399 ms of which 0 ms to minimize.
[2024-05-31 04:15:59] [INFO ] Trap strengthening (SAT) tested/added 12/12 trap constraints in 16754 ms
[2024-05-31 04:15:59] [INFO ] After 17057ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 04:15:59] [INFO ] After 19450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 34 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 26 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2024-05-31 04:15:59] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:15:59] [INFO ] Invariant cache hit.
[2024-05-31 04:16:00] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 708 ms. Remains : 582/582 places, 1253/1253 transitions.
Incomplete random walk after 10000 steps, including 684 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 369604 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 369604 steps, saw 109801 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 04:16:03] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:16:03] [INFO ] Invariant cache hit.
[2024-05-31 04:16:03] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:16:03] [INFO ] [Nat]Absence check using 75 positive place invariants in 20 ms returned sat
[2024-05-31 04:16:03] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 24 ms returned sat
[2024-05-31 04:16:05] [INFO ] After 1903ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 04:16:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:16:06] [INFO ] After 240ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 04:16:06] [INFO ] Deduced a trap composed of 254 places in 421 ms of which 1 ms to minimize.
[2024-05-31 04:16:06] [INFO ] Deduced a trap composed of 237 places in 396 ms of which 1 ms to minimize.
[2024-05-31 04:16:07] [INFO ] Deduced a trap composed of 251 places in 405 ms of which 1 ms to minimize.
[2024-05-31 04:16:08] [INFO ] Deduced a trap composed of 247 places in 405 ms of which 1 ms to minimize.
[2024-05-31 04:16:08] [INFO ] Deduced a trap composed of 223 places in 414 ms of which 1 ms to minimize.
[2024-05-31 04:16:09] [INFO ] Deduced a trap composed of 266 places in 397 ms of which 1 ms to minimize.
[2024-05-31 04:16:09] [INFO ] Deduced a trap composed of 254 places in 375 ms of which 1 ms to minimize.
[2024-05-31 04:16:09] [INFO ] Deduced a trap composed of 263 places in 369 ms of which 1 ms to minimize.
[2024-05-31 04:16:10] [INFO ] Deduced a trap composed of 248 places in 417 ms of which 0 ms to minimize.
[2024-05-31 04:16:11] [INFO ] Deduced a trap composed of 246 places in 406 ms of which 0 ms to minimize.
[2024-05-31 04:16:12] [INFO ] Deduced a trap composed of 260 places in 421 ms of which 1 ms to minimize.
[2024-05-31 04:16:13] [INFO ] Deduced a trap composed of 257 places in 408 ms of which 0 ms to minimize.
[2024-05-31 04:16:22] [INFO ] Trap strengthening (SAT) tested/added 12/12 trap constraints in 16567 ms
[2024-05-31 04:16:22] [INFO ] After 16857ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 04:16:22] [INFO ] After 18929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 34 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 54 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 582/582 places, 1253/1253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 43 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2024-05-31 04:16:22] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:16:22] [INFO ] Invariant cache hit.
[2024-05-31 04:16:23] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-05-31 04:16:23] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:16:23] [INFO ] Invariant cache hit.
[2024-05-31 04:16:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:16:25] [INFO ] Implicit Places using invariants and state equation in 2032 ms returned []
Implicit Place search using SMT with State Equation took 2480 ms to find 0 implicit places.
[2024-05-31 04:16:25] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-31 04:16:25] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:16:25] [INFO ] Invariant cache hit.
[2024-05-31 04:16:25] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3261 ms. Remains : 582/582 places, 1253/1253 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 582 transition count 1244
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 582 transition count 1243
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 581 transition count 1243
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 581 transition count 1242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 580 transition count 1242
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 580 transition count 1232
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 570 transition count 1232
Applied a total of 33 rules in 107 ms. Remains 570 /582 variables (removed 12) and now considering 1232/1253 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1232 rows 570 cols
[2024-05-31 04:16:26] [INFO ] Computed 82 invariants in 23 ms
[2024-05-31 04:16:26] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:16:26] [INFO ] [Nat]Absence check using 75 positive place invariants in 18 ms returned sat
[2024-05-31 04:16:26] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2024-05-31 04:16:26] [INFO ] After 585ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 04:16:27] [INFO ] Deduced a trap composed of 226 places in 314 ms of which 1 ms to minimize.
[2024-05-31 04:16:27] [INFO ] Deduced a trap composed of 246 places in 308 ms of which 1 ms to minimize.
[2024-05-31 04:16:28] [INFO ] Deduced a trap composed of 216 places in 297 ms of which 1 ms to minimize.
[2024-05-31 04:16:28] [INFO ] Deduced a trap composed of 221 places in 333 ms of which 1 ms to minimize.
[2024-05-31 04:16:28] [INFO ] Deduced a trap composed of 226 places in 310 ms of which 1 ms to minimize.
[2024-05-31 04:16:29] [INFO ] Deduced a trap composed of 221 places in 306 ms of which 1 ms to minimize.
[2024-05-31 04:16:29] [INFO ] Deduced a trap composed of 231 places in 310 ms of which 1 ms to minimize.
[2024-05-31 04:16:30] [INFO ] Deduced a trap composed of 226 places in 312 ms of which 1 ms to minimize.
[2024-05-31 04:16:30] [INFO ] Deduced a trap composed of 240 places in 300 ms of which 0 ms to minimize.
[2024-05-31 04:16:31] [INFO ] Deduced a trap composed of 243 places in 301 ms of which 1 ms to minimize.
[2024-05-31 04:16:31] [INFO ] Deduced a trap composed of 240 places in 287 ms of which 1 ms to minimize.
[2024-05-31 04:16:31] [INFO ] Deduced a trap composed of 246 places in 283 ms of which 1 ms to minimize.
[2024-05-31 04:16:32] [INFO ] Deduced a trap composed of 243 places in 299 ms of which 1 ms to minimize.
[2024-05-31 04:16:32] [INFO ] Deduced a trap composed of 246 places in 335 ms of which 1 ms to minimize.
[2024-05-31 04:16:32] [INFO ] Deduced a trap composed of 237 places in 286 ms of which 1 ms to minimize.
[2024-05-31 04:16:33] [INFO ] Deduced a trap composed of 243 places in 270 ms of which 1 ms to minimize.
[2024-05-31 04:16:33] [INFO ] Deduced a trap composed of 243 places in 305 ms of which 0 ms to minimize.
[2024-05-31 04:16:33] [INFO ] Deduced a trap composed of 240 places in 285 ms of which 1 ms to minimize.
[2024-05-31 04:16:34] [INFO ] Deduced a trap composed of 243 places in 292 ms of which 0 ms to minimize.
[2024-05-31 04:16:34] [INFO ] Deduced a trap composed of 240 places in 266 ms of which 0 ms to minimize.
[2024-05-31 04:16:34] [INFO ] Deduced a trap composed of 246 places in 278 ms of which 0 ms to minimize.
[2024-05-31 04:16:35] [INFO ] Deduced a trap composed of 243 places in 268 ms of which 0 ms to minimize.
[2024-05-31 04:16:35] [INFO ] Deduced a trap composed of 243 places in 295 ms of which 1 ms to minimize.
[2024-05-31 04:16:35] [INFO ] Deduced a trap composed of 243 places in 258 ms of which 1 ms to minimize.
[2024-05-31 04:16:36] [INFO ] Deduced a trap composed of 246 places in 274 ms of which 0 ms to minimize.
[2024-05-31 04:16:36] [INFO ] Deduced a trap composed of 243 places in 275 ms of which 1 ms to minimize.
[2024-05-31 04:16:36] [INFO ] Deduced a trap composed of 246 places in 231 ms of which 1 ms to minimize.
[2024-05-31 04:16:36] [INFO ] Deduced a trap composed of 249 places in 242 ms of which 1 ms to minimize.
[2024-05-31 04:16:37] [INFO ] Deduced a trap composed of 249 places in 240 ms of which 1 ms to minimize.
[2024-05-31 04:16:37] [INFO ] Deduced a trap composed of 246 places in 309 ms of which 1 ms to minimize.
[2024-05-31 04:16:37] [INFO ] Deduced a trap composed of 246 places in 282 ms of which 1 ms to minimize.
[2024-05-31 04:16:38] [INFO ] Deduced a trap composed of 237 places in 297 ms of which 1 ms to minimize.
[2024-05-31 04:16:38] [INFO ] Deduced a trap composed of 249 places in 311 ms of which 0 ms to minimize.
[2024-05-31 04:16:39] [INFO ] Deduced a trap composed of 246 places in 310 ms of which 1 ms to minimize.
[2024-05-31 04:16:39] [INFO ] Deduced a trap composed of 255 places in 297 ms of which 1 ms to minimize.
[2024-05-31 04:16:39] [INFO ] Deduced a trap composed of 252 places in 302 ms of which 1 ms to minimize.
[2024-05-31 04:16:40] [INFO ] Deduced a trap composed of 249 places in 273 ms of which 1 ms to minimize.
[2024-05-31 04:16:40] [INFO ] Deduced a trap composed of 255 places in 287 ms of which 1 ms to minimize.
[2024-05-31 04:16:40] [INFO ] Deduced a trap composed of 249 places in 278 ms of which 1 ms to minimize.
[2024-05-31 04:16:41] [INFO ] Deduced a trap composed of 246 places in 282 ms of which 1 ms to minimize.
[2024-05-31 04:16:41] [INFO ] Deduced a trap composed of 249 places in 275 ms of which 1 ms to minimize.
[2024-05-31 04:16:41] [INFO ] Deduced a trap composed of 243 places in 338 ms of which 1 ms to minimize.
[2024-05-31 04:16:42] [INFO ] Deduced a trap composed of 246 places in 356 ms of which 1 ms to minimize.
[2024-05-31 04:16:42] [INFO ] Deduced a trap composed of 249 places in 321 ms of which 1 ms to minimize.
[2024-05-31 04:16:43] [INFO ] Deduced a trap composed of 249 places in 349 ms of which 1 ms to minimize.
[2024-05-31 04:16:43] [INFO ] Deduced a trap composed of 246 places in 316 ms of which 1 ms to minimize.
[2024-05-31 04:16:44] [INFO ] Deduced a trap composed of 243 places in 327 ms of which 1 ms to minimize.
[2024-05-31 04:16:44] [INFO ] Deduced a trap composed of 246 places in 336 ms of which 0 ms to minimize.
[2024-05-31 04:16:45] [INFO ] Deduced a trap composed of 246 places in 352 ms of which 1 ms to minimize.
[2024-05-31 04:16:45] [INFO ] Deduced a trap composed of 249 places in 294 ms of which 1 ms to minimize.
[2024-05-31 04:16:45] [INFO ] Deduced a trap composed of 252 places in 292 ms of which 1 ms to minimize.
[2024-05-31 04:16:46] [INFO ] Deduced a trap composed of 249 places in 355 ms of which 1 ms to minimize.
[2024-05-31 04:16:47] [INFO ] Deduced a trap composed of 243 places in 301 ms of which 0 ms to minimize.
[2024-05-31 04:16:48] [INFO ] Deduced a trap composed of 243 places in 285 ms of which 1 ms to minimize.
[2024-05-31 04:16:49] [INFO ] Deduced a trap composed of 243 places in 347 ms of which 0 ms to minimize.
[2024-05-31 04:16:50] [INFO ] Deduced a trap composed of 246 places in 249 ms of which 0 ms to minimize.
[2024-05-31 04:16:54] [INFO ] Deduced a trap composed of 246 places in 320 ms of which 1 ms to minimize.
[2024-05-31 04:16:55] [INFO ] Deduced a trap composed of 236 places in 272 ms of which 1 ms to minimize.
[2024-05-31 04:16:56] [INFO ] Deduced a trap composed of 231 places in 307 ms of which 1 ms to minimize.
[2024-05-31 04:16:56] [INFO ] Deduced a trap composed of 236 places in 346 ms of which 0 ms to minimize.
[2024-05-31 04:16:57] [INFO ] Deduced a trap composed of 246 places in 276 ms of which 1 ms to minimize.
[2024-05-31 04:16:57] [INFO ] Deduced a trap composed of 231 places in 313 ms of which 1 ms to minimize.
[2024-05-31 04:16:58] [INFO ] Deduced a trap composed of 249 places in 301 ms of which 1 ms to minimize.
[2024-05-31 04:16:58] [INFO ] Deduced a trap composed of 252 places in 317 ms of which 1 ms to minimize.
[2024-05-31 04:16:58] [INFO ] Deduced a trap composed of 246 places in 320 ms of which 0 ms to minimize.
[2024-05-31 04:16:59] [INFO ] Deduced a trap composed of 246 places in 313 ms of which 1 ms to minimize.
[2024-05-31 04:16:59] [INFO ] Deduced a trap composed of 246 places in 312 ms of which 1 ms to minimize.
[2024-05-31 04:17:00] [INFO ] Deduced a trap composed of 246 places in 306 ms of which 1 ms to minimize.
[2024-05-31 04:17:00] [INFO ] Deduced a trap composed of 243 places in 339 ms of which 0 ms to minimize.
[2024-05-31 04:17:00] [INFO ] Deduced a trap composed of 243 places in 312 ms of which 0 ms to minimize.
[2024-05-31 04:17:01] [INFO ] Deduced a trap composed of 249 places in 305 ms of which 1 ms to minimize.
[2024-05-31 04:17:03] [INFO ] Deduced a trap composed of 113 places in 346 ms of which 1 ms to minimize.
[2024-05-31 04:17:03] [INFO ] Deduced a trap composed of 252 places in 331 ms of which 1 ms to minimize.
[2024-05-31 04:17:04] [INFO ] Deduced a trap composed of 236 places in 347 ms of which 1 ms to minimize.
[2024-05-31 04:17:04] [INFO ] Deduced a trap composed of 252 places in 334 ms of which 0 ms to minimize.
[2024-05-31 04:17:05] [INFO ] Deduced a trap composed of 113 places in 314 ms of which 1 ms to minimize.
[2024-05-31 04:17:05] [INFO ] Deduced a trap composed of 207 places in 299 ms of which 1 ms to minimize.
[2024-05-31 04:17:05] [INFO ] Deduced a trap composed of 113 places in 308 ms of which 1 ms to minimize.
[2024-05-31 04:17:06] [INFO ] Deduced a trap composed of 243 places in 303 ms of which 0 ms to minimize.
[2024-05-31 04:17:06] [INFO ] Deduced a trap composed of 113 places in 319 ms of which 1 ms to minimize.
[2024-05-31 04:17:06] [INFO ] Deduced a trap composed of 207 places in 310 ms of which 1 ms to minimize.
[2024-05-31 04:17:07] [INFO ] Deduced a trap composed of 113 places in 297 ms of which 1 ms to minimize.
[2024-05-31 04:17:07] [INFO ] Deduced a trap composed of 249 places in 299 ms of which 1 ms to minimize.
[2024-05-31 04:17:07] [INFO ] Deduced a trap composed of 113 places in 301 ms of which 1 ms to minimize.
[2024-05-31 04:17:08] [INFO ] Deduced a trap composed of 249 places in 302 ms of which 1 ms to minimize.
[2024-05-31 04:17:08] [INFO ] Deduced a trap composed of 120 places in 293 ms of which 0 ms to minimize.
[2024-05-31 04:17:08] [INFO ] Deduced a trap composed of 255 places in 275 ms of which 1 ms to minimize.
[2024-05-31 04:17:09] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 1 ms to minimize.
[2024-05-31 04:17:09] [INFO ] Deduced a trap composed of 120 places in 331 ms of which 1 ms to minimize.
[2024-05-31 04:17:10] [INFO ] Deduced a trap composed of 120 places in 299 ms of which 1 ms to minimize.
[2024-05-31 04:17:10] [INFO ] Deduced a trap composed of 237 places in 316 ms of which 0 ms to minimize.
[2024-05-31 04:17:10] [INFO ] Deduced a trap composed of 183 places in 300 ms of which 1 ms to minimize.
[2024-05-31 04:17:11] [INFO ] Deduced a trap composed of 255 places in 318 ms of which 1 ms to minimize.
[2024-05-31 04:17:11] [INFO ] Deduced a trap composed of 249 places in 314 ms of which 1 ms to minimize.
[2024-05-31 04:17:12] [INFO ] Deduced a trap composed of 249 places in 307 ms of which 0 ms to minimize.
[2024-05-31 04:17:12] [INFO ] Deduced a trap composed of 240 places in 297 ms of which 0 ms to minimize.
[2024-05-31 04:17:12] [INFO ] Deduced a trap composed of 252 places in 278 ms of which 0 ms to minimize.
[2024-05-31 04:17:13] [INFO ] Deduced a trap composed of 246 places in 306 ms of which 1 ms to minimize.
[2024-05-31 04:17:13] [INFO ] Deduced a trap composed of 249 places in 326 ms of which 1 ms to minimize.
[2024-05-31 04:17:13] [INFO ] Deduced a trap composed of 183 places in 240 ms of which 1 ms to minimize.
[2024-05-31 04:17:14] [INFO ] Deduced a trap composed of 177 places in 288 ms of which 0 ms to minimize.
[2024-05-31 04:17:14] [INFO ] Deduced a trap composed of 206 places in 297 ms of which 1 ms to minimize.
[2024-05-31 04:17:14] [INFO ] Deduced a trap composed of 255 places in 300 ms of which 1 ms to minimize.
[2024-05-31 04:17:15] [INFO ] Deduced a trap composed of 261 places in 316 ms of which 1 ms to minimize.
[2024-05-31 04:17:15] [INFO ] Deduced a trap composed of 189 places in 309 ms of which 1 ms to minimize.
[2024-05-31 04:17:16] [INFO ] Deduced a trap composed of 237 places in 332 ms of which 1 ms to minimize.
[2024-05-31 04:17:16] [INFO ] Deduced a trap composed of 237 places in 329 ms of which 0 ms to minimize.
[2024-05-31 04:17:16] [INFO ] Deduced a trap composed of 243 places in 359 ms of which 1 ms to minimize.
[2024-05-31 04:17:17] [INFO ] Deduced a trap composed of 171 places in 342 ms of which 0 ms to minimize.
[2024-05-31 04:17:17] [INFO ] Deduced a trap composed of 189 places in 338 ms of which 0 ms to minimize.
[2024-05-31 04:17:18] [INFO ] Deduced a trap composed of 201 places in 332 ms of which 1 ms to minimize.
[2024-05-31 04:17:18] [INFO ] Deduced a trap composed of 243 places in 331 ms of which 1 ms to minimize.
[2024-05-31 04:17:18] [INFO ] Deduced a trap composed of 216 places in 319 ms of which 1 ms to minimize.
[2024-05-31 04:17:19] [INFO ] Deduced a trap composed of 234 places in 355 ms of which 0 ms to minimize.
[2024-05-31 04:17:19] [INFO ] Deduced a trap composed of 177 places in 277 ms of which 1 ms to minimize.
[2024-05-31 04:17:20] [INFO ] Deduced a trap composed of 243 places in 250 ms of which 1 ms to minimize.
[2024-05-31 04:17:20] [INFO ] Deduced a trap composed of 246 places in 275 ms of which 0 ms to minimize.
[2024-05-31 04:17:20] [INFO ] Deduced a trap composed of 264 places in 287 ms of which 0 ms to minimize.
[2024-05-31 04:17:21] [INFO ] Deduced a trap composed of 249 places in 260 ms of which 1 ms to minimize.
[2024-05-31 04:17:21] [INFO ] Deduced a trap composed of 255 places in 342 ms of which 1 ms to minimize.
[2024-05-31 04:17:21] [INFO ] Deduced a trap composed of 207 places in 327 ms of which 1 ms to minimize.
[2024-05-31 04:17:24] [INFO ] Deduced a trap composed of 249 places in 292 ms of which 0 ms to minimize.
[2024-05-31 04:17:33] [INFO ] Trap strengthening (SAT) tested/added 122/122 trap constraints in 66135 ms
[2024-05-31 04:17:33] [INFO ] After 67028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 04:17:33] [INFO ] After 67171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 34 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 33 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2024-05-31 04:17:33] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2024-05-31 04:17:33] [INFO ] Computed 82 invariants in 22 ms
[2024-05-31 04:17:34] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
[2024-05-31 04:17:34] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:17:34] [INFO ] Invariant cache hit.
[2024-05-31 04:17:34] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-31 04:17:34] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:17:34] [INFO ] Invariant cache hit.
[2024-05-31 04:17:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:17:36] [INFO ] Implicit Places using invariants and state equation in 2099 ms returned []
Implicit Place search using SMT with State Equation took 2490 ms to find 0 implicit places.
[2024-05-31 04:17:36] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-31 04:17:36] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:17:36] [INFO ] Invariant cache hit.
[2024-05-31 04:17:37] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3800 ms. Remains : 582/582 places, 1253/1253 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 687 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 04:17:37] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:17:37] [INFO ] Invariant cache hit.
[2024-05-31 04:17:38] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:17:38] [INFO ] [Nat]Absence check using 75 positive place invariants in 19 ms returned sat
[2024-05-31 04:17:38] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-31 04:17:40] [INFO ] After 1918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 04:17:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:17:40] [INFO ] After 236ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 04:17:40] [INFO ] Deduced a trap composed of 254 places in 390 ms of which 0 ms to minimize.
[2024-05-31 04:17:41] [INFO ] Deduced a trap composed of 237 places in 398 ms of which 1 ms to minimize.
[2024-05-31 04:17:41] [INFO ] Deduced a trap composed of 251 places in 412 ms of which 1 ms to minimize.
[2024-05-31 04:17:42] [INFO ] Deduced a trap composed of 247 places in 415 ms of which 0 ms to minimize.
[2024-05-31 04:17:42] [INFO ] Deduced a trap composed of 223 places in 353 ms of which 0 ms to minimize.
[2024-05-31 04:17:43] [INFO ] Deduced a trap composed of 266 places in 355 ms of which 1 ms to minimize.
[2024-05-31 04:17:43] [INFO ] Deduced a trap composed of 254 places in 296 ms of which 14 ms to minimize.
[2024-05-31 04:17:44] [INFO ] Deduced a trap composed of 263 places in 293 ms of which 0 ms to minimize.
[2024-05-31 04:17:44] [INFO ] Deduced a trap composed of 248 places in 369 ms of which 0 ms to minimize.
[2024-05-31 04:17:45] [INFO ] Deduced a trap composed of 246 places in 350 ms of which 1 ms to minimize.
[2024-05-31 04:17:46] [INFO ] Deduced a trap composed of 260 places in 394 ms of which 0 ms to minimize.
[2024-05-31 04:17:47] [INFO ] Deduced a trap composed of 257 places in 414 ms of which 0 ms to minimize.
[2024-05-31 04:17:56] [INFO ] Trap strengthening (SAT) tested/added 12/12 trap constraints in 15846 ms
[2024-05-31 04:17:56] [INFO ] After 16131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 04:17:56] [INFO ] After 18199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 34 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 40 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2024-05-31 04:17:56] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:17:56] [INFO ] Invariant cache hit.
[2024-05-31 04:17:56] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 672 ms. Remains : 582/582 places, 1253/1253 transitions.
Incomplete random walk after 10000 steps, including 680 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 334656 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 334656 steps, saw 99647 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 04:18:00] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:18:00] [INFO ] Invariant cache hit.
[2024-05-31 04:18:00] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:18:00] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2024-05-31 04:18:00] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2024-05-31 04:18:02] [INFO ] After 1792ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 04:18:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:18:02] [INFO ] After 379ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 04:18:02] [INFO ] Deduced a trap composed of 254 places in 318 ms of which 0 ms to minimize.
[2024-05-31 04:18:03] [INFO ] Deduced a trap composed of 237 places in 386 ms of which 0 ms to minimize.
[2024-05-31 04:18:03] [INFO ] Deduced a trap composed of 251 places in 354 ms of which 0 ms to minimize.
[2024-05-31 04:18:04] [INFO ] Deduced a trap composed of 247 places in 352 ms of which 0 ms to minimize.
[2024-05-31 04:18:04] [INFO ] Deduced a trap composed of 223 places in 356 ms of which 0 ms to minimize.
[2024-05-31 04:18:05] [INFO ] Deduced a trap composed of 266 places in 359 ms of which 1 ms to minimize.
[2024-05-31 04:18:05] [INFO ] Deduced a trap composed of 254 places in 322 ms of which 0 ms to minimize.
[2024-05-31 04:18:06] [INFO ] Deduced a trap composed of 263 places in 323 ms of which 1 ms to minimize.
[2024-05-31 04:18:06] [INFO ] Deduced a trap composed of 248 places in 355 ms of which 1 ms to minimize.
[2024-05-31 04:18:07] [INFO ] Deduced a trap composed of 246 places in 395 ms of which 0 ms to minimize.
[2024-05-31 04:18:08] [INFO ] Deduced a trap composed of 260 places in 375 ms of which 1 ms to minimize.
[2024-05-31 04:18:09] [INFO ] Deduced a trap composed of 257 places in 357 ms of which 1 ms to minimize.
[2024-05-31 04:18:18] [INFO ] Trap strengthening (SAT) tested/added 12/12 trap constraints in 16111 ms
[2024-05-31 04:18:18] [INFO ] After 16552ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 04:18:18] [INFO ] After 18463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 34 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 36 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 582/582 places, 1253/1253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 29 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2024-05-31 04:18:18] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:18:18] [INFO ] Invariant cache hit.
[2024-05-31 04:18:19] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-05-31 04:18:19] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:18:19] [INFO ] Invariant cache hit.
[2024-05-31 04:18:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:18:21] [INFO ] Implicit Places using invariants and state equation in 2337 ms returned []
Implicit Place search using SMT with State Equation took 2868 ms to find 0 implicit places.
[2024-05-31 04:18:21] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-31 04:18:21] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:18:21] [INFO ] Invariant cache hit.
[2024-05-31 04:18:22] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3558 ms. Remains : 582/582 places, 1253/1253 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 582 transition count 1244
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 582 transition count 1243
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 581 transition count 1243
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 581 transition count 1242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 580 transition count 1242
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 580 transition count 1232
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 570 transition count 1232
Applied a total of 33 rules in 94 ms. Remains 570 /582 variables (removed 12) and now considering 1232/1253 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1232 rows 570 cols
[2024-05-31 04:18:22] [INFO ] Computed 82 invariants in 16 ms
[2024-05-31 04:18:22] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 04:18:22] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2024-05-31 04:18:22] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-31 04:18:23] [INFO ] After 537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 04:18:23] [INFO ] Deduced a trap composed of 226 places in 285 ms of which 1 ms to minimize.
[2024-05-31 04:18:23] [INFO ] Deduced a trap composed of 246 places in 272 ms of which 1 ms to minimize.
[2024-05-31 04:18:24] [INFO ] Deduced a trap composed of 216 places in 268 ms of which 1 ms to minimize.
[2024-05-31 04:18:24] [INFO ] Deduced a trap composed of 221 places in 275 ms of which 1 ms to minimize.
[2024-05-31 04:18:24] [INFO ] Deduced a trap composed of 226 places in 250 ms of which 1 ms to minimize.
[2024-05-31 04:18:25] [INFO ] Deduced a trap composed of 221 places in 274 ms of which 0 ms to minimize.
[2024-05-31 04:18:25] [INFO ] Deduced a trap composed of 231 places in 317 ms of which 0 ms to minimize.
[2024-05-31 04:18:26] [INFO ] Deduced a trap composed of 226 places in 339 ms of which 1 ms to minimize.
[2024-05-31 04:18:26] [INFO ] Deduced a trap composed of 240 places in 304 ms of which 1 ms to minimize.
[2024-05-31 04:18:26] [INFO ] Deduced a trap composed of 243 places in 288 ms of which 1 ms to minimize.
[2024-05-31 04:18:27] [INFO ] Deduced a trap composed of 240 places in 277 ms of which 1 ms to minimize.
[2024-05-31 04:18:27] [INFO ] Deduced a trap composed of 246 places in 267 ms of which 0 ms to minimize.
[2024-05-31 04:18:27] [INFO ] Deduced a trap composed of 243 places in 331 ms of which 0 ms to minimize.
[2024-05-31 04:18:28] [INFO ] Deduced a trap composed of 246 places in 290 ms of which 0 ms to minimize.
[2024-05-31 04:18:28] [INFO ] Deduced a trap composed of 237 places in 332 ms of which 1 ms to minimize.
[2024-05-31 04:18:29] [INFO ] Deduced a trap composed of 243 places in 311 ms of which 1 ms to minimize.
[2024-05-31 04:18:29] [INFO ] Deduced a trap composed of 243 places in 360 ms of which 1 ms to minimize.
[2024-05-31 04:18:29] [INFO ] Deduced a trap composed of 240 places in 303 ms of which 1 ms to minimize.
[2024-05-31 04:18:30] [INFO ] Deduced a trap composed of 243 places in 303 ms of which 1 ms to minimize.
[2024-05-31 04:18:30] [INFO ] Deduced a trap composed of 240 places in 330 ms of which 1 ms to minimize.
[2024-05-31 04:18:30] [INFO ] Deduced a trap composed of 246 places in 327 ms of which 0 ms to minimize.
[2024-05-31 04:18:31] [INFO ] Deduced a trap composed of 243 places in 319 ms of which 0 ms to minimize.
[2024-05-31 04:18:31] [INFO ] Deduced a trap composed of 243 places in 321 ms of which 1 ms to minimize.
[2024-05-31 04:18:32] [INFO ] Deduced a trap composed of 243 places in 352 ms of which 0 ms to minimize.
[2024-05-31 04:18:32] [INFO ] Deduced a trap composed of 246 places in 334 ms of which 1 ms to minimize.
[2024-05-31 04:18:32] [INFO ] Deduced a trap composed of 243 places in 302 ms of which 1 ms to minimize.
[2024-05-31 04:18:33] [INFO ] Deduced a trap composed of 246 places in 344 ms of which 0 ms to minimize.
[2024-05-31 04:18:33] [INFO ] Deduced a trap composed of 249 places in 349 ms of which 1 ms to minimize.
[2024-05-31 04:18:34] [INFO ] Deduced a trap composed of 249 places in 333 ms of which 0 ms to minimize.
[2024-05-31 04:18:34] [INFO ] Deduced a trap composed of 246 places in 338 ms of which 1 ms to minimize.
[2024-05-31 04:18:34] [INFO ] Deduced a trap composed of 246 places in 338 ms of which 0 ms to minimize.
[2024-05-31 04:18:35] [INFO ] Deduced a trap composed of 237 places in 339 ms of which 0 ms to minimize.
[2024-05-31 04:18:35] [INFO ] Deduced a trap composed of 249 places in 334 ms of which 0 ms to minimize.
[2024-05-31 04:18:36] [INFO ] Deduced a trap composed of 246 places in 340 ms of which 0 ms to minimize.
[2024-05-31 04:18:36] [INFO ] Deduced a trap composed of 255 places in 327 ms of which 1 ms to minimize.
[2024-05-31 04:18:36] [INFO ] Deduced a trap composed of 252 places in 327 ms of which 1 ms to minimize.
[2024-05-31 04:18:37] [INFO ] Deduced a trap composed of 249 places in 305 ms of which 1 ms to minimize.
[2024-05-31 04:18:37] [INFO ] Deduced a trap composed of 255 places in 349 ms of which 1 ms to minimize.
[2024-05-31 04:18:38] [INFO ] Deduced a trap composed of 249 places in 294 ms of which 1 ms to minimize.
[2024-05-31 04:18:38] [INFO ] Deduced a trap composed of 246 places in 288 ms of which 1 ms to minimize.
[2024-05-31 04:18:38] [INFO ] Deduced a trap composed of 249 places in 275 ms of which 0 ms to minimize.
[2024-05-31 04:18:39] [INFO ] Deduced a trap composed of 243 places in 290 ms of which 1 ms to minimize.
[2024-05-31 04:18:39] [INFO ] Deduced a trap composed of 246 places in 271 ms of which 1 ms to minimize.
[2024-05-31 04:18:40] [INFO ] Deduced a trap composed of 249 places in 348 ms of which 1 ms to minimize.
[2024-05-31 04:18:40] [INFO ] Deduced a trap composed of 249 places in 311 ms of which 1 ms to minimize.
[2024-05-31 04:18:41] [INFO ] Deduced a trap composed of 246 places in 335 ms of which 0 ms to minimize.
[2024-05-31 04:18:41] [INFO ] Deduced a trap composed of 243 places in 271 ms of which 1 ms to minimize.
[2024-05-31 04:18:41] [INFO ] Deduced a trap composed of 246 places in 289 ms of which 1 ms to minimize.
[2024-05-31 04:18:42] [INFO ] Deduced a trap composed of 246 places in 335 ms of which 1 ms to minimize.
[2024-05-31 04:18:42] [INFO ] Deduced a trap composed of 249 places in 349 ms of which 1 ms to minimize.
[2024-05-31 04:18:43] [INFO ] Deduced a trap composed of 252 places in 351 ms of which 1 ms to minimize.
[2024-05-31 04:18:43] [INFO ] Deduced a trap composed of 249 places in 344 ms of which 1 ms to minimize.
[2024-05-31 04:18:44] [INFO ] Deduced a trap composed of 243 places in 338 ms of which 1 ms to minimize.
[2024-05-31 04:18:46] [INFO ] Deduced a trap composed of 243 places in 291 ms of which 1 ms to minimize.
[2024-05-31 04:18:46] [INFO ] Deduced a trap composed of 243 places in 311 ms of which 1 ms to minimize.
[2024-05-31 04:18:48] [INFO ] Deduced a trap composed of 246 places in 356 ms of which 1 ms to minimize.
[2024-05-31 04:18:52] [INFO ] Deduced a trap composed of 246 places in 314 ms of which 0 ms to minimize.
[2024-05-31 04:18:54] [INFO ] Deduced a trap composed of 236 places in 265 ms of which 0 ms to minimize.
[2024-05-31 04:18:54] [INFO ] Deduced a trap composed of 231 places in 324 ms of which 1 ms to minimize.
[2024-05-31 04:18:55] [INFO ] Deduced a trap composed of 236 places in 305 ms of which 0 ms to minimize.
[2024-05-31 04:18:55] [INFO ] Deduced a trap composed of 246 places in 308 ms of which 1 ms to minimize.
[2024-05-31 04:18:55] [INFO ] Deduced a trap composed of 231 places in 275 ms of which 0 ms to minimize.
[2024-05-31 04:18:56] [INFO ] Deduced a trap composed of 249 places in 290 ms of which 1 ms to minimize.
[2024-05-31 04:18:56] [INFO ] Deduced a trap composed of 252 places in 273 ms of which 1 ms to minimize.
[2024-05-31 04:18:57] [INFO ] Deduced a trap composed of 246 places in 246 ms of which 1 ms to minimize.
[2024-05-31 04:18:57] [INFO ] Deduced a trap composed of 246 places in 275 ms of which 0 ms to minimize.
[2024-05-31 04:18:57] [INFO ] Deduced a trap composed of 246 places in 215 ms of which 1 ms to minimize.
[2024-05-31 04:18:58] [INFO ] Deduced a trap composed of 246 places in 210 ms of which 1 ms to minimize.
[2024-05-31 04:18:58] [INFO ] Deduced a trap composed of 243 places in 220 ms of which 1 ms to minimize.
[2024-05-31 04:18:58] [INFO ] Deduced a trap composed of 243 places in 215 ms of which 1 ms to minimize.
[2024-05-31 04:18:58] [INFO ] Deduced a trap composed of 249 places in 205 ms of which 1 ms to minimize.
[2024-05-31 04:19:00] [INFO ] Deduced a trap composed of 113 places in 268 ms of which 0 ms to minimize.
[2024-05-31 04:19:00] [INFO ] Deduced a trap composed of 252 places in 307 ms of which 1 ms to minimize.
[2024-05-31 04:19:01] [INFO ] Deduced a trap composed of 236 places in 288 ms of which 1 ms to minimize.
[2024-05-31 04:19:01] [INFO ] Deduced a trap composed of 252 places in 338 ms of which 0 ms to minimize.
[2024-05-31 04:19:02] [INFO ] Deduced a trap composed of 113 places in 345 ms of which 1 ms to minimize.
[2024-05-31 04:19:02] [INFO ] Deduced a trap composed of 207 places in 343 ms of which 1 ms to minimize.
[2024-05-31 04:19:03] [INFO ] Deduced a trap composed of 113 places in 351 ms of which 1 ms to minimize.
[2024-05-31 04:19:03] [INFO ] Deduced a trap composed of 243 places in 324 ms of which 1 ms to minimize.
[2024-05-31 04:19:04] [INFO ] Deduced a trap composed of 113 places in 349 ms of which 1 ms to minimize.
[2024-05-31 04:19:04] [INFO ] Deduced a trap composed of 207 places in 329 ms of which 0 ms to minimize.
[2024-05-31 04:19:04] [INFO ] Deduced a trap composed of 113 places in 342 ms of which 1 ms to minimize.
[2024-05-31 04:19:05] [INFO ] Deduced a trap composed of 249 places in 329 ms of which 1 ms to minimize.
[2024-05-31 04:19:05] [INFO ] Deduced a trap composed of 113 places in 308 ms of which 1 ms to minimize.
[2024-05-31 04:19:06] [INFO ] Deduced a trap composed of 249 places in 310 ms of which 1 ms to minimize.
[2024-05-31 04:19:06] [INFO ] Deduced a trap composed of 120 places in 329 ms of which 1 ms to minimize.
[2024-05-31 04:19:06] [INFO ] Deduced a trap composed of 255 places in 337 ms of which 1 ms to minimize.
[2024-05-31 04:19:07] [INFO ] Deduced a trap composed of 234 places in 346 ms of which 0 ms to minimize.
[2024-05-31 04:19:07] [INFO ] Deduced a trap composed of 120 places in 348 ms of which 0 ms to minimize.
[2024-05-31 04:19:08] [INFO ] Deduced a trap composed of 120 places in 354 ms of which 1 ms to minimize.
[2024-05-31 04:19:08] [INFO ] Deduced a trap composed of 237 places in 331 ms of which 1 ms to minimize.
[2024-05-31 04:19:09] [INFO ] Deduced a trap composed of 183 places in 336 ms of which 1 ms to minimize.
[2024-05-31 04:19:09] [INFO ] Deduced a trap composed of 255 places in 351 ms of which 1 ms to minimize.
[2024-05-31 04:19:09] [INFO ] Deduced a trap composed of 249 places in 317 ms of which 1 ms to minimize.
[2024-05-31 04:19:10] [INFO ] Deduced a trap composed of 249 places in 374 ms of which 1 ms to minimize.
[2024-05-31 04:19:10] [INFO ] Deduced a trap composed of 240 places in 333 ms of which 1 ms to minimize.
[2024-05-31 04:19:11] [INFO ] Deduced a trap composed of 252 places in 312 ms of which 1 ms to minimize.
[2024-05-31 04:19:11] [INFO ] Deduced a trap composed of 246 places in 355 ms of which 1 ms to minimize.
[2024-05-31 04:19:12] [INFO ] Deduced a trap composed of 249 places in 305 ms of which 0 ms to minimize.
[2024-05-31 04:19:12] [INFO ] Deduced a trap composed of 183 places in 315 ms of which 0 ms to minimize.
[2024-05-31 04:19:12] [INFO ] Deduced a trap composed of 177 places in 301 ms of which 1 ms to minimize.
[2024-05-31 04:19:13] [INFO ] Deduced a trap composed of 206 places in 296 ms of which 0 ms to minimize.
[2024-05-31 04:19:13] [INFO ] Deduced a trap composed of 255 places in 321 ms of which 0 ms to minimize.
[2024-05-31 04:19:14] [INFO ] Deduced a trap composed of 261 places in 319 ms of which 1 ms to minimize.
[2024-05-31 04:19:14] [INFO ] Deduced a trap composed of 189 places in 304 ms of which 1 ms to minimize.
[2024-05-31 04:19:14] [INFO ] Deduced a trap composed of 237 places in 327 ms of which 3 ms to minimize.
[2024-05-31 04:19:15] [INFO ] Deduced a trap composed of 237 places in 322 ms of which 1 ms to minimize.
[2024-05-31 04:19:15] [INFO ] Deduced a trap composed of 243 places in 324 ms of which 1 ms to minimize.
[2024-05-31 04:19:16] [INFO ] Deduced a trap composed of 171 places in 332 ms of which 1 ms to minimize.
[2024-05-31 04:19:16] [INFO ] Deduced a trap composed of 189 places in 356 ms of which 1 ms to minimize.
[2024-05-31 04:19:16] [INFO ] Deduced a trap composed of 201 places in 333 ms of which 1 ms to minimize.
[2024-05-31 04:19:17] [INFO ] Deduced a trap composed of 243 places in 354 ms of which 1 ms to minimize.
[2024-05-31 04:19:17] [INFO ] Deduced a trap composed of 216 places in 338 ms of which 1 ms to minimize.
[2024-05-31 04:19:18] [INFO ] Deduced a trap composed of 234 places in 353 ms of which 1 ms to minimize.
[2024-05-31 04:19:18] [INFO ] Deduced a trap composed of 177 places in 343 ms of which 1 ms to minimize.
[2024-05-31 04:19:19] [INFO ] Deduced a trap composed of 243 places in 340 ms of which 0 ms to minimize.
[2024-05-31 04:19:19] [INFO ] Deduced a trap composed of 246 places in 340 ms of which 1 ms to minimize.
[2024-05-31 04:19:19] [INFO ] Deduced a trap composed of 264 places in 338 ms of which 1 ms to minimize.
[2024-05-31 04:19:20] [INFO ] Deduced a trap composed of 249 places in 358 ms of which 1 ms to minimize.
[2024-05-31 04:19:20] [INFO ] Deduced a trap composed of 255 places in 336 ms of which 0 ms to minimize.
[2024-05-31 04:19:21] [INFO ] Deduced a trap composed of 207 places in 347 ms of which 1 ms to minimize.
[2024-05-31 04:19:23] [INFO ] Deduced a trap composed of 249 places in 244 ms of which 1 ms to minimize.
[2024-05-31 04:19:32] [INFO ] Trap strengthening (SAT) tested/added 122/122 trap constraints in 69213 ms
[2024-05-31 04:19:33] [INFO ] After 70639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 04:19:33] [INFO ] After 70753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6927 reset in 1129 ms.
Product exploration explored 100000 steps with 6925 reset in 1062 ms.
Built C files in :
/tmp/ltsmin11566233815796675406
[2024-05-31 04:19:35] [INFO ] Computing symmetric may disable matrix : 1253 transitions.
[2024-05-31 04:19:36] [INFO ] Computation of Complete disable matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 04:19:36] [INFO ] Computing symmetric may enable matrix : 1253 transitions.
[2024-05-31 04:19:36] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 04:19:36] [INFO ] Computing Do-Not-Accords matrix : 1253 transitions.
[2024-05-31 04:19:36] [INFO ] Computation of Completed DNA matrix. took 60 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 04:19:36] [INFO ] Built C files in 458ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11566233815796675406
Running compilation step : cd /tmp/ltsmin11566233815796675406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11566233815796675406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11566233815796675406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 34 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 35 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2024-05-31 04:19:39] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2024-05-31 04:19:39] [INFO ] Computed 82 invariants in 18 ms
[2024-05-31 04:19:40] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
[2024-05-31 04:19:40] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:19:40] [INFO ] Invariant cache hit.
[2024-05-31 04:19:40] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-05-31 04:19:40] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:19:40] [INFO ] Invariant cache hit.
[2024-05-31 04:19:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:19:43] [INFO ] Implicit Places using invariants and state equation in 2478 ms returned []
Implicit Place search using SMT with State Equation took 3023 ms to find 0 implicit places.
[2024-05-31 04:19:43] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-31 04:19:43] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 04:19:43] [INFO ] Invariant cache hit.
[2024-05-31 04:19:43] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4373 ms. Remains : 582/582 places, 1253/1253 transitions.
Built C files in :
/tmp/ltsmin7284658345719127010
[2024-05-31 04:19:43] [INFO ] Computing symmetric may disable matrix : 1253 transitions.
[2024-05-31 04:19:43] [INFO ] Computation of Complete disable matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 04:19:43] [INFO ] Computing symmetric may enable matrix : 1253 transitions.
[2024-05-31 04:19:43] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 04:19:44] [INFO ] Computing Do-Not-Accords matrix : 1253 transitions.
[2024-05-31 04:19:44] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 04:19:44] [INFO ] Built C files in 337ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7284658345719127010
Running compilation step : cd /tmp/ltsmin7284658345719127010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7284658345719127010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7284658345719127010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-31 04:19:47] [INFO ] Flatten gal took : 69 ms
[2024-05-31 04:19:47] [INFO ] Flatten gal took : 71 ms
[2024-05-31 04:19:47] [INFO ] Time to serialize gal into /tmp/LTL14488991089668208413.gal : 12 ms
[2024-05-31 04:19:47] [INFO ] Time to serialize properties into /tmp/LTL10982310240243413665.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14488991089668208413.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5165407142819052513.hoa' '-atoms' '/tmp/LTL10982310240243413665.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10982310240243413665.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5165407142819052513.hoa
Detected timeout of ITS tools.
[2024-05-31 04:20:02] [INFO ] Flatten gal took : 98 ms
[2024-05-31 04:20:02] [INFO ] Flatten gal took : 98 ms
[2024-05-31 04:20:02] [INFO ] Time to serialize gal into /tmp/LTL13997139092942916602.gal : 10 ms
[2024-05-31 04:20:02] [INFO ] Time to serialize properties into /tmp/LTL9948407551661561286.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13997139092942916602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9948407551661561286.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((f1_0+f1_1)+(f1_2+f1_3))+((f1_4+f1_5)+(f1_6+f1_7)))+(((f1_8+f1_9)+(f1_10+f1_11))+((f1_12+f1_13)+(f1_14+f1_15))))+((((f1_1...332
Formula 0 simplified : G!"(((((((f1_0+f1_1)+(f1_2+f1_3))+((f1_4+f1_5)+(f1_6+f1_7)))+(((f1_8+f1_9)+(f1_10+f1_11))+((f1_12+f1_13)+(f1_14+f1_15))))+((((f1_16+...324
Detected timeout of ITS tools.
[2024-05-31 04:20:18] [INFO ] Flatten gal took : 90 ms
[2024-05-31 04:20:18] [INFO ] Applying decomposition
[2024-05-31 04:20:18] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11287722251272852212.txt' '-o' '/tmp/graph11287722251272852212.bin' '-w' '/tmp/graph11287722251272852212.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11287722251272852212.bin' '-l' '-1' '-v' '-w' '/tmp/graph11287722251272852212.weights' '-q' '0' '-e' '0.001'
[2024-05-31 04:20:18] [INFO ] Decomposing Gal with order
[2024-05-31 04:20:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 04:20:19] [INFO ] Removed a total of 489 redundant transitions.
[2024-05-31 04:20:19] [INFO ] Flatten gal took : 506 ms
[2024-05-31 04:20:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 190 labels/synchronizations in 22 ms.
[2024-05-31 04:20:19] [INFO ] Time to serialize gal into /tmp/LTL2425425075098378610.gal : 18 ms
[2024-05-31 04:20:19] [INFO ] Time to serialize properties into /tmp/LTL2879877613487116660.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2425425075098378610.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2879877613487116660.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((gu1.f1_0+gu1.f1_1)+(gu1.f1_2+gu1.f1_3))+((gu1.f1_4+gu1.f1_5)+(gu1.f1_6+gu1.f1_7)))+(((gu1.f1_8+gu1.f1_9)+(gu1.f1_10+gu1....487
Formula 0 simplified : G!"(((((((gu1.f1_0+gu1.f1_1)+(gu1.f1_2+gu1.f1_3))+((gu1.f1_4+gu1.f1_5)+(gu1.f1_6+gu1.f1_7)))+(((gu1.f1_8+gu1.f1_9)+(gu1.f1_10+gu1.f1...479
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13957248219724455608
[2024-05-31 04:20:34] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13957248219724455608
Running compilation step : cd /tmp/ltsmin13957248219724455608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2901 ms.
Running link step : cd /tmp/ltsmin13957248219724455608;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin13957248219724455608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-13 finished in 316182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1)) U G((p2||(G(p1) U X(X(G(p0))))))))'
Support contains 4 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 12 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2024-05-31 04:20:49] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2024-05-31 04:20:49] [INFO ] Computed 82 invariants in 30 ms
[2024-05-31 04:20:50] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
[2024-05-31 04:20:50] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:20:50] [INFO ] Invariant cache hit.
[2024-05-31 04:20:50] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-31 04:20:50] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:20:50] [INFO ] Invariant cache hit.
[2024-05-31 04:20:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:20:53] [INFO ] Implicit Places using invariants and state equation in 2646 ms returned []
Implicit Place search using SMT with State Equation took 3037 ms to find 0 implicit places.
[2024-05-31 04:20:53] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:20:53] [INFO ] Invariant cache hit.
[2024-05-31 04:20:54] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4545 ms. Remains : 653/653 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 1219 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0, 2} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1, 2} source=0 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={1, 2} source=0 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0, 1, 2} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 18}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(OR p1 p0), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1, 2} source=4 dest: 11}, { cond=(OR p1 p0), acceptance={0, 2} source=4 dest: 12}, { cond=(AND (NOT p2) p1), acceptance={1, 2} source=4 dest: 13}, { cond=(AND (NOT p2) p1), acceptance={0, 1, 2} source=4 dest: 14}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 10}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1, 2} source=5 dest: 11}, { cond=(AND (NOT p1) p0), acceptance={0, 2} source=5 dest: 12}, { cond=(AND (NOT p2) p1), acceptance={1, 2} source=5 dest: 13}, { cond=p1, acceptance={2} source=5 dest: 15}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=6 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0, 2} source=6 dest: 11}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1, 2} source=6 dest: 11}, { cond=(AND p2 p1), acceptance={2} source=6 dest: 13}, { cond=(AND (NOT p2) p1), acceptance={1, 2} source=6 dest: 13}, { cond=(AND p2 p1), acceptance={0, 2} source=6 dest: 14}, { cond=(AND (NOT p2) p1), acceptance={0, 1, 2} source=6 dest: 14}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 16}], [{ cond=p0, acceptance={} source=7 dest: 7}, { cond=(NOT p0), acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0, 1, 2} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 8}, { cond=p0, acceptance={} source=9 dest: 9}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 19}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=10 dest: 1}, { cond=(NOT p0), acceptance={} source=10 dest: 2}, { cond=p0, acceptance={} source=10 dest: 10}, { cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 18}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=11 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=11 dest: 11}, { cond=p0, acceptance={0} source=11 dest: 12}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=11 dest: 12}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=11 dest: 13}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1, 2} source=11 dest: 13}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=11 dest: 14}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1, 2} source=11 dest: 14}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 2} source=12 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=12 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=12 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=12 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1, 2} source=12 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1, 2} source=12 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=12 dest: 11}, { cond=p0, acceptance={0} source=12 dest: 12}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=12 dest: 13}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=12 dest: 14}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=13 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=13 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=13 dest: 10}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=13 dest: 11}, { cond=(AND (NOT p1) p0), acceptance={0} source=13 dest: 12}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=13 dest: 13}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1, 2} source=13 dest: 13}, { cond=(AND p1 p0), acceptance={} source=13 dest: 15}, { cond=(AND p1 (NOT p0)), acceptance={2} source=13 dest: 15}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=14 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=14 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=14 dest: 11}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=14 dest: 11}, { cond=(AND p2 p1 p0), acceptance={} source=14 dest: 13}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=14 dest: 13}, { cond=(AND p2 p1 (NOT p0)), acceptance={2} source=14 dest: 13}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1, 2} source=14 dest: 13}, { cond=(AND p2 p1 p0), acceptance={0} source=14 dest: 14}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=14 dest: 14}, { cond=(AND p2 p1 (NOT p0)), acceptance={0, 2} source=14 dest: 14}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1, 2} source=14 dest: 14}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=14 dest: 16}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=15 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=15 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=15 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1, 2} source=15 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=15 dest: 11}, { cond=(AND (NOT p1) p0), acceptance={0} source=15 dest: 12}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=15 dest: 13}, { cond=(AND p1 p0), acceptance={} source=15 dest: 15}, { cond=(AND p1 (NOT p0)), acceptance={2} source=15 dest: 21}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=16 dest: 1}, { cond=true, acceptance={} source=16 dest: 10}, { cond=(AND (NOT p2) p1), acceptance={} source=16 dest: 18}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=17 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=17 dest: 22}], [{ cond=(NOT p1), acceptance={} source=18 dest: 7}, { cond=p1, acceptance={} source=18 dest: 17}, { cond=(AND p1 p0), acceptance={0, 1} source=18 dest: 18}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=18 dest: 18}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=19 dest: 8}, { cond=(OR p1 p0), acceptance={} source=19 dest: 19}, { cond=(AND (NOT p1) p0), acceptance={} source=19 dest: 20}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=20 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=20 dest: 20}], [{ cond=(AND (NOT p1) p0), acceptance={0, 2} source=21 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=21 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=21 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=21 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1, 2} source=21 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={1, 2} source=21 dest: 5}, { cond=p1, acceptance={2} source=21 dest: 21}], [{ cond=(AND (NOT p1) p0), acceptance={} source=22 dest: 8}, { cond=(AND p1 p0), acceptance={} source=22 dest: 22}]], initial=0, aps=[p1:(LEQ s650 s582), p0:(LEQ s650 s32), p2:(LEQ 3 s535)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26926 steps with 1509 reset in 251 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-14 finished in 6105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((X(p1)&&F(p2))))))'
Support contains 33 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 17 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2024-05-31 04:20:55] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:20:55] [INFO ] Invariant cache hit.
[2024-05-31 04:20:56] [INFO ] Dead Transitions using invariants and state equation in 933 ms found 0 transitions.
[2024-05-31 04:20:56] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:20:56] [INFO ] Invariant cache hit.
[2024-05-31 04:20:57] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-05-31 04:20:57] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:20:57] [INFO ] Invariant cache hit.
[2024-05-31 04:20:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:20:59] [INFO ] Implicit Places using invariants and state equation in 2489 ms returned []
Implicit Place search using SMT with State Equation took 2927 ms to find 0 implicit places.
[2024-05-31 04:20:59] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 04:20:59] [INFO ] Invariant cache hit.
[2024-05-31 04:21:00] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4535 ms. Remains : 653/653 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 s0), p2:(LEQ s163 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31)), p1:...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-15 finished in 4776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
[2024-05-31 04:21:00] [INFO ] Flatten gal took : 121 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11682331055107377282
[2024-05-31 04:21:00] [INFO ] Computing symmetric may disable matrix : 1324 transitions.
[2024-05-31 04:21:01] [INFO ] Computation of Complete disable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 04:21:01] [INFO ] Applying decomposition
[2024-05-31 04:21:01] [INFO ] Computing symmetric may enable matrix : 1324 transitions.
[2024-05-31 04:21:01] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 04:21:01] [INFO ] Flatten gal took : 264 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5588433315641692471.txt' '-o' '/tmp/graph5588433315641692471.bin' '-w' '/tmp/graph5588433315641692471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5588433315641692471.bin' '-l' '-1' '-v' '-w' '/tmp/graph5588433315641692471.weights' '-q' '0' '-e' '0.001'
[2024-05-31 04:21:01] [INFO ] Decomposing Gal with order
[2024-05-31 04:21:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 04:21:01] [INFO ] Computing Do-Not-Accords matrix : 1324 transitions.
[2024-05-31 04:21:01] [INFO ] Computation of Completed DNA matrix. took 61 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 04:21:01] [INFO ] Built C files in 863ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11682331055107377282
Running compilation step : cd /tmp/ltsmin11682331055107377282;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-31 04:21:02] [INFO ] Removed a total of 2368 redundant transitions.
[2024-05-31 04:21:02] [INFO ] Flatten gal took : 441 ms
[2024-05-31 04:21:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 434 labels/synchronizations in 79 ms.
[2024-05-31 04:21:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality5565183140201380725.gal : 24 ms
[2024-05-31 04:21:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality5177394555046433090.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5565183140201380725.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5177394555046433090.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((gu11.f1_0+gu11.f1_1)+(gu11.f1_2+gu11.f1_3))+((gu11.f1_4+gu11.f1_5)+(gu11.f1_6+gu11.f1_7)))+(((gu11.f1_8+gu11.f1_9)+(gu11...526
Formula 0 simplified : G!"(((((((gu11.f1_0+gu11.f1_1)+(gu11.f1_2+gu11.f1_3))+((gu11.f1_4+gu11.f1_5)+(gu11.f1_6+gu11.f1_7)))+(((gu11.f1_8+gu11.f1_9)+(gu11.f...518
Compilation finished in 5811 ms.
Running link step : cd /tmp/ltsmin11682331055107377282;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 138 ms.
Running LTSmin : cd /tmp/ltsmin11682331055107377282;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp0==true))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-31 04:44:19] [INFO ] Applying decomposition
[2024-05-31 04:44:19] [INFO ] Flatten gal took : 218 ms
[2024-05-31 04:44:19] [INFO ] Decomposing Gal with order
[2024-05-31 04:44:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 04:44:20] [INFO ] Removed a total of 6716 redundant transitions.
[2024-05-31 04:44:21] [INFO ] Flatten gal took : 772 ms
[2024-05-31 04:44:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 73 ms.
[2024-05-31 04:44:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality11092454514364661758.gal : 51 ms
[2024-05-31 04:44:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality13207853441092985052.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11092454514364661758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13207853441092985052.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((gJobs0.f1_0+gJobs1.f1_1)+(gJobs2.f1_2+gJobs3.f1_3))+((gJobs4.f1_4+gJobs5.f1_5)+(gJobs6.f1_6+gJobs7.f1_7)))+(((gJobs8.f1_...607
Formula 0 simplified : G!"(((((((gJobs0.f1_0+gJobs1.f1_1)+(gJobs2.f1_2+gJobs3.f1_3))+((gJobs4.f1_4+gJobs5.f1_5)+(gJobs6.f1_6+gJobs7.f1_7)))+(((gJobs8.f1_8+...599
Detected timeout of ITS tools.
[2024-05-31 05:07:38] [INFO ] Flatten gal took : 182 ms
[2024-05-31 05:07:39] [INFO ] Input system was already deterministic with 1324 transitions.
[2024-05-31 05:07:39] [INFO ] Transformed 653 places.
[2024-05-31 05:07:39] [INFO ] Transformed 1324 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 05:08:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality16272581487555959020.gal : 73 ms
[2024-05-31 05:08:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality2742896729605316409.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16272581487555959020.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2742896729605316409.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("(((((((f1_0+f1_1)+(f1_2+f1_3))+((f1_4+f1_5)+(f1_6+f1_7)))+(((f1_8+f1_9)+(f1_10+f1_11))+((f1_12+f1_13)+(f1_14+f1_15))))+((((f1_1...332
Formula 0 simplified : G!"(((((((f1_0+f1_1)+(f1_2+f1_3))+((f1_4+f1_5)+(f1_6+f1_7)))+(((f1_8+f1_9)+(f1_10+f1_11))+((f1_12+f1_13)+(f1_14+f1_15))))+((((f1_16+...324
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 11980552 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16040668 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J30"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is PolyORBNT-COL-S10J30, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r307-tajo-171654460800257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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