About the Execution of ITS-Tools for PolyORBNT-COL-S10J30
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16213.292 | 3600000.00 | 11487106.00 | 318421.90 | ?FFFFTFF?FFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945800684.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBNT-COL-S10J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945800684
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.9K Feb 26 00:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 00:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 00:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 01:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678938280511
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J30
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-16 03:44:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 03:44:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 03:44:42] [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.
[2023-03-16 03:44:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 03:44:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 500 ms
[2023-03-16 03:44:42] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 03:44:42] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2023-03-16 03:44:42] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 573 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 18) seen :12
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-16 03:44:43] [INFO ] Computed 13 place invariants in 8 ms
[2023-03-16 03:44:43] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-16 03:44:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 03:44:43] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-16 03:44:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-16 03:44:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 03:44:43] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-16 03:44:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:44:43] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-16 03:44:43] [INFO ] Deduced a trap composed of 14 places in 311 ms of which 7 ms to minimize.
[2023-03-16 03:44:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2023-03-16 03:44:43] [INFO ] After 328ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-16 03:44:43] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 1 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
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 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 37 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 35 transition count 26
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 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 28
Applied a total of 27 rules in 22 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 34 cols
[2023-03-16 03:44:43] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-16 03:44:43] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10009 steps, including 739 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 302 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Probably explored full state space saw : 521 states, properties seen :0
Probabilistic random walk after 1393 steps, saw 521 distinct states, run finished after 17 ms. (steps per millisecond=81 ) properties seen :0
Explored full state space saw : 521 states, properties seen :0
Exhaustive walk after 1393 steps, saw 521 distinct states, run finished after 3 ms. (steps per millisecond=464 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2023-03-16 03:44:44] [INFO ] Flatten gal took : 19 ms
[2023-03-16 03:44:44] [INFO ] Flatten gal took : 7 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.
[2023-03-16 03:44:44] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 196 ms.
[2023-03-16 03:44:44] [INFO ] Unfolded 13 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
[2023-03-16 03:44:44] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-16 03:44:44] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-16 03:44:44] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-16 03:44:44] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-16 03:44:44] [INFO ] Reduced 780 identical enabling conditions.
Deduced a syphon composed of 30 places in 24 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 556 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Applied a total of 0 rules in 37 ms. Remains 664 /664 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
[2023-03-16 03:44:44] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-16 03:44:44] [INFO ] Computed 92 place invariants in 118 ms
[2023-03-16 03:44:45] [INFO ] Dead Transitions using invariants and state equation in 1169 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.
[2023-03-16 03:44:45] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 664 cols
[2023-03-16 03:44:45] [INFO ] Computed 92 place invariants in 49 ms
[2023-03-16 03:44:45] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-16 03:44:45] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-16 03:44:45] [INFO ] Invariant cache hit.
[2023-03-16 03:44:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:44:46] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/664 places, 1325/1940 transitions.
Applied a total of 0 rules in 12 ms. Remains 664 /664 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2167 ms. Remains : 664/664 places, 1325/1940 transitions.
Support contains 556 out of 664 places after structural reductions.
[2023-03-16 03:44:46] [INFO ] Flatten gal took : 187 ms
[2023-03-16 03:44:47] [INFO ] Flatten gal took : 135 ms
[2023-03-16 03:44:47] [INFO ] Input system was already deterministic with 1325 transitions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 649 ms. (steps per millisecond=15 ) properties (out of 21) seen :3
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 03:44:48] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-16 03:44:48] [INFO ] Invariant cache hit.
[2023-03-16 03:44:48] [INFO ] [Real]Absence check using 85 positive place invariants in 24 ms returned sat
[2023-03-16 03:44:48] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-16 03:44:49] [INFO ] After 758ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-16 03:44:49] [INFO ] [Nat]Absence check using 85 positive place invariants in 23 ms returned sat
[2023-03-16 03:44:49] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-16 03:44:49] [INFO ] After 506ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-16 03:44:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:44:49] [INFO ] After 151ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-16 03:44:50] [INFO ] Deduced a trap composed of 317 places in 312 ms of which 2 ms to minimize.
[2023-03-16 03:44:50] [INFO ] Deduced a trap composed of 313 places in 300 ms of which 1 ms to minimize.
[2023-03-16 03:44:50] [INFO ] Deduced a trap composed of 305 places in 287 ms of which 1 ms to minimize.
[2023-03-16 03:44:51] [INFO ] Deduced a trap composed of 313 places in 293 ms of which 1 ms to minimize.
[2023-03-16 03:44:51] [INFO ] Deduced a trap composed of 305 places in 288 ms of which 1 ms to minimize.
[2023-03-16 03:44:51] [INFO ] Deduced a trap composed of 299 places in 280 ms of which 0 ms to minimize.
[2023-03-16 03:44:52] [INFO ] Deduced a trap composed of 305 places in 285 ms of which 0 ms to minimize.
[2023-03-16 03:44:52] [INFO ] Deduced a trap composed of 305 places in 287 ms of which 1 ms to minimize.
[2023-03-16 03:44:53] [INFO ] Deduced a trap composed of 309 places in 286 ms of which 0 ms to minimize.
[2023-03-16 03:44:53] [INFO ] Deduced a trap composed of 311 places in 303 ms of which 0 ms to minimize.
[2023-03-16 03:44:53] [INFO ] Deduced a trap composed of 311 places in 304 ms of which 1 ms to minimize.
[2023-03-16 03:44:54] [INFO ] Deduced a trap composed of 313 places in 296 ms of which 1 ms to minimize.
[2023-03-16 03:44:54] [INFO ] Deduced a trap composed of 309 places in 284 ms of which 1 ms to minimize.
[2023-03-16 03:44:54] [INFO ] Deduced a trap composed of 311 places in 283 ms of which 0 ms to minimize.
[2023-03-16 03:44:55] [INFO ] Deduced a trap composed of 311 places in 296 ms of which 1 ms to minimize.
[2023-03-16 03:44:55] [INFO ] Deduced a trap composed of 301 places in 302 ms of which 1 ms to minimize.
[2023-03-16 03:44:56] [INFO ] Deduced a trap composed of 311 places in 283 ms of which 0 ms to minimize.
[2023-03-16 03:44:56] [INFO ] Deduced a trap composed of 309 places in 284 ms of which 0 ms to minimize.
[2023-03-16 03:44:56] [INFO ] Deduced a trap composed of 311 places in 305 ms of which 0 ms to minimize.
[2023-03-16 03:44:57] [INFO ] Deduced a trap composed of 313 places in 310 ms of which 0 ms to minimize.
[2023-03-16 03:44:57] [INFO ] Deduced a trap composed of 313 places in 302 ms of which 1 ms to minimize.
[2023-03-16 03:44:57] [INFO ] Deduced a trap composed of 309 places in 306 ms of which 3 ms to minimize.
[2023-03-16 03:44:58] [INFO ] Deduced a trap composed of 309 places in 302 ms of which 1 ms to minimize.
[2023-03-16 03:44:58] [INFO ] Deduced a trap composed of 299 places in 292 ms of which 1 ms to minimize.
[2023-03-16 03:45:00] [INFO ] Deduced a trap composed of 303 places in 282 ms of which 1 ms to minimize.
[2023-03-16 03:45:01] [INFO ] Deduced a trap composed of 303 places in 312 ms of which 0 ms to minimize.
[2023-03-16 03:45:01] [INFO ] Deduced a trap composed of 305 places in 314 ms of which 1 ms to minimize.
[2023-03-16 03:45:02] [INFO ] Deduced a trap composed of 305 places in 305 ms of which 1 ms to minimize.
[2023-03-16 03:45:02] [INFO ] Deduced a trap composed of 313 places in 305 ms of which 0 ms to minimize.
[2023-03-16 03:45:02] [INFO ] Deduced a trap composed of 311 places in 303 ms of which 1 ms to minimize.
[2023-03-16 03:45:03] [INFO ] Deduced a trap composed of 309 places in 284 ms of which 1 ms to minimize.
[2023-03-16 03:45:03] [INFO ] Deduced a trap composed of 317 places in 289 ms of which 1 ms to minimize.
[2023-03-16 03:45:03] [INFO ] Deduced a trap composed of 309 places in 304 ms of which 1 ms to minimize.
[2023-03-16 03:45:04] [INFO ] Deduced a trap composed of 309 places in 283 ms of which 0 ms to minimize.
[2023-03-16 03:45:05] [INFO ] Deduced a trap composed of 313 places in 303 ms of which 0 ms to minimize.
[2023-03-16 03:45:05] [INFO ] Deduced a trap composed of 315 places in 302 ms of which 1 ms to minimize.
[2023-03-16 03:45:05] [INFO ] Deduced a trap composed of 301 places in 308 ms of which 1 ms to minimize.
[2023-03-16 03:45:06] [INFO ] Deduced a trap composed of 309 places in 312 ms of which 2 ms to minimize.
[2023-03-16 03:45:06] [INFO ] Deduced a trap composed of 313 places in 307 ms of which 0 ms to minimize.
[2023-03-16 03:45:07] [INFO ] Deduced a trap composed of 305 places in 303 ms of which 1 ms to minimize.
[2023-03-16 03:45:07] [INFO ] Deduced a trap composed of 303 places in 302 ms of which 1 ms to minimize.
[2023-03-16 03:45:08] [INFO ] Deduced a trap composed of 307 places in 309 ms of which 1 ms to minimize.
[2023-03-16 03:45:08] [INFO ] Deduced a trap composed of 313 places in 309 ms of which 1 ms to minimize.
[2023-03-16 03:45:08] [INFO ] Deduced a trap composed of 311 places in 305 ms of which 0 ms to minimize.
[2023-03-16 03:45:09] [INFO ] Deduced a trap composed of 317 places in 320 ms of which 0 ms to minimize.
[2023-03-16 03:45:09] [INFO ] Deduced a trap composed of 307 places in 304 ms of which 1 ms to minimize.
[2023-03-16 03:45:10] [INFO ] Deduced a trap composed of 303 places in 281 ms of which 1 ms to minimize.
[2023-03-16 03:45:10] [INFO ] Deduced a trap composed of 307 places in 287 ms of which 1 ms to minimize.
[2023-03-16 03:45:10] [INFO ] Deduced a trap composed of 309 places in 303 ms of which 1 ms to minimize.
[2023-03-16 03:45:11] [INFO ] Deduced a trap composed of 301 places in 304 ms of which 1 ms to minimize.
[2023-03-16 03:45:11] [INFO ] Deduced a trap composed of 313 places in 302 ms of which 0 ms to minimize.
[2023-03-16 03:45:12] [INFO ] Deduced a trap composed of 303 places in 314 ms of which 2 ms to minimize.
[2023-03-16 03:45:12] [INFO ] Deduced a trap composed of 295 places in 311 ms of which 1 ms to minimize.
[2023-03-16 03:45:13] [INFO ] Deduced a trap composed of 311 places in 316 ms of which 0 ms to minimize.
[2023-03-16 03:45:13] [INFO ] Deduced a trap composed of 307 places in 313 ms of which 2 ms to minimize.
[2023-03-16 03:45:14] [INFO ] Deduced a trap composed of 313 places in 324 ms of which 1 ms to minimize.
[2023-03-16 03:45:14] [INFO ] Trap strengthening (SAT) tested/added 56/56 trap constraints in 24157 ms
[2023-03-16 03:45:14] [INFO ] After 24349ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 03:45:14] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
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 45 rules applied. Total rules applied 45 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 80 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 80 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 150 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 583 transition count 1254
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 583 transition count 1254
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 156 place count 581 transition count 1252
Applied a total of 156 rules in 192 ms. Remains 581 /664 variables (removed 83) and now considering 1252/1325 (removed 73) transitions.
[2023-03-16 03:45:14] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-16 03:45:14] [INFO ] Computed 82 place invariants in 16 ms
[2023-03-16 03:45:14] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 772 ms. Remains : 581/664 places, 1252/1325 transitions.
Incomplete random walk after 10000 steps, including 705 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 03:45:14] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 03:45:14] [INFO ] Invariant cache hit.
[2023-03-16 03:45:15] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-16 03:45:15] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-16 03:45:15] [INFO ] After 313ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 03:45:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:45:15] [INFO ] After 94ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 03:45:15] [INFO ] After 533ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 03:45:15] [INFO ] [Nat]Absence check using 75 positive place invariants in 21 ms returned sat
[2023-03-16 03:45:15] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-16 03:45:15] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 03:45:16] [INFO ] After 221ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 03:45:16] [INFO ] Deduced a trap composed of 229 places in 273 ms of which 0 ms to minimize.
[2023-03-16 03:45:16] [INFO ] Deduced a trap composed of 233 places in 282 ms of which 9 ms to minimize.
[2023-03-16 03:45:17] [INFO ] Deduced a trap composed of 231 places in 277 ms of which 1 ms to minimize.
[2023-03-16 03:45:17] [INFO ] Deduced a trap composed of 231 places in 279 ms of which 0 ms to minimize.
[2023-03-16 03:45:17] [INFO ] Deduced a trap composed of 223 places in 274 ms of which 0 ms to minimize.
[2023-03-16 03:45:18] [INFO ] Deduced a trap composed of 231 places in 280 ms of which 1 ms to minimize.
[2023-03-16 03:45:18] [INFO ] Deduced a trap composed of 241 places in 273 ms of which 0 ms to minimize.
[2023-03-16 03:45:18] [INFO ] Deduced a trap composed of 227 places in 279 ms of which 2 ms to minimize.
[2023-03-16 03:45:19] [INFO ] Deduced a trap composed of 237 places in 282 ms of which 0 ms to minimize.
[2023-03-16 03:45:19] [INFO ] Deduced a trap composed of 229 places in 274 ms of which 0 ms to minimize.
[2023-03-16 03:45:19] [INFO ] Deduced a trap composed of 229 places in 276 ms of which 0 ms to minimize.
[2023-03-16 03:45:20] [INFO ] Deduced a trap composed of 229 places in 268 ms of which 0 ms to minimize.
[2023-03-16 03:45:20] [INFO ] Deduced a trap composed of 231 places in 273 ms of which 0 ms to minimize.
[2023-03-16 03:45:20] [INFO ] Deduced a trap composed of 229 places in 250 ms of which 1 ms to minimize.
[2023-03-16 03:45:21] [INFO ] Deduced a trap composed of 229 places in 253 ms of which 1 ms to minimize.
[2023-03-16 03:45:21] [INFO ] Deduced a trap composed of 235 places in 254 ms of which 0 ms to minimize.
[2023-03-16 03:45:21] [INFO ] Deduced a trap composed of 231 places in 253 ms of which 0 ms to minimize.
[2023-03-16 03:45:22] [INFO ] Deduced a trap composed of 233 places in 276 ms of which 1 ms to minimize.
[2023-03-16 03:45:22] [INFO ] Deduced a trap composed of 241 places in 269 ms of which 1 ms to minimize.
[2023-03-16 03:45:22] [INFO ] Deduced a trap composed of 237 places in 272 ms of which 1 ms to minimize.
[2023-03-16 03:45:23] [INFO ] Deduced a trap composed of 239 places in 271 ms of which 1 ms to minimize.
[2023-03-16 03:45:23] [INFO ] Deduced a trap composed of 237 places in 274 ms of which 1 ms to minimize.
[2023-03-16 03:45:23] [INFO ] Deduced a trap composed of 227 places in 284 ms of which 1 ms to minimize.
[2023-03-16 03:45:24] [INFO ] Deduced a trap composed of 237 places in 257 ms of which 1 ms to minimize.
[2023-03-16 03:45:24] [INFO ] Deduced a trap composed of 229 places in 277 ms of which 0 ms to minimize.
[2023-03-16 03:45:24] [INFO ] Deduced a trap composed of 231 places in 280 ms of which 1 ms to minimize.
[2023-03-16 03:45:25] [INFO ] Deduced a trap composed of 235 places in 270 ms of which 0 ms to minimize.
[2023-03-16 03:45:25] [INFO ] Deduced a trap composed of 235 places in 270 ms of which 0 ms to minimize.
[2023-03-16 03:45:25] [INFO ] Deduced a trap composed of 231 places in 278 ms of which 0 ms to minimize.
[2023-03-16 03:45:26] [INFO ] Deduced a trap composed of 235 places in 271 ms of which 0 ms to minimize.
[2023-03-16 03:45:26] [INFO ] Deduced a trap composed of 237 places in 284 ms of which 1 ms to minimize.
[2023-03-16 03:45:26] [INFO ] Deduced a trap composed of 231 places in 278 ms of which 0 ms to minimize.
[2023-03-16 03:45:27] [INFO ] Deduced a trap composed of 233 places in 275 ms of which 0 ms to minimize.
[2023-03-16 03:45:27] [INFO ] Deduced a trap composed of 231 places in 275 ms of which 0 ms to minimize.
[2023-03-16 03:45:28] [INFO ] Deduced a trap composed of 233 places in 274 ms of which 1 ms to minimize.
[2023-03-16 03:45:28] [INFO ] Deduced a trap composed of 235 places in 281 ms of which 1 ms to minimize.
[2023-03-16 03:45:29] [INFO ] Deduced a trap composed of 233 places in 275 ms of which 0 ms to minimize.
[2023-03-16 03:45:29] [INFO ] Deduced a trap composed of 237 places in 279 ms of which 1 ms to minimize.
[2023-03-16 03:45:29] [INFO ] Deduced a trap composed of 231 places in 273 ms of which 1 ms to minimize.
[2023-03-16 03:45:30] [INFO ] Deduced a trap composed of 233 places in 276 ms of which 1 ms to minimize.
[2023-03-16 03:45:30] [INFO ] Deduced a trap composed of 231 places in 274 ms of which 1 ms to minimize.
[2023-03-16 03:45:30] [INFO ] Deduced a trap composed of 239 places in 269 ms of which 0 ms to minimize.
[2023-03-16 03:45:31] [INFO ] Deduced a trap composed of 233 places in 274 ms of which 0 ms to minimize.
[2023-03-16 03:45:31] [INFO ] Deduced a trap composed of 231 places in 276 ms of which 1 ms to minimize.
[2023-03-16 03:45:31] [INFO ] Deduced a trap composed of 233 places in 278 ms of which 1 ms to minimize.
[2023-03-16 03:45:32] [INFO ] Deduced a trap composed of 235 places in 275 ms of which 0 ms to minimize.
[2023-03-16 03:45:32] [INFO ] Deduced a trap composed of 227 places in 277 ms of which 0 ms to minimize.
[2023-03-16 03:45:32] [INFO ] Deduced a trap composed of 239 places in 273 ms of which 1 ms to minimize.
[2023-03-16 03:45:33] [INFO ] Deduced a trap composed of 239 places in 251 ms of which 0 ms to minimize.
[2023-03-16 03:45:33] [INFO ] Deduced a trap composed of 235 places in 281 ms of which 0 ms to minimize.
[2023-03-16 03:45:34] [INFO ] Deduced a trap composed of 235 places in 276 ms of which 1 ms to minimize.
[2023-03-16 03:45:37] [INFO ] Deduced a trap composed of 237 places in 247 ms of which 0 ms to minimize.
[2023-03-16 03:45:37] [INFO ] Deduced a trap composed of 229 places in 258 ms of which 0 ms to minimize.
[2023-03-16 03:45:37] [INFO ] Deduced a trap composed of 229 places in 255 ms of which 0 ms to minimize.
[2023-03-16 03:45:37] [INFO ] Deduced a trap composed of 227 places in 258 ms of which 0 ms to minimize.
[2023-03-16 03:45:38] [INFO ] Deduced a trap composed of 229 places in 284 ms of which 0 ms to minimize.
[2023-03-16 03:45:38] [INFO ] Deduced a trap composed of 235 places in 274 ms of which 1 ms to minimize.
[2023-03-16 03:45:39] [INFO ] Deduced a trap composed of 237 places in 270 ms of which 0 ms to minimize.
[2023-03-16 03:45:39] [INFO ] Deduced a trap composed of 229 places in 252 ms of which 1 ms to minimize.
[2023-03-16 03:45:40] [INFO ] Deduced a trap composed of 235 places in 270 ms of which 0 ms to minimize.
[2023-03-16 03:45:40] [INFO ] Deduced a trap composed of 223 places in 272 ms of which 0 ms to minimize.
[2023-03-16 03:45:40] [INFO ] Deduced a trap composed of 225 places in 257 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-16 03:45:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 03:45:40] [INFO ] After 25152ms 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 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 581 transition count 1251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 580 transition count 1251
Applied a total of 2 rules in 57 ms. Remains 580 /581 variables (removed 1) and now considering 1251/1252 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 580/581 places, 1251/1252 transitions.
Incomplete random walk after 10000 steps, including 733 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 451832 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 451832 steps, saw 73095 distinct states, run finished after 3002 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 03:45:43] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-16 03:45:43] [INFO ] Computed 82 place invariants in 30 ms
[2023-03-16 03:45:43] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-16 03:45:43] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-16 03:45:43] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 03:45:44] [INFO ] [Nat]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-16 03:45:44] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-16 03:45:44] [INFO ] After 738ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 03:45:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:45:44] [INFO ] After 133ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 03:45:45] [INFO ] Deduced a trap composed of 244 places in 272 ms of which 1 ms to minimize.
[2023-03-16 03:45:45] [INFO ] Deduced a trap composed of 234 places in 274 ms of which 1 ms to minimize.
[2023-03-16 03:45:45] [INFO ] Deduced a trap composed of 234 places in 271 ms of which 1 ms to minimize.
[2023-03-16 03:45:46] [INFO ] Deduced a trap composed of 230 places in 268 ms of which 0 ms to minimize.
[2023-03-16 03:45:46] [INFO ] Deduced a trap composed of 234 places in 271 ms of which 0 ms to minimize.
[2023-03-16 03:45:46] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 0 ms to minimize.
[2023-03-16 03:45:47] [INFO ] Deduced a trap composed of 232 places in 305 ms of which 1 ms to minimize.
[2023-03-16 03:45:47] [INFO ] Deduced a trap composed of 226 places in 281 ms of which 1 ms to minimize.
[2023-03-16 03:45:48] [INFO ] Deduced a trap composed of 232 places in 274 ms of which 1 ms to minimize.
[2023-03-16 03:45:48] [INFO ] Deduced a trap composed of 247 places in 333 ms of which 1 ms to minimize.
[2023-03-16 03:45:48] [INFO ] Deduced a trap composed of 234 places in 305 ms of which 1 ms to minimize.
[2023-03-16 03:45:49] [INFO ] Deduced a trap composed of 232 places in 283 ms of which 1 ms to minimize.
[2023-03-16 03:45:49] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 1 ms to minimize.
[2023-03-16 03:45:49] [INFO ] Deduced a trap composed of 228 places in 278 ms of which 1 ms to minimize.
[2023-03-16 03:45:50] [INFO ] Deduced a trap composed of 226 places in 261 ms of which 0 ms to minimize.
[2023-03-16 03:45:50] [INFO ] Deduced a trap composed of 230 places in 270 ms of which 0 ms to minimize.
[2023-03-16 03:45:50] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 0 ms to minimize.
[2023-03-16 03:45:51] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 0 ms to minimize.
[2023-03-16 03:45:51] [INFO ] Deduced a trap composed of 224 places in 267 ms of which 1 ms to minimize.
[2023-03-16 03:45:51] [INFO ] Deduced a trap composed of 238 places in 286 ms of which 0 ms to minimize.
[2023-03-16 03:45:52] [INFO ] Deduced a trap composed of 226 places in 268 ms of which 0 ms to minimize.
[2023-03-16 03:45:52] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 1 ms to minimize.
[2023-03-16 03:45:52] [INFO ] Deduced a trap composed of 228 places in 278 ms of which 1 ms to minimize.
[2023-03-16 03:45:52] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 0 ms to minimize.
[2023-03-16 03:45:53] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 0 ms to minimize.
[2023-03-16 03:45:53] [INFO ] Deduced a trap composed of 240 places in 275 ms of which 0 ms to minimize.
[2023-03-16 03:45:54] [INFO ] Deduced a trap composed of 232 places in 307 ms of which 1 ms to minimize.
[2023-03-16 03:45:54] [INFO ] Deduced a trap composed of 232 places in 245 ms of which 1 ms to minimize.
[2023-03-16 03:45:54] [INFO ] Deduced a trap composed of 224 places in 270 ms of which 0 ms to minimize.
[2023-03-16 03:45:55] [INFO ] Deduced a trap composed of 236 places in 274 ms of which 0 ms to minimize.
[2023-03-16 03:45:55] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 0 ms to minimize.
[2023-03-16 03:45:55] [INFO ] Deduced a trap composed of 224 places in 269 ms of which 0 ms to minimize.
[2023-03-16 03:45:56] [INFO ] Deduced a trap composed of 234 places in 273 ms of which 0 ms to minimize.
[2023-03-16 03:45:56] [INFO ] Deduced a trap composed of 226 places in 271 ms of which 0 ms to minimize.
[2023-03-16 03:45:56] [INFO ] Deduced a trap composed of 240 places in 272 ms of which 0 ms to minimize.
[2023-03-16 03:45:57] [INFO ] Deduced a trap composed of 234 places in 272 ms of which 1 ms to minimize.
[2023-03-16 03:45:57] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 1 ms to minimize.
[2023-03-16 03:45:58] [INFO ] Deduced a trap composed of 222 places in 278 ms of which 1 ms to minimize.
[2023-03-16 03:45:58] [INFO ] Deduced a trap composed of 242 places in 288 ms of which 0 ms to minimize.
[2023-03-16 03:45:58] [INFO ] Deduced a trap composed of 228 places in 269 ms of which 0 ms to minimize.
[2023-03-16 03:45:59] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 0 ms to minimize.
[2023-03-16 03:45:59] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 0 ms to minimize.
[2023-03-16 03:45:59] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 1 ms to minimize.
[2023-03-16 03:46:00] [INFO ] Deduced a trap composed of 232 places in 254 ms of which 0 ms to minimize.
[2023-03-16 03:46:01] [INFO ] Deduced a trap composed of 240 places in 276 ms of which 1 ms to minimize.
[2023-03-16 03:46:01] [INFO ] Deduced a trap composed of 234 places in 290 ms of which 1 ms to minimize.
[2023-03-16 03:46:01] [INFO ] Deduced a trap composed of 232 places in 281 ms of which 1 ms to minimize.
[2023-03-16 03:46:02] [INFO ] Deduced a trap composed of 226 places in 281 ms of which 0 ms to minimize.
[2023-03-16 03:46:02] [INFO ] Deduced a trap composed of 228 places in 277 ms of which 1 ms to minimize.
[2023-03-16 03:46:02] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 0 ms to minimize.
[2023-03-16 03:46:03] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 0 ms to minimize.
[2023-03-16 03:46:03] [INFO ] Deduced a trap composed of 230 places in 293 ms of which 1 ms to minimize.
[2023-03-16 03:46:03] [INFO ] Deduced a trap composed of 234 places in 278 ms of which 0 ms to minimize.
[2023-03-16 03:46:04] [INFO ] Deduced a trap composed of 226 places in 277 ms of which 0 ms to minimize.
[2023-03-16 03:46:04] [INFO ] Deduced a trap composed of 226 places in 301 ms of which 1 ms to minimize.
[2023-03-16 03:46:05] [INFO ] Deduced a trap composed of 234 places in 313 ms of which 0 ms to minimize.
[2023-03-16 03:46:05] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 0 ms to minimize.
[2023-03-16 03:46:05] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 1 ms to minimize.
[2023-03-16 03:46:06] [INFO ] Deduced a trap composed of 238 places in 267 ms of which 0 ms to minimize.
[2023-03-16 03:46:07] [INFO ] Deduced a trap composed of 224 places in 260 ms of which 1 ms to minimize.
[2023-03-16 03:46:08] [INFO ] Deduced a trap composed of 226 places in 282 ms of which 1 ms to minimize.
[2023-03-16 03:46:08] [INFO ] Deduced a trap composed of 238 places in 259 ms of which 0 ms to minimize.
[2023-03-16 03:46:09] [INFO ] Deduced a trap composed of 234 places in 260 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-16 03:46:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 03:46:09] [INFO ] After 25118ms 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 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 33 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 29 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-16 03:46:09] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-16 03:46:09] [INFO ] Invariant cache hit.
[2023-03-16 03:46:09] [INFO ] Implicit Places using invariants in 641 ms returned []
[2023-03-16 03:46:09] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-16 03:46:09] [INFO ] Invariant cache hit.
[2023-03-16 03:46:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:46:12] [INFO ] Implicit Places using invariants and state equation in 2984 ms returned []
Implicit Place search using SMT with State Equation took 3647 ms to find 0 implicit places.
[2023-03-16 03:46:12] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-16 03:46:12] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-16 03:46:12] [INFO ] Invariant cache hit.
[2023-03-16 03:46:13] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4377 ms. Remains : 580/580 places, 1251/1251 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 580 transition count 1242
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 580 transition count 1241
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 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 145 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1230 rows 568 cols
[2023-03-16 03:46:13] [INFO ] Computed 82 place invariants in 16 ms
[2023-03-16 03:46:13] [INFO ] [Real]Absence check using 75 positive place invariants in 54 ms returned sat
[2023-03-16 03:46:13] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-16 03:46:13] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 03:46:14] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-16 03:46:14] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-16 03:46:14] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 03:46:14] [INFO ] Deduced a trap composed of 234 places in 240 ms of which 0 ms to minimize.
[2023-03-16 03:46:15] [INFO ] Deduced a trap composed of 234 places in 303 ms of which 1 ms to minimize.
[2023-03-16 03:46:15] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 1 ms to minimize.
[2023-03-16 03:46:15] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 1 ms to minimize.
[2023-03-16 03:46:15] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 0 ms to minimize.
[2023-03-16 03:46:16] [INFO ] Deduced a trap composed of 222 places in 251 ms of which 1 ms to minimize.
[2023-03-16 03:46:16] [INFO ] Deduced a trap composed of 228 places in 250 ms of which 6 ms to minimize.
[2023-03-16 03:46:16] [INFO ] Deduced a trap composed of 230 places in 274 ms of which 0 ms to minimize.
[2023-03-16 03:46:17] [INFO ] Deduced a trap composed of 236 places in 264 ms of which 1 ms to minimize.
[2023-03-16 03:46:17] [INFO ] Deduced a trap composed of 236 places in 249 ms of which 0 ms to minimize.
[2023-03-16 03:46:17] [INFO ] Deduced a trap composed of 224 places in 234 ms of which 1 ms to minimize.
[2023-03-16 03:46:18] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 1 ms to minimize.
[2023-03-16 03:46:18] [INFO ] Deduced a trap composed of 232 places in 248 ms of which 1 ms to minimize.
[2023-03-16 03:46:18] [INFO ] Deduced a trap composed of 226 places in 239 ms of which 1 ms to minimize.
[2023-03-16 03:46:18] [INFO ] Deduced a trap composed of 234 places in 246 ms of which 1 ms to minimize.
[2023-03-16 03:46:19] [INFO ] Deduced a trap composed of 228 places in 237 ms of which 0 ms to minimize.
[2023-03-16 03:46:19] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 1 ms to minimize.
[2023-03-16 03:46:19] [INFO ] Deduced a trap composed of 224 places in 241 ms of which 1 ms to minimize.
[2023-03-16 03:46:20] [INFO ] Deduced a trap composed of 228 places in 284 ms of which 1 ms to minimize.
[2023-03-16 03:46:20] [INFO ] Deduced a trap composed of 224 places in 243 ms of which 1 ms to minimize.
[2023-03-16 03:46:20] [INFO ] Deduced a trap composed of 226 places in 255 ms of which 1 ms to minimize.
[2023-03-16 03:46:20] [INFO ] Deduced a trap composed of 220 places in 248 ms of which 1 ms to minimize.
[2023-03-16 03:46:21] [INFO ] Deduced a trap composed of 232 places in 238 ms of which 1 ms to minimize.
[2023-03-16 03:46:21] [INFO ] Deduced a trap composed of 224 places in 250 ms of which 1 ms to minimize.
[2023-03-16 03:46:21] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 1 ms to minimize.
[2023-03-16 03:46:22] [INFO ] Deduced a trap composed of 238 places in 267 ms of which 0 ms to minimize.
[2023-03-16 03:46:22] [INFO ] Deduced a trap composed of 234 places in 250 ms of which 1 ms to minimize.
[2023-03-16 03:46:22] [INFO ] Deduced a trap composed of 234 places in 239 ms of which 0 ms to minimize.
[2023-03-16 03:46:23] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 0 ms to minimize.
[2023-03-16 03:46:23] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 0 ms to minimize.
[2023-03-16 03:46:23] [INFO ] Deduced a trap composed of 234 places in 246 ms of which 1 ms to minimize.
[2023-03-16 03:46:24] [INFO ] Deduced a trap composed of 234 places in 274 ms of which 13 ms to minimize.
[2023-03-16 03:46:24] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 1 ms to minimize.
[2023-03-16 03:46:24] [INFO ] Deduced a trap composed of 226 places in 245 ms of which 0 ms to minimize.
[2023-03-16 03:46:25] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 1 ms to minimize.
[2023-03-16 03:46:25] [INFO ] Deduced a trap composed of 226 places in 249 ms of which 1 ms to minimize.
[2023-03-16 03:46:25] [INFO ] Deduced a trap composed of 238 places in 265 ms of which 1 ms to minimize.
[2023-03-16 03:46:26] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 1 ms to minimize.
[2023-03-16 03:46:26] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 1 ms to minimize.
[2023-03-16 03:46:26] [INFO ] Deduced a trap composed of 228 places in 292 ms of which 1 ms to minimize.
[2023-03-16 03:46:26] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 0 ms to minimize.
[2023-03-16 03:46:27] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 1 ms to minimize.
[2023-03-16 03:46:27] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 0 ms to minimize.
[2023-03-16 03:46:27] [INFO ] Deduced a trap composed of 224 places in 262 ms of which 1 ms to minimize.
[2023-03-16 03:46:28] [INFO ] Deduced a trap composed of 230 places in 292 ms of which 1 ms to minimize.
[2023-03-16 03:46:28] [INFO ] Deduced a trap composed of 230 places in 244 ms of which 1 ms to minimize.
[2023-03-16 03:46:28] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 0 ms to minimize.
[2023-03-16 03:46:29] [INFO ] Deduced a trap composed of 232 places in 249 ms of which 0 ms to minimize.
[2023-03-16 03:46:29] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 1 ms to minimize.
[2023-03-16 03:46:29] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 0 ms to minimize.
[2023-03-16 03:46:29] [INFO ] Deduced a trap composed of 230 places in 235 ms of which 0 ms to minimize.
[2023-03-16 03:46:30] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 0 ms to minimize.
[2023-03-16 03:46:30] [INFO ] Deduced a trap composed of 228 places in 238 ms of which 0 ms to minimize.
[2023-03-16 03:46:30] [INFO ] Deduced a trap composed of 224 places in 248 ms of which 0 ms to minimize.
[2023-03-16 03:46:31] [INFO ] Deduced a trap composed of 226 places in 251 ms of which 0 ms to minimize.
[2023-03-16 03:46:31] [INFO ] Deduced a trap composed of 230 places in 252 ms of which 0 ms to minimize.
[2023-03-16 03:46:31] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 1 ms to minimize.
[2023-03-16 03:46:31] [INFO ] Deduced a trap composed of 226 places in 235 ms of which 1 ms to minimize.
[2023-03-16 03:46:32] [INFO ] Deduced a trap composed of 230 places in 242 ms of which 0 ms to minimize.
[2023-03-16 03:46:32] [INFO ] Deduced a trap composed of 232 places in 246 ms of which 1 ms to minimize.
[2023-03-16 03:46:32] [INFO ] Deduced a trap composed of 236 places in 272 ms of which 1 ms to minimize.
[2023-03-16 03:46:33] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 1 ms to minimize.
[2023-03-16 03:46:33] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 0 ms to minimize.
[2023-03-16 03:46:33] [INFO ] Deduced a trap composed of 224 places in 243 ms of which 1 ms to minimize.
[2023-03-16 03:46:33] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 0 ms to minimize.
[2023-03-16 03:46:34] [INFO ] Deduced a trap composed of 226 places in 267 ms of which 3 ms to minimize.
[2023-03-16 03:46:34] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 0 ms to minimize.
[2023-03-16 03:46:34] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 1 ms to minimize.
[2023-03-16 03:46:35] [INFO ] Deduced a trap composed of 228 places in 244 ms of which 1 ms to minimize.
[2023-03-16 03:46:35] [INFO ] Deduced a trap composed of 230 places in 236 ms of which 1 ms to minimize.
[2023-03-16 03:46:35] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 0 ms to minimize.
[2023-03-16 03:46:36] [INFO ] Deduced a trap composed of 236 places in 245 ms of which 2 ms to minimize.
[2023-03-16 03:46:36] [INFO ] Deduced a trap composed of 234 places in 274 ms of which 2 ms to minimize.
[2023-03-16 03:46:36] [INFO ] Deduced a trap composed of 236 places in 246 ms of which 1 ms to minimize.
[2023-03-16 03:46:36] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 0 ms to minimize.
[2023-03-16 03:46:37] [INFO ] Deduced a trap composed of 236 places in 281 ms of which 0 ms to minimize.
[2023-03-16 03:46:37] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 0 ms to minimize.
[2023-03-16 03:46:38] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 0 ms to minimize.
[2023-03-16 03:46:38] [INFO ] Deduced a trap composed of 224 places in 233 ms of which 0 ms to minimize.
[2023-03-16 03:46:38] [INFO ] Deduced a trap composed of 232 places in 248 ms of which 0 ms to minimize.
[2023-03-16 03:46:38] [INFO ] Deduced a trap composed of 226 places in 241 ms of which 1 ms to minimize.
[2023-03-16 03:46:39] [INFO ] Deduced a trap composed of 232 places in 236 ms of which 0 ms to minimize.
[2023-03-16 03:46:40] [INFO ] Deduced a trap composed of 232 places in 229 ms of which 1 ms to minimize.
[2023-03-16 03:46:40] [INFO ] Deduced a trap composed of 238 places in 260 ms of which 0 ms to minimize.
[2023-03-16 03:46:40] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2023-03-16 03:46:41] [INFO ] Deduced a trap composed of 226 places in 249 ms of which 0 ms to minimize.
[2023-03-16 03:46:41] [INFO ] Deduced a trap composed of 232 places in 234 ms of which 1 ms to minimize.
[2023-03-16 03:46:41] [INFO ] Deduced a trap composed of 226 places in 250 ms of which 1 ms to minimize.
[2023-03-16 03:46:42] [INFO ] Deduced a trap composed of 228 places in 241 ms of which 0 ms to minimize.
[2023-03-16 03:46:42] [INFO ] Deduced a trap composed of 228 places in 241 ms of which 1 ms to minimize.
[2023-03-16 03:46:42] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 1 ms to minimize.
[2023-03-16 03:46:42] [INFO ] Deduced a trap composed of 232 places in 226 ms of which 1 ms to minimize.
[2023-03-16 03:46:43] [INFO ] Deduced a trap composed of 230 places in 252 ms of which 1 ms to minimize.
[2023-03-16 03:46:43] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 1 ms to minimize.
[2023-03-16 03:46:43] [INFO ] Deduced a trap composed of 234 places in 249 ms of which 0 ms to minimize.
[2023-03-16 03:46:44] [INFO ] Deduced a trap composed of 224 places in 240 ms of which 0 ms to minimize.
[2023-03-16 03:46:44] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 1 ms to minimize.
[2023-03-16 03:46:44] [INFO ] Deduced a trap composed of 224 places in 241 ms of which 0 ms to minimize.
[2023-03-16 03:46:45] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 0 ms to minimize.
[2023-03-16 03:46:45] [INFO ] Deduced a trap composed of 232 places in 243 ms of which 0 ms to minimize.
[2023-03-16 03:46:46] [INFO ] Deduced a trap composed of 230 places in 233 ms of which 0 ms to minimize.
[2023-03-16 03:46:46] [INFO ] Deduced a trap composed of 236 places in 272 ms of which 1 ms to minimize.
[2023-03-16 03:46:47] [INFO ] Deduced a trap composed of 238 places in 252 ms of which 0 ms to minimize.
[2023-03-16 03:46:47] [INFO ] Deduced a trap composed of 228 places in 240 ms of which 1 ms to minimize.
[2023-03-16 03:46:48] [INFO ] Deduced a trap composed of 230 places in 276 ms of which 1 ms to minimize.
[2023-03-16 03:46:48] [INFO ] Deduced a trap composed of 230 places in 244 ms of which 1 ms to minimize.
[2023-03-16 03:46:48] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 0 ms to minimize.
[2023-03-16 03:46:49] [INFO ] Deduced a trap composed of 228 places in 277 ms of which 0 ms to minimize.
[2023-03-16 03:46:49] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 1 ms to minimize.
[2023-03-16 03:46:49] [INFO ] Deduced a trap composed of 228 places in 240 ms of which 1 ms to minimize.
[2023-03-16 03:46:50] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 1 ms to minimize.
[2023-03-16 03:46:51] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 1 ms to minimize.
[2023-03-16 03:46:51] [INFO ] Deduced a trap composed of 226 places in 238 ms of which 0 ms to minimize.
[2023-03-16 03:46:51] [INFO ] Deduced a trap composed of 234 places in 234 ms of which 1 ms to minimize.
[2023-03-16 03:46:52] [INFO ] Deduced a trap composed of 228 places in 233 ms of which 0 ms to minimize.
[2023-03-16 03:46:53] [INFO ] Deduced a trap composed of 226 places in 252 ms of which 1 ms to minimize.
[2023-03-16 03:46:53] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 0 ms to minimize.
[2023-03-16 03:46:54] [INFO ] Deduced a trap composed of 226 places in 249 ms of which 0 ms to minimize.
[2023-03-16 03:46:54] [INFO ] Deduced a trap composed of 228 places in 264 ms of which 1 ms to minimize.
[2023-03-16 03:46:55] [INFO ] Deduced a trap composed of 234 places in 242 ms of which 0 ms to minimize.
[2023-03-16 03:46:55] [INFO ] Deduced a trap composed of 224 places in 248 ms of which 0 ms to minimize.
[2023-03-16 03:46:55] [INFO ] Deduced a trap composed of 222 places in 250 ms of which 0 ms to minimize.
[2023-03-16 03:46:55] [INFO ] Deduced a trap composed of 232 places in 232 ms of which 0 ms to minimize.
[2023-03-16 03:46:56] [INFO ] Deduced a trap composed of 226 places in 255 ms of which 1 ms to minimize.
[2023-03-16 03:46:56] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 1 ms to minimize.
[2023-03-16 03:46:56] [INFO ] Deduced a trap composed of 228 places in 239 ms of which 0 ms to minimize.
[2023-03-16 03:46:57] [INFO ] Deduced a trap composed of 232 places in 237 ms of which 1 ms to minimize.
[2023-03-16 03:46:58] [INFO ] Deduced a trap composed of 236 places in 229 ms of which 1 ms to minimize.
[2023-03-16 03:49:58] [INFO ] Trap strengthening (SAT) tested/added 128/128 trap constraints in 224525 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-16 03:49:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 03:49:59] [INFO ] After 225024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Successfully simplified 1 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 5 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
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 654 transition count 1291
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 620 transition count 1289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 72 place count 618 transition count 1257
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 136 place count 586 transition count 1257
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 585 transition count 1256
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 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 3 with 4 rules applied. Total rules applied 142 place count 583 transition count 1254
Applied a total of 142 rules in 167 ms. Remains 583 /664 variables (removed 81) and now considering 1254/1325 (removed 71) transitions.
[2023-03-16 03:49:59] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2023-03-16 03:49:59] [INFO ] Computed 82 place invariants in 17 ms
[2023-03-16 03:50:00] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
[2023-03-16 03:50:00] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 03:50:00] [INFO ] Invariant cache hit.
[2023-03-16 03:50:00] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-16 03:50:00] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 03:50:00] [INFO ] Invariant cache hit.
[2023-03-16 03:50:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:50:03] [INFO ] Implicit Places using invariants and state equation in 2431 ms returned []
Implicit Place search using SMT with State Equation took 2877 ms to find 0 implicit places.
[2023-03-16 03:50:03] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-16 03:50:03] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 03:50:03] [INFO ] Invariant cache hit.
[2023-03-16 03:50:03] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 583/664 places, 1254/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4512 ms. Remains : 583/664 places, 1254/1325 transitions.
Stuttering acceptance computed with spot in 450 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s164 1) (LT s532 1)), p1:(AND (GEQ s578 1) (GEQ s581 1)), p2:(LT s579 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6852 reset in 1203 ms.
Product exploration explored 100000 steps with 6875 reset in 1160 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) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X p0), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 9 factoid took 554 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 685 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 03:50:07] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 03:50:07] [INFO ] Invariant cache hit.
[2023-03-16 03:50:07] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-16 03:50:07] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-16 03:50:07] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-16 03:50:08] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-16 03:50:08] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-16 03:50:16] [INFO ] After 8885ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-16 03:50:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:50:17] [INFO ] After 82ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-16 03:50:17] [INFO ] Deduced a trap composed of 267 places in 298 ms of which 1 ms to minimize.
[2023-03-16 03:50:17] [INFO ] Deduced a trap composed of 267 places in 289 ms of which 1 ms to minimize.
[2023-03-16 03:50:18] [INFO ] Deduced a trap composed of 275 places in 304 ms of which 0 ms to minimize.
[2023-03-16 03:50:18] [INFO ] Deduced a trap composed of 275 places in 286 ms of which 0 ms to minimize.
[2023-03-16 03:50:18] [INFO ] Deduced a trap composed of 275 places in 296 ms of which 0 ms to minimize.
[2023-03-16 03:50:19] [INFO ] Deduced a trap composed of 254 places in 312 ms of which 1 ms to minimize.
[2023-03-16 03:50:19] [INFO ] Deduced a trap composed of 283 places in 310 ms of which 1 ms to minimize.
[2023-03-16 03:50:19] [INFO ] Deduced a trap composed of 255 places in 288 ms of which 0 ms to minimize.
[2023-03-16 03:50:20] [INFO ] Deduced a trap composed of 267 places in 290 ms of which 0 ms to minimize.
[2023-03-16 03:50:20] [INFO ] Deduced a trap composed of 274 places in 290 ms of which 1 ms to minimize.
[2023-03-16 03:50:20] [INFO ] Deduced a trap composed of 271 places in 293 ms of which 1 ms to minimize.
[2023-03-16 03:50:21] [INFO ] Deduced a trap composed of 266 places in 290 ms of which 0 ms to minimize.
[2023-03-16 03:50:21] [INFO ] Deduced a trap composed of 263 places in 305 ms of which 0 ms to minimize.
[2023-03-16 03:50:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5534 ms
[2023-03-16 03:50:22] [INFO ] After 5689ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-16 03:50:22] [INFO ] After 14851ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 583 transition count 1252
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 581 transition count 1252
Applied a total of 4 rules in 38 ms. Remains 581 /583 variables (removed 2) and now considering 1252/1254 (removed 2) transitions.
[2023-03-16 03:50:22] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-16 03:50:22] [INFO ] Computed 82 place invariants in 15 ms
[2023-03-16 03:50:23] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 645 ms. Remains : 581/583 places, 1252/1254 transitions.
Finished random walk after 494 steps, including 31 resets, run visited all 1 properties in 6 ms. (steps per millisecond=82 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X p0), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND p1 p2)), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 624 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 5 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Applied a total of 0 rules in 30 ms. Remains 583 /583 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
[2023-03-16 03:50:24] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2023-03-16 03:50:24] [INFO ] Computed 82 place invariants in 17 ms
[2023-03-16 03:50:24] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
[2023-03-16 03:50:24] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 03:50:24] [INFO ] Invariant cache hit.
[2023-03-16 03:50:25] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-16 03:50:25] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 03:50:25] [INFO ] Invariant cache hit.
[2023-03-16 03:50:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:50:28] [INFO ] Implicit Places using invariants and state equation in 2907 ms returned []
Implicit Place search using SMT with State Equation took 3340 ms to find 0 implicit places.
[2023-03-16 03:50:28] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-16 03:50:28] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 03:50:28] [INFO ] Invariant cache hit.
[2023-03-16 03:50:28] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4487 ms. Remains : 583/583 places, 1254/1254 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) p2), (X p2), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 691 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 03:50:29] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 03:50:29] [INFO ] Invariant cache hit.
[2023-03-16 03:50:29] [INFO ] [Real]Absence check using 75 positive place invariants in 26 ms returned sat
[2023-03-16 03:50:29] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 41 ms returned sat
[2023-03-16 03:50:29] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 03:50:29] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-16 03:50:29] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-16 03:50:38] [INFO ] After 8876ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 03:50:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:50:38] [INFO ] After 75ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 03:50:39] [INFO ] Deduced a trap composed of 267 places in 322 ms of which 0 ms to minimize.
[2023-03-16 03:50:39] [INFO ] Deduced a trap composed of 267 places in 291 ms of which 0 ms to minimize.
[2023-03-16 03:50:39] [INFO ] Deduced a trap composed of 275 places in 315 ms of which 0 ms to minimize.
[2023-03-16 03:50:40] [INFO ] Deduced a trap composed of 275 places in 281 ms of which 0 ms to minimize.
[2023-03-16 03:50:40] [INFO ] Deduced a trap composed of 275 places in 289 ms of which 0 ms to minimize.
[2023-03-16 03:50:40] [INFO ] Deduced a trap composed of 254 places in 285 ms of which 1 ms to minimize.
[2023-03-16 03:50:41] [INFO ] Deduced a trap composed of 283 places in 286 ms of which 1 ms to minimize.
[2023-03-16 03:50:41] [INFO ] Deduced a trap composed of 255 places in 289 ms of which 1 ms to minimize.
[2023-03-16 03:50:41] [INFO ] Deduced a trap composed of 267 places in 305 ms of which 1 ms to minimize.
[2023-03-16 03:50:42] [INFO ] Deduced a trap composed of 274 places in 294 ms of which 1 ms to minimize.
[2023-03-16 03:50:42] [INFO ] Deduced a trap composed of 271 places in 276 ms of which 1 ms to minimize.
[2023-03-16 03:50:42] [INFO ] Deduced a trap composed of 266 places in 279 ms of which 0 ms to minimize.
[2023-03-16 03:50:43] [INFO ] Deduced a trap composed of 263 places in 274 ms of which 1 ms to minimize.
[2023-03-16 03:50:44] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5424 ms
[2023-03-16 03:50:44] [INFO ] After 5568ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-16 03:50:44] [INFO ] After 14715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 583 transition count 1252
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 581 transition count 1252
Applied a total of 4 rules in 24 ms. Remains 581 /583 variables (removed 2) and now considering 1252/1254 (removed 2) transitions.
[2023-03-16 03:50:44] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-16 03:50:44] [INFO ] Computed 82 place invariants in 18 ms
[2023-03-16 03:50:44] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 581/583 places, 1252/1254 transitions.
Finished random walk after 96 steps, including 7 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p0)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 4 factoid took 285 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 6855 reset in 1044 ms.
Product exploration explored 100000 steps with 6856 reset in 1055 ms.
Built C files in :
/tmp/ltsmin17704289436608950794
[2023-03-16 03:50:47] [INFO ] Computing symmetric may disable matrix : 1254 transitions.
[2023-03-16 03:50:47] [INFO ] Computation of Complete disable matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:50:47] [INFO ] Computing symmetric may enable matrix : 1254 transitions.
[2023-03-16 03:50:47] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:50:48] [INFO ] Computing Do-Not-Accords matrix : 1254 transitions.
[2023-03-16 03:50:48] [INFO ] Computation of Completed DNA matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:50:48] [INFO ] Built C files in 428ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17704289436608950794
Running compilation step : cd /tmp/ltsmin17704289436608950794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17704289436608950794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17704289436608950794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Applied a total of 0 rules in 26 ms. Remains 583 /583 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
[2023-03-16 03:50:51] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2023-03-16 03:50:51] [INFO ] Computed 82 place invariants in 14 ms
[2023-03-16 03:50:51] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
[2023-03-16 03:50:51] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 03:50:51] [INFO ] Invariant cache hit.
[2023-03-16 03:50:52] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-16 03:50:52] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 03:50:52] [INFO ] Invariant cache hit.
[2023-03-16 03:50:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:50:54] [INFO ] Implicit Places using invariants and state equation in 2275 ms returned []
Implicit Place search using SMT with State Equation took 2708 ms to find 0 implicit places.
[2023-03-16 03:50:54] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-16 03:50:54] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 03:50:54] [INFO ] Invariant cache hit.
[2023-03-16 03:50:55] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3825 ms. Remains : 583/583 places, 1254/1254 transitions.
Built C files in :
/tmp/ltsmin13953441525996939951
[2023-03-16 03:50:55] [INFO ] Computing symmetric may disable matrix : 1254 transitions.
[2023-03-16 03:50:55] [INFO ] Computation of Complete disable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:50:55] [INFO ] Computing symmetric may enable matrix : 1254 transitions.
[2023-03-16 03:50:55] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:50:55] [INFO ] Computing Do-Not-Accords matrix : 1254 transitions.
[2023-03-16 03:50:55] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:50:55] [INFO ] Built C files in 396ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13953441525996939951
Running compilation step : cd /tmp/ltsmin13953441525996939951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13953441525996939951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13953441525996939951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 03:50:58] [INFO ] Flatten gal took : 77 ms
[2023-03-16 03:50:58] [INFO ] Flatten gal took : 63 ms
[2023-03-16 03:50:58] [INFO ] Time to serialize gal into /tmp/LTL7210179366867084579.gal : 21 ms
[2023-03-16 03:50:58] [INFO ] Time to serialize properties into /tmp/LTL5090100085102283150.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7210179366867084579.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5516416888801701241.hoa' '-atoms' '/tmp/LTL5090100085102283150.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5090100085102283150.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5516416888801701241.hoa
Detected timeout of ITS tools.
[2023-03-16 03:51:13] [INFO ] Flatten gal took : 65 ms
[2023-03-16 03:51:14] [INFO ] Flatten gal took : 61 ms
[2023-03-16 03:51:14] [INFO ] Time to serialize gal into /tmp/LTL5993241906230573401.gal : 11 ms
[2023-03-16 03:51:14] [INFO ] Time to serialize properties into /tmp/LTL9228618336151755387.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5993241906230573401.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9228618336151755387.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("((NotifyEventJobQueuedE_0<1)||(place_458_0<1))"))&&(F((G("((place_782_0>=1)&&(JobCnt_0>=1))"))||(G("(place_787_0<1)")))))))
Formula 0 simplified : F(G!"((NotifyEventJobQueuedE_0<1)||(place_458_0<1))" | G(F!"((place_782_0>=1)&&(JobCnt_0>=1))" & F!"(place_787_0<1)"))
Detected timeout of ITS tools.
[2023-03-16 03:51:29] [INFO ] Flatten gal took : 68 ms
[2023-03-16 03:51:29] [INFO ] Applying decomposition
[2023-03-16 03:51:29] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5149215234922960283.txt' '-o' '/tmp/graph5149215234922960283.bin' '-w' '/tmp/graph5149215234922960283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5149215234922960283.bin' '-l' '-1' '-v' '-w' '/tmp/graph5149215234922960283.weights' '-q' '0' '-e' '0.001'
[2023-03-16 03:51:29] [INFO ] Decomposing Gal with order
[2023-03-16 03:51:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 03:51:29] [INFO ] Removed a total of 3070 redundant transitions.
[2023-03-16 03:51:29] [INFO ] Flatten gal took : 203 ms
[2023-03-16 03:51:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 343 labels/synchronizations in 55 ms.
[2023-03-16 03:51:29] [INFO ] Time to serialize gal into /tmp/LTL13880940586891828269.gal : 13 ms
[2023-03-16 03:51:29] [INFO ] Time to serialize properties into /tmp/LTL8559445465560443352.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13880940586891828269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8559445465560443352.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F("((i4.u16.NotifyEventJobQueuedE_0<1)||(i4.u16.place_458_0<1))"))&&(F((G("((i7.u26.place_782_0>=1)&&(i0.u44.JobCnt_0>=1))"))||(...188
Formula 0 simplified : F(G!"((i4.u16.NotifyEventJobQueuedE_0<1)||(i4.u16.place_458_0<1))" | G(F!"((i7.u26.place_782_0>=1)&&(i0.u44.JobCnt_0>=1))" & F!"(i4....176
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16846100466193540944
[2023-03-16 03:51:44] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16846100466193540944
Running compilation step : cd /tmp/ltsmin16846100466193540944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2477 ms.
Running link step : cd /tmp/ltsmin16846100466193540944;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin16846100466193540944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>(([]((LTLAPp1==true))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-00 finished in 120679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 363 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 664 transition count 1321
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 660 transition count 1321
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 8 place count 660 transition count 1286
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 78 place count 625 transition count 1286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 624 transition count 1285
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 624 transition count 1285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 623 transition count 1284
Applied a total of 82 rules in 57 ms. Remains 623 /664 variables (removed 41) and now considering 1284/1325 (removed 41) transitions.
[2023-03-16 03:52:00] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
// Phase 1: matrix 1275 rows 623 cols
[2023-03-16 03:52:00] [INFO ] Computed 92 place invariants in 15 ms
[2023-03-16 03:52:01] [INFO ] Dead Transitions using invariants and state equation in 1080 ms found 0 transitions.
[2023-03-16 03:52:01] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-16 03:52:01] [INFO ] Invariant cache hit.
[2023-03-16 03:52:01] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-16 03:52:01] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-16 03:52:01] [INFO ] Invariant cache hit.
[2023-03-16 03:52:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:52:03] [INFO ] Implicit Places using invariants and state equation in 2389 ms returned []
Implicit Place search using SMT with State Equation took 2712 ms to find 0 implicit places.
[2023-03-16 03:52:03] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-16 03:52:03] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-16 03:52:03] [INFO ] Invariant cache hit.
[2023-03-16 03:52:04] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 623/664 places, 1284/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4756 ms. Remains : 623/664 places, 1284/1325 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-01 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 (AND (GEQ s496 1) (GEQ s617 1)) (AND (GEQ s284 1) (GEQ s596 1)) (AND (GEQ s225 1) (GEQ s590 1)) (AND (GEQ s343 1) (GEQ s602 1)) (AND (GEQ s319 1) (...], 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]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-01 finished in 4873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 12 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
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 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 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 70 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 138 place count 585 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1255
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1255
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 144 place count 582 transition count 1253
Applied a total of 144 rules in 96 ms. Remains 582 /664 variables (removed 82) and now considering 1253/1325 (removed 72) transitions.
[2023-03-16 03:52:05] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2023-03-16 03:52:05] [INFO ] Computed 82 place invariants in 16 ms
[2023-03-16 03:52:05] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
[2023-03-16 03:52:05] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 03:52:05] [INFO ] Invariant cache hit.
[2023-03-16 03:52:05] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-16 03:52:05] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 03:52:05] [INFO ] Invariant cache hit.
[2023-03-16 03:52:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:52:08] [INFO ] Implicit Places using invariants and state equation in 2877 ms returned []
Implicit Place search using SMT with State Equation took 3230 ms to find 0 implicit places.
[2023-03-16 03:52:08] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-16 03:52:08] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 03:52:08] [INFO ] Invariant cache hit.
[2023-03-16 03:52:09] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/664 places, 1253/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4459 ms. Remains : 582/664 places, 1253/1325 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s199 1) (GEQ s202 1) (GEQ s206 1) (GEQ s210 8)) (AND (GEQ s199 1) (GEQ s200 1) (GEQ s202 1) (GEQ s210 8)) (AND (GEQ s199 1) (GEQ s201 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-02 finished in 4525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
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 654 transition count 1292
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 621 transition count 1291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 620 transition count 1291
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 620 transition count 1257
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 586 transition count 1257
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 585 transition count 1256
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 584 transition count 1255
Applied a total of 140 rules in 96 ms. Remains 584 /664 variables (removed 80) and now considering 1255/1325 (removed 70) transitions.
[2023-03-16 03:52:09] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2023-03-16 03:52:09] [INFO ] Computed 82 place invariants in 20 ms
[2023-03-16 03:52:10] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
[2023-03-16 03:52:10] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-16 03:52:10] [INFO ] Invariant cache hit.
[2023-03-16 03:52:10] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-16 03:52:10] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-16 03:52:10] [INFO ] Invariant cache hit.
[2023-03-16 03:52:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:52:13] [INFO ] Implicit Places using invariants and state equation in 3363 ms returned []
Implicit Place search using SMT with State Equation took 3813 ms to find 0 implicit places.
[2023-03-16 03:52:13] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-16 03:52:13] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-16 03:52:13] [INFO ] Invariant cache hit.
[2023-03-16 03:52:14] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 584/664 places, 1255/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5111 ms. Remains : 584/664 places, 1255/1325 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s581 1) (LT s580 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-03 finished in 5192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((p1 U !p2)))))'
Support contains 36 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
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 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 619 transition count 1289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 618 transition count 1255
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 583 transition count 1254
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 583 transition count 1254
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 146 place count 581 transition count 1252
Applied a total of 146 rules in 66 ms. Remains 581 /664 variables (removed 83) and now considering 1252/1325 (removed 73) transitions.
[2023-03-16 03:52:14] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-16 03:52:14] [INFO ] Computed 82 place invariants in 23 ms
[2023-03-16 03:52:15] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
[2023-03-16 03:52:15] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 03:52:15] [INFO ] Invariant cache hit.
[2023-03-16 03:52:15] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-16 03:52:15] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 03:52:15] [INFO ] Invariant cache hit.
[2023-03-16 03:52:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:52:18] [INFO ] Implicit Places using invariants and state equation in 2999 ms returned []
Implicit Place search using SMT with State Equation took 3428 ms to find 0 implicit places.
[2023-03-16 03:52:18] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-16 03:52:18] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 03:52:18] [INFO ] Invariant cache hit.
[2023-03-16 03:52:19] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/664 places, 1252/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4611 ms. Remains : 581/664 places, 1252/1325 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) p2), p2, p2]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s35 1) (GEQ s163 1)) (AND (GEQ s0 1) (GEQ s45 1) (GEQ s163 1)) (AND (GEQ s0 1) (GEQ s55 1) (GEQ s163 1)) (AND (GEQ s0 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-04 finished in 4770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||(F(p2)&&X(p1))))'
Support contains 54 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 24 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-16 03:52:19] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-16 03:52:19] [INFO ] Computed 82 place invariants in 18 ms
[2023-03-16 03:52:20] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
[2023-03-16 03:52:20] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 03:52:20] [INFO ] Invariant cache hit.
[2023-03-16 03:52:20] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-16 03:52:20] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 03:52:20] [INFO ] Invariant cache hit.
[2023-03-16 03:52:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:52:22] [INFO ] Implicit Places using invariants and state equation in 2253 ms returned []
Implicit Place search using SMT with State Equation took 2617 ms to find 0 implicit places.
[2023-03-16 03:52:22] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 03:52:22] [INFO ] Invariant cache hit.
[2023-03-16 03:52:23] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4070 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (AND (GEQ s203 1) (GEQ s208 1) (GEQ s209 1) (GEQ s210 1) (GEQ s214 7)) (AND (GEQ s203 1) (GEQ s204 1) (GEQ s205 1) (GEQ s213 1) (GEQ s214 7)) (AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-07 finished in 4361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
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 654 transition count 1291
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 620 transition count 1291
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 68 place count 620 transition count 1255
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 140 place count 584 transition count 1255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 582 transition count 1253
Applied a total of 144 rules in 52 ms. Remains 582 /664 variables (removed 82) and now considering 1253/1325 (removed 72) transitions.
[2023-03-16 03:52:23] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2023-03-16 03:52:23] [INFO ] Computed 82 place invariants in 19 ms
[2023-03-16 03:52:24] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
[2023-03-16 03:52:24] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 03:52:24] [INFO ] Invariant cache hit.
[2023-03-16 03:52:24] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-16 03:52:24] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 03:52:24] [INFO ] Invariant cache hit.
[2023-03-16 03:52:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:52:27] [INFO ] Implicit Places using invariants and state equation in 2700 ms returned []
Implicit Place search using SMT with State Equation took 3136 ms to find 0 implicit places.
[2023-03-16 03:52:27] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-16 03:52:27] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 03:52:27] [INFO ] Invariant cache hit.
[2023-03-16 03:52:28] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/664 places, 1253/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4311 ms. Remains : 582/664 places, 1253/1325 transitions.
Stuttering acceptance computed with spot in 1377 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s581 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7547 reset in 991 ms.
Product exploration explored 100000 steps with 7596 reset in 989 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 : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 37 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 619 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Support contains 1 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 22 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2023-03-16 03:52:32] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 03:52:32] [INFO ] Invariant cache hit.
[2023-03-16 03:52:32] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
[2023-03-16 03:52:32] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 03:52:32] [INFO ] Invariant cache hit.
[2023-03-16 03:52:33] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-16 03:52:33] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 03:52:33] [INFO ] Invariant cache hit.
[2023-03-16 03:52:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:52:36] [INFO ] Implicit Places using invariants and state equation in 2773 ms returned []
Implicit Place search using SMT with State Equation took 3228 ms to find 0 implicit places.
[2023-03-16 03:52:36] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-16 03:52:36] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 03:52:36] [INFO ] Invariant cache hit.
[2023-03-16 03:52:36] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4355 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 2275 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 211 steps, including 16 resets, run visited all 1 properties in 4 ms. (steps per millisecond=52 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7617 reset in 986 ms.
Product exploration explored 100000 steps with 7608 reset in 1003 ms.
Built C files in :
/tmp/ltsmin6394672759215428438
[2023-03-16 03:52:41] [INFO ] Computing symmetric may disable matrix : 1253 transitions.
[2023-03-16 03:52:41] [INFO ] Computation of Complete disable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:52:41] [INFO ] Computing symmetric may enable matrix : 1253 transitions.
[2023-03-16 03:52:41] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:52:41] [INFO ] Computing Do-Not-Accords matrix : 1253 transitions.
[2023-03-16 03:52:41] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:52:41] [INFO ] Built C files in 360ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6394672759215428438
Running compilation step : cd /tmp/ltsmin6394672759215428438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6394672759215428438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6394672759215428438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 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 38 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2023-03-16 03:52:44] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 03:52:44] [INFO ] Invariant cache hit.
[2023-03-16 03:52:45] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
[2023-03-16 03:52:45] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 03:52:45] [INFO ] Invariant cache hit.
[2023-03-16 03:52:45] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-16 03:52:45] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 03:52:45] [INFO ] Invariant cache hit.
[2023-03-16 03:52:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:52:48] [INFO ] Implicit Places using invariants and state equation in 2432 ms returned []
Implicit Place search using SMT with State Equation took 2908 ms to find 0 implicit places.
[2023-03-16 03:52:48] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-16 03:52:48] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 03:52:48] [INFO ] Invariant cache hit.
[2023-03-16 03:52:48] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4070 ms. Remains : 582/582 places, 1253/1253 transitions.
Built C files in :
/tmp/ltsmin13465130069540537920
[2023-03-16 03:52:48] [INFO ] Computing symmetric may disable matrix : 1253 transitions.
[2023-03-16 03:52:48] [INFO ] Computation of Complete disable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:52:48] [INFO ] Computing symmetric may enable matrix : 1253 transitions.
[2023-03-16 03:52:48] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:52:49] [INFO ] Computing Do-Not-Accords matrix : 1253 transitions.
[2023-03-16 03:52:49] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:52:49] [INFO ] Built C files in 364ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13465130069540537920
Running compilation step : cd /tmp/ltsmin13465130069540537920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13465130069540537920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13465130069540537920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 03:52:52] [INFO ] Flatten gal took : 83 ms
[2023-03-16 03:52:52] [INFO ] Flatten gal took : 61 ms
[2023-03-16 03:52:52] [INFO ] Time to serialize gal into /tmp/LTL5209079792019001589.gal : 9 ms
[2023-03-16 03:52:52] [INFO ] Time to serialize properties into /tmp/LTL10063861747012642649.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5209079792019001589.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8635098372265300864.hoa' '-atoms' '/tmp/LTL10063861747012642649.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10063861747012642649.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8635098372265300864.hoa
Detected timeout of ITS tools.
[2023-03-16 03:53:07] [INFO ] Flatten gal took : 56 ms
[2023-03-16 03:53:07] [INFO ] Flatten gal took : 55 ms
[2023-03-16 03:53:07] [INFO ] Time to serialize gal into /tmp/LTL14095601107491484439.gal : 9 ms
[2023-03-16 03:53:07] [INFO ] Time to serialize properties into /tmp/LTL15953272503366481659.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14095601107491484439.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15953272503366481659.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(Try_Check_Sources_E_0<1)"))))
Formula 0 simplified : FG!"(Try_Check_Sources_E_0<1)"
Detected timeout of ITS tools.
[2023-03-16 03:53:22] [INFO ] Flatten gal took : 72 ms
[2023-03-16 03:53:22] [INFO ] Applying decomposition
[2023-03-16 03:53:22] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1562691134803376867.txt' '-o' '/tmp/graph1562691134803376867.bin' '-w' '/tmp/graph1562691134803376867.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1562691134803376867.bin' '-l' '-1' '-v' '-w' '/tmp/graph1562691134803376867.weights' '-q' '0' '-e' '0.001'
[2023-03-16 03:53:23] [INFO ] Decomposing Gal with order
[2023-03-16 03:53:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 03:53:23] [INFO ] Removed a total of 3072 redundant transitions.
[2023-03-16 03:53:23] [INFO ] Flatten gal took : 184 ms
[2023-03-16 03:53:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 344 labels/synchronizations in 65 ms.
[2023-03-16 03:53:23] [INFO ] Time to serialize gal into /tmp/LTL11679899992171258180.gal : 25 ms
[2023-03-16 03:53:23] [INFO ] Time to serialize properties into /tmp/LTL13599556651787509848.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11679899992171258180.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13599556651787509848.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(i6.u45.Try_Check_Sources_E_0<1)"))))
Formula 0 simplified : FG!"(i6.u45.Try_Check_Sources_E_0<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10999519747318998603
[2023-03-16 03:53:38] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10999519747318998603
Running compilation step : cd /tmp/ltsmin10999519747318998603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2501 ms.
Running link step : cd /tmp/ltsmin10999519747318998603;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10999519747318998603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-08 finished in 89920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 23 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-16 03:53:53] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-16 03:53:53] [INFO ] Computed 82 place invariants in 20 ms
[2023-03-16 03:53:54] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
[2023-03-16 03:53:54] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 03:53:54] [INFO ] Invariant cache hit.
[2023-03-16 03:53:54] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-16 03:53:54] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 03:53:54] [INFO ] Invariant cache hit.
[2023-03-16 03:53:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:53:58] [INFO ] Implicit Places using invariants and state equation in 3994 ms returned []
Implicit Place search using SMT with State Equation took 4499 ms to find 0 implicit places.
[2023-03-16 03:53:58] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 03:53:58] [INFO ] Invariant cache hit.
[2023-03-16 03:53:59] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5911 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s198 4) (GEQ s197 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-09 finished in 6040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0||X(F((!p0 U (p1||G(!p0)))))) U X(G(p2)))))'
Support contains 36 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 22 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-16 03:53:59] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 03:53:59] [INFO ] Invariant cache hit.
[2023-03-16 03:54:00] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
[2023-03-16 03:54:00] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 03:54:00] [INFO ] Invariant cache hit.
[2023-03-16 03:54:00] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-16 03:54:00] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 03:54:00] [INFO ] Invariant cache hit.
[2023-03-16 03:54:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:54:04] [INFO ] Implicit Places using invariants and state equation in 3197 ms returned []
Implicit Place search using SMT with State Equation took 3689 ms to find 0 implicit places.
[2023-03-16 03:54:04] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 03:54:04] [INFO ] Invariant cache hit.
[2023-03-16 03:54:04] [INFO ] Dead Transitions using invariants and state equation in 717 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5139 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s200 2), p0:(OR (AND (GEQ s32 1) (GEQ s98 1) (GEQ s130 1)) (AND (GEQ s32 1) (GEQ s98 1) (GEQ s131 1)) (AND (GEQ s32 1) (GEQ s98 1) (GEQ s132 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-10 finished in 5341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 33 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1289
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 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 72 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 142 place count 583 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 582 transition count 1253
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 582 transition count 1253
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 580 transition count 1251
Applied a total of 148 rules in 56 ms. Remains 580 /664 variables (removed 84) and now considering 1251/1325 (removed 74) transitions.
[2023-03-16 03:54:05] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-16 03:54:05] [INFO ] Computed 82 place invariants in 20 ms
[2023-03-16 03:54:05] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
[2023-03-16 03:54:05] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-16 03:54:05] [INFO ] Invariant cache hit.
[2023-03-16 03:54:06] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-16 03:54:06] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-16 03:54:06] [INFO ] Invariant cache hit.
[2023-03-16 03:54:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:54:08] [INFO ] Implicit Places using invariants and state equation in 2642 ms returned []
Implicit Place search using SMT with State Equation took 3061 ms to find 0 implicit places.
[2023-03-16 03:54:08] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-16 03:54:08] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-16 03:54:08] [INFO ] Invariant cache hit.
[2023-03-16 03:54:09] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 580/664 places, 1251/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4217 ms. Remains : 580/664 places, 1251/1325 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s197 2) (AND (GEQ s191 1) (GEQ s579 1)) (AND (GEQ s186 1) (GEQ s579 1)) (AND (GEQ s167 1) (GEQ s579 1)) (AND (GEQ s172 1) (GEQ s579 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-12 finished in 4277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 43 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 26 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-16 03:54:09] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-16 03:54:09] [INFO ] Computed 82 place invariants in 23 ms
[2023-03-16 03:54:10] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
[2023-03-16 03:54:10] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 03:54:10] [INFO ] Invariant cache hit.
[2023-03-16 03:54:10] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-16 03:54:10] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 03:54:10] [INFO ] Invariant cache hit.
[2023-03-16 03:54:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:54:14] [INFO ] Implicit Places using invariants and state equation in 3713 ms returned []
Implicit Place search using SMT with State Equation took 4108 ms to find 0 implicit places.
[2023-03-16 03:54:14] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 03:54:14] [INFO ] Invariant cache hit.
[2023-03-16 03:54:14] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5521 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-14 finished in 5682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
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 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 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 70 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 140 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 583 transition count 1254
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 583 transition count 1254
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 581 transition count 1252
Applied a total of 146 rules in 59 ms. Remains 581 /664 variables (removed 83) and now considering 1252/1325 (removed 73) transitions.
[2023-03-16 03:54:15] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-16 03:54:15] [INFO ] Computed 82 place invariants in 27 ms
[2023-03-16 03:54:15] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
[2023-03-16 03:54:15] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 03:54:15] [INFO ] Invariant cache hit.
[2023-03-16 03:54:16] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-16 03:54:16] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 03:54:16] [INFO ] Invariant cache hit.
[2023-03-16 03:54:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 03:54:18] [INFO ] Implicit Places using invariants and state equation in 2481 ms returned []
Implicit Place search using SMT with State Equation took 2921 ms to find 0 implicit places.
[2023-03-16 03:54:18] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-16 03:54:18] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 03:54:18] [INFO ] Invariant cache hit.
[2023-03-16 03:54:19] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/664 places, 1252/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4084 ms. Remains : 581/664 places, 1252/1325 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s198 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-15 finished in 4144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-16 03:54:19] [INFO ] Flatten gal took : 53 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9686528474787268280
[2023-03-16 03:54:19] [INFO ] Computing symmetric may disable matrix : 1325 transitions.
[2023-03-16 03:54:19] [INFO ] Applying decomposition
[2023-03-16 03:54:19] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:54:19] [INFO ] Computing symmetric may enable matrix : 1325 transitions.
[2023-03-16 03:54:19] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:54:19] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11410416901137664763.txt' '-o' '/tmp/graph11410416901137664763.bin' '-w' '/tmp/graph11410416901137664763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11410416901137664763.bin' '-l' '-1' '-v' '-w' '/tmp/graph11410416901137664763.weights' '-q' '0' '-e' '0.001'
[2023-03-16 03:54:19] [INFO ] Decomposing Gal with order
[2023-03-16 03:54:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 03:54:19] [INFO ] Computing Do-Not-Accords matrix : 1325 transitions.
[2023-03-16 03:54:19] [INFO ] Removed a total of 1381 redundant transitions.
[2023-03-16 03:54:19] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 03:54:19] [INFO ] Flatten gal took : 109 ms
[2023-03-16 03:54:19] [INFO ] Built C files in 440ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9686528474787268280
Running compilation step : cd /tmp/ltsmin9686528474787268280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 03:54:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 227 labels/synchronizations in 17 ms.
[2023-03-16 03:54:19] [INFO ] Time to serialize gal into /tmp/LTLFireability7476697593220294654.gal : 12 ms
[2023-03-16 03:54:19] [INFO ] Time to serialize properties into /tmp/LTLFireability16016860429454704712.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7476697593220294654.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16016860429454704712.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G((F("((i4.i0.u28.NotifyEventJobQueuedE_0<1)||(u29.place_458_0<1))"))&&(F((G("((i4.i0.u53.place_782_0>=1)&&(i2.u70.JobCnt_0>=1))"))...194
Formula 0 simplified : F(G!"((i4.i0.u28.NotifyEventJobQueuedE_0<1)||(u29.place_458_0<1))" | G(F!"((i4.i0.u53.place_782_0>=1)&&(i2.u70.JobCnt_0>=1))" & F!"(...182
Compilation finished in 5266 ms.
Running link step : cd /tmp/ltsmin9686528474787268280;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin9686528474787268280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>(([]((LTLAPp1==true))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-16 04:17:33] [INFO ] Applying decomposition
[2023-03-16 04:17:33] [INFO ] Flatten gal took : 284 ms
[2023-03-16 04:17:33] [INFO ] Decomposing Gal with order
[2023-03-16 04:17:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 04:17:34] [INFO ] Removed a total of 6716 redundant transitions.
[2023-03-16 04:17:34] [INFO ] Flatten gal took : 580 ms
[2023-03-16 04:17:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 140 ms.
[2023-03-16 04:17:34] [INFO ] Time to serialize gal into /tmp/LTLFireability16229110887460126874.gal : 67 ms
[2023-03-16 04:17:34] [INFO ] Time to serialize properties into /tmp/LTLFireability15524929614186968956.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16229110887460126874.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15524929614186968956.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((G((F("((NotifyEventJobQueuedE.NotifyEventJobQueuedE_0<1)||(place_458.place_458_0<1))"))&&(F((G("((place_782.place_782_0>=1)&&(JobCn...212
Formula 0 simplified : F(G!"((NotifyEventJobQueuedE.NotifyEventJobQueuedE_0<1)||(place_458.place_458_0<1))" | G(F!"((place_782.place_782_0>=1)&&(JobCnt.Job...200
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin9686528474787268280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>(([]((LTLAPp1==true))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9686528474787268280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-16 04:42:16] [INFO ] Flatten gal took : 26573 ms
[2023-03-16 04:42:17] [INFO ] Input system was already deterministic with 1325 transitions.
[2023-03-16 04:42:17] [INFO ] Transformed 664 places.
[2023-03-16 04:42:17] [INFO ] Transformed 1325 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 04:42:48] [INFO ] Time to serialize gal into /tmp/LTLFireability16441275907946066023.gal : 32 ms
[2023-03-16 04:42:48] [INFO ] Time to serialize properties into /tmp/LTLFireability6938459798892777223.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16441275907946066023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6938459798892777223.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F("((NotifyEventJobQueuedE_0<1)||(place_458_0<1))"))&&(F((G("((place_782_0>=1)&&(JobCnt_0>=1))"))||(G("(place_787_0<1)")))))))
Formula 0 simplified : F(G!"((NotifyEventJobQueuedE_0<1)||(place_458_0<1))" | G(F!"((place_782_0>=1)&&(JobCnt_0>=1))" & F!"(place_787_0<1)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13249700 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16168444 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J30"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S10J30, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r293-tall-167873945800684"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;