About the Execution of ITS-Tools for PolyORBNT-COL-S05J40
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.472 | 3600000.00 | 8538533.00 | 63375.90 | TFFFFTFTTT?FFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017100748.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-COL-S05J40, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017100748
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 8.1K Apr 30 03:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 03:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 03:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 30 03:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 93K May 10 09:34 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-S05J40-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S05J40-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652933858700
Running Version 202205111006
[2022-05-19 04:17:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 04:17:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 04:17:39] [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.
[2022-05-19 04:17:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 04:17:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 620 ms
[2022-05-19 04:17:40] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 04:17:40] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 7 ms.
[2022-05-19 04:17:40] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 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 801 resets, run finished after 442 ms. (steps per millisecond=22 ) properties (out of 29) seen :7
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :17
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 04:17:42] [INFO ] Computed 13 place invariants in 13 ms
[2022-05-19 04:17:42] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-19 04:17:42] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-19 04:17:42] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1
[2022-05-19 04:17:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:17:42] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :2 sat :1
[2022-05-19 04:17:42] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 6 ms to minimize.
[2022-05-19 04:17:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2022-05-19 04:17:42] [INFO ] After 63ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-19 04:17:42] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-19 04:17:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-19 04:17:42] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-19 04:17:42] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-05-19 04:17:42] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2022-05-19 04:17:42] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2022-05-19 04:17:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-19 04:17:42] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-19 04:17:42] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 1 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 30 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 34 cols
[2022-05-19 04:17:42] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-19 04:17:42] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10000 steps, including 1169 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 338 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Probably explored full state space saw : 335 states, properties seen :0
Probabilistic random walk after 889 steps, saw 335 distinct states, run finished after 13 ms. (steps per millisecond=68 ) properties seen :0
Explored full state space saw : 335 states, properties seen :0
Exhaustive walk after 889 steps, saw 335 distinct states, run finished after 3 ms. (steps per millisecond=296 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 04:17:42] [INFO ] Flatten gal took : 21 ms
[2022-05-19 04:17:42] [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.
[2022-05-19 04:17:42] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 40 ms.
[2022-05-19 04:17:42] [INFO ] Unfolded 14 HLPN properties in 0 ms.
[2022-05-19 04:17:42] [INFO ] Reduced 10 identical enabling conditions.
[2022-05-19 04:17:42] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 480 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 935
Applied a total of 5 rules in 20 ms. Remains 624 /629 variables (removed 5) and now considering 935/935 (removed 0) transitions.
[2022-05-19 04:17:42] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 624 cols
[2022-05-19 04:17:42] [INFO ] Computed 97 place invariants in 45 ms
[2022-05-19 04:17:43] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2022-05-19 04:17:43] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 04:17:43] [INFO ] Computed 97 place invariants in 35 ms
[2022-05-19 04:17:43] [INFO ] Implicit Places using invariants in 312 ms returned []
[2022-05-19 04:17:43] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 04:17:43] [INFO ] Computed 97 place invariants in 27 ms
[2022-05-19 04:17:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:17:45] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 1740 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 624/629 places, 840/935 transitions.
Applied a total of 0 rules in 16 ms. Remains 624 /624 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 624/629 places, 840/935 transitions.
Support contains 480 out of 624 places after structural reductions.
[2022-05-19 04:17:45] [INFO ] Flatten gal took : 89 ms
[2022-05-19 04:17:45] [INFO ] Flatten gal took : 78 ms
[2022-05-19 04:17:45] [INFO ] Input system was already deterministic with 840 transitions.
Support contains 479 out of 624 places (down from 480) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 683 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 26) seen :22
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2022-05-19 04:17:46] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 04:17:46] [INFO ] Computed 97 place invariants in 18 ms
[2022-05-19 04:17:46] [INFO ] [Real]Absence check using 91 positive place invariants in 22 ms returned sat
[2022-05-19 04:17:46] [INFO ] [Real]Absence check using 91 positive and 6 generalized place invariants in 11 ms returned sat
[2022-05-19 04:17:46] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-19 04:17:46] [INFO ] [Nat]Absence check using 91 positive place invariants in 22 ms returned sat
[2022-05-19 04:17:46] [INFO ] [Nat]Absence check using 91 positive and 6 generalized place invariants in 13 ms returned sat
[2022-05-19 04:17:46] [INFO ] After 446ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-19 04:17:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:17:47] [INFO ] After 111ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-19 04:17:47] [INFO ] Deduced a trap composed of 275 places in 184 ms of which 1 ms to minimize.
[2022-05-19 04:17:47] [INFO ] Deduced a trap composed of 260 places in 185 ms of which 1 ms to minimize.
[2022-05-19 04:17:47] [INFO ] Deduced a trap composed of 254 places in 192 ms of which 0 ms to minimize.
[2022-05-19 04:17:48] [INFO ] Deduced a trap composed of 254 places in 185 ms of which 0 ms to minimize.
[2022-05-19 04:17:48] [INFO ] Deduced a trap composed of 263 places in 189 ms of which 0 ms to minimize.
[2022-05-19 04:17:48] [INFO ] Deduced a trap composed of 266 places in 180 ms of which 1 ms to minimize.
[2022-05-19 04:17:48] [INFO ] Deduced a trap composed of 260 places in 188 ms of which 0 ms to minimize.
[2022-05-19 04:17:48] [INFO ] Deduced a trap composed of 251 places in 176 ms of which 0 ms to minimize.
[2022-05-19 04:17:49] [INFO ] Deduced a trap composed of 275 places in 180 ms of which 0 ms to minimize.
[2022-05-19 04:17:49] [INFO ] Deduced a trap composed of 257 places in 181 ms of which 1 ms to minimize.
[2022-05-19 04:17:49] [INFO ] Deduced a trap composed of 254 places in 176 ms of which 1 ms to minimize.
[2022-05-19 04:17:49] [INFO ] Deduced a trap composed of 269 places in 208 ms of which 0 ms to minimize.
[2022-05-19 04:17:50] [INFO ] Deduced a trap composed of 266 places in 177 ms of which 1 ms to minimize.
[2022-05-19 04:17:50] [INFO ] Deduced a trap composed of 269 places in 175 ms of which 1 ms to minimize.
[2022-05-19 04:17:50] [INFO ] Deduced a trap composed of 263 places in 172 ms of which 0 ms to minimize.
[2022-05-19 04:17:51] [INFO ] Deduced a trap composed of 245 places in 173 ms of which 1 ms to minimize.
[2022-05-19 04:17:51] [INFO ] Deduced a trap composed of 254 places in 179 ms of which 0 ms to minimize.
[2022-05-19 04:17:51] [INFO ] Deduced a trap composed of 257 places in 176 ms of which 2 ms to minimize.
[2022-05-19 04:17:51] [INFO ] Deduced a trap composed of 266 places in 176 ms of which 1 ms to minimize.
[2022-05-19 04:17:52] [INFO ] Deduced a trap composed of 257 places in 181 ms of which 0 ms to minimize.
[2022-05-19 04:17:52] [INFO ] Deduced a trap composed of 272 places in 177 ms of which 1 ms to minimize.
[2022-05-19 04:17:52] [INFO ] Deduced a trap composed of 257 places in 169 ms of which 1 ms to minimize.
[2022-05-19 04:17:52] [INFO ] Deduced a trap composed of 263 places in 178 ms of which 0 ms to minimize.
[2022-05-19 04:17:55] [INFO ] Deduced a trap composed of 260 places in 173 ms of which 1 ms to minimize.
[2022-05-19 04:17:55] [INFO ] Deduced a trap composed of 248 places in 176 ms of which 1 ms to minimize.
[2022-05-19 04:17:55] [INFO ] Deduced a trap composed of 266 places in 179 ms of which 1 ms to minimize.
[2022-05-19 04:17:56] [INFO ] Deduced a trap composed of 257 places in 179 ms of which 1 ms to minimize.
[2022-05-19 04:17:56] [INFO ] Deduced a trap composed of 266 places in 179 ms of which 1 ms to minimize.
[2022-05-19 04:17:57] [INFO ] Deduced a trap composed of 254 places in 181 ms of which 0 ms to minimize.
[2022-05-19 04:18:06] [INFO ] Trap strengthening (SAT) tested/added 29/29 trap constraints in 19122 ms
[2022-05-19 04:18:06] [INFO ] After 19270ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-05-19 04:18:06] [INFO ] After 19847ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 624/624 places, 840/840 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 624 transition count 794
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 578 transition count 794
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 92 place count 578 transition count 749
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 182 place count 533 transition count 749
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 532 transition count 748
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 532 transition count 748
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 188 place count 530 transition count 746
Applied a total of 188 rules in 130 ms. Remains 530 /624 variables (removed 94) and now considering 746/840 (removed 94) transitions.
[2022-05-19 04:18:06] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-19 04:18:06] [INFO ] Computed 97 place invariants in 13 ms
[2022-05-19 04:18:06] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/624 places, 746/840 transitions.
Incomplete random walk after 10000 steps, including 518 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 475290 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 475290 steps, saw 144060 distinct states, run finished after 3002 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 04:18:09] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-19 04:18:09] [INFO ] Computed 97 place invariants in 22 ms
[2022-05-19 04:18:10] [INFO ] [Real]Absence check using 90 positive place invariants in 18 ms returned sat
[2022-05-19 04:18:10] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 17 ms returned sat
[2022-05-19 04:18:10] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 04:18:10] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2022-05-19 04:18:10] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 17 ms returned sat
[2022-05-19 04:18:10] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 04:18:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:18:10] [INFO ] After 141ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 04:18:10] [INFO ] Deduced a trap composed of 179 places in 163 ms of which 1 ms to minimize.
[2022-05-19 04:18:10] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 1 ms to minimize.
[2022-05-19 04:18:11] [INFO ] Deduced a trap composed of 176 places in 159 ms of which 4 ms to minimize.
[2022-05-19 04:18:11] [INFO ] Deduced a trap composed of 179 places in 159 ms of which 0 ms to minimize.
[2022-05-19 04:18:11] [INFO ] Deduced a trap composed of 161 places in 156 ms of which 1 ms to minimize.
[2022-05-19 04:18:11] [INFO ] Deduced a trap composed of 179 places in 159 ms of which 0 ms to minimize.
[2022-05-19 04:18:11] [INFO ] Deduced a trap composed of 152 places in 160 ms of which 0 ms to minimize.
[2022-05-19 04:18:12] [INFO ] Deduced a trap composed of 161 places in 157 ms of which 1 ms to minimize.
[2022-05-19 04:18:12] [INFO ] Deduced a trap composed of 149 places in 156 ms of which 0 ms to minimize.
[2022-05-19 04:18:12] [INFO ] Deduced a trap composed of 167 places in 164 ms of which 0 ms to minimize.
[2022-05-19 04:18:12] [INFO ] Deduced a trap composed of 158 places in 157 ms of which 0 ms to minimize.
[2022-05-19 04:18:13] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 1 ms to minimize.
[2022-05-19 04:18:13] [INFO ] Deduced a trap composed of 167 places in 148 ms of which 1 ms to minimize.
[2022-05-19 04:18:13] [INFO ] Deduced a trap composed of 173 places in 150 ms of which 1 ms to minimize.
[2022-05-19 04:18:13] [INFO ] Deduced a trap composed of 158 places in 144 ms of which 1 ms to minimize.
[2022-05-19 04:18:13] [INFO ] Deduced a trap composed of 173 places in 150 ms of which 1 ms to minimize.
[2022-05-19 04:18:14] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 0 ms to minimize.
[2022-05-19 04:18:14] [INFO ] Deduced a trap composed of 179 places in 157 ms of which 0 ms to minimize.
[2022-05-19 04:18:14] [INFO ] Deduced a trap composed of 179 places in 158 ms of which 0 ms to minimize.
[2022-05-19 04:18:14] [INFO ] Deduced a trap composed of 161 places in 148 ms of which 1 ms to minimize.
[2022-05-19 04:18:14] [INFO ] Deduced a trap composed of 173 places in 149 ms of which 1 ms to minimize.
[2022-05-19 04:18:15] [INFO ] Deduced a trap composed of 170 places in 150 ms of which 1 ms to minimize.
[2022-05-19 04:18:15] [INFO ] Deduced a trap composed of 167 places in 163 ms of which 1 ms to minimize.
[2022-05-19 04:18:15] [INFO ] Deduced a trap composed of 170 places in 164 ms of which 1 ms to minimize.
[2022-05-19 04:18:16] [INFO ] Deduced a trap composed of 170 places in 159 ms of which 7 ms to minimize.
[2022-05-19 04:18:17] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 0 ms to minimize.
[2022-05-19 04:18:19] [INFO ] Deduced a trap composed of 173 places in 152 ms of which 1 ms to minimize.
[2022-05-19 04:18:19] [INFO ] Deduced a trap composed of 170 places in 144 ms of which 1 ms to minimize.
[2022-05-19 04:18:19] [INFO ] Deduced a trap composed of 161 places in 153 ms of which 1 ms to minimize.
[2022-05-19 04:18:20] [INFO ] Deduced a trap composed of 176 places in 159 ms of which 0 ms to minimize.
[2022-05-19 04:18:21] [INFO ] Deduced a trap composed of 167 places in 148 ms of which 0 ms to minimize.
[2022-05-19 04:18:30] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 19652 ms
[2022-05-19 04:18:30] [INFO ] After 19895ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-19 04:18:30] [INFO ] After 20245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 32 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 28 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2022-05-19 04:18:30] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-19 04:18:30] [INFO ] Computed 97 place invariants in 18 ms
[2022-05-19 04:18:30] [INFO ] Implicit Places using invariants in 436 ms returned []
[2022-05-19 04:18:30] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-19 04:18:30] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 04:18:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:18:32] [INFO ] Implicit Places using invariants and state equation in 1586 ms returned []
Implicit Place search using SMT with State Equation took 2027 ms to find 0 implicit places.
[2022-05-19 04:18:32] [INFO ] Redundant transitions in 47 ms returned []
[2022-05-19 04:18:32] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-19 04:18:32] [INFO ] Computed 97 place invariants in 16 ms
[2022-05-19 04:18:32] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 742
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 530 transition count 741
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 6 place count 529 transition count 741
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 529 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 528 transition count 740
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 528 transition count 735
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 523 transition count 735
Applied a total of 18 rules in 88 ms. Remains 523 /530 variables (removed 7) and now considering 735/746 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 735 rows 523 cols
[2022-05-19 04:18:32] [INFO ] Computed 97 place invariants in 14 ms
[2022-05-19 04:18:33] [INFO ] [Real]Absence check using 90 positive place invariants in 15 ms returned sat
[2022-05-19 04:18:33] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-19 04:18:33] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 04:18:33] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2022-05-19 04:18:33] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-19 04:18:33] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 04:18:33] [INFO ] Deduced a trap composed of 165 places in 165 ms of which 1 ms to minimize.
[2022-05-19 04:18:33] [INFO ] Deduced a trap composed of 150 places in 148 ms of which 1 ms to minimize.
[2022-05-19 04:18:34] [INFO ] Deduced a trap composed of 171 places in 160 ms of which 3 ms to minimize.
[2022-05-19 04:18:34] [INFO ] Deduced a trap composed of 183 places in 146 ms of which 2 ms to minimize.
[2022-05-19 04:18:34] [INFO ] Deduced a trap composed of 174 places in 148 ms of which 3 ms to minimize.
[2022-05-19 04:18:34] [INFO ] Deduced a trap composed of 165 places in 156 ms of which 0 ms to minimize.
[2022-05-19 04:18:34] [INFO ] Deduced a trap composed of 147 places in 161 ms of which 0 ms to minimize.
[2022-05-19 04:18:35] [INFO ] Deduced a trap composed of 162 places in 149 ms of which 1 ms to minimize.
[2022-05-19 04:18:35] [INFO ] Deduced a trap composed of 165 places in 143 ms of which 0 ms to minimize.
[2022-05-19 04:18:35] [INFO ] Deduced a trap composed of 171 places in 146 ms of which 0 ms to minimize.
[2022-05-19 04:18:35] [INFO ] Deduced a trap composed of 153 places in 146 ms of which 0 ms to minimize.
[2022-05-19 04:18:35] [INFO ] Deduced a trap composed of 171 places in 143 ms of which 1 ms to minimize.
[2022-05-19 04:18:35] [INFO ] Deduced a trap composed of 177 places in 148 ms of which 0 ms to minimize.
[2022-05-19 04:18:36] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 0 ms to minimize.
[2022-05-19 04:18:36] [INFO ] Deduced a trap composed of 171 places in 148 ms of which 1 ms to minimize.
[2022-05-19 04:18:36] [INFO ] Deduced a trap composed of 162 places in 152 ms of which 1 ms to minimize.
[2022-05-19 04:18:36] [INFO ] Deduced a trap composed of 168 places in 168 ms of which 0 ms to minimize.
[2022-05-19 04:18:37] [INFO ] Deduced a trap composed of 168 places in 146 ms of which 0 ms to minimize.
[2022-05-19 04:18:37] [INFO ] Deduced a trap composed of 174 places in 156 ms of which 0 ms to minimize.
[2022-05-19 04:18:37] [INFO ] Deduced a trap composed of 153 places in 147 ms of which 1 ms to minimize.
[2022-05-19 04:18:37] [INFO ] Deduced a trap composed of 162 places in 138 ms of which 0 ms to minimize.
[2022-05-19 04:18:37] [INFO ] Deduced a trap composed of 153 places in 147 ms of which 1 ms to minimize.
[2022-05-19 04:18:37] [INFO ] Deduced a trap composed of 183 places in 144 ms of which 0 ms to minimize.
[2022-05-19 04:18:38] [INFO ] Deduced a trap composed of 183 places in 142 ms of which 0 ms to minimize.
[2022-05-19 04:18:38] [INFO ] Deduced a trap composed of 171 places in 154 ms of which 1 ms to minimize.
[2022-05-19 04:18:38] [INFO ] Deduced a trap composed of 168 places in 137 ms of which 1 ms to minimize.
[2022-05-19 04:18:38] [INFO ] Deduced a trap composed of 162 places in 140 ms of which 1 ms to minimize.
[2022-05-19 04:18:38] [INFO ] Deduced a trap composed of 174 places in 148 ms of which 0 ms to minimize.
[2022-05-19 04:18:39] [INFO ] Deduced a trap composed of 159 places in 150 ms of which 1 ms to minimize.
[2022-05-19 04:18:39] [INFO ] Deduced a trap composed of 171 places in 138 ms of which 0 ms to minimize.
[2022-05-19 04:18:39] [INFO ] Deduced a trap composed of 168 places in 145 ms of which 1 ms to minimize.
[2022-05-19 04:18:39] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 0 ms to minimize.
[2022-05-19 04:18:40] [INFO ] Deduced a trap composed of 156 places in 145 ms of which 1 ms to minimize.
[2022-05-19 04:18:40] [INFO ] Deduced a trap composed of 165 places in 151 ms of which 0 ms to minimize.
[2022-05-19 04:18:40] [INFO ] Deduced a trap composed of 150 places in 144 ms of which 1 ms to minimize.
[2022-05-19 04:18:40] [INFO ] Deduced a trap composed of 165 places in 145 ms of which 1 ms to minimize.
[2022-05-19 04:18:40] [INFO ] Deduced a trap composed of 168 places in 159 ms of which 0 ms to minimize.
[2022-05-19 04:18:40] [INFO ] Deduced a trap composed of 177 places in 141 ms of which 1 ms to minimize.
[2022-05-19 04:18:41] [INFO ] Deduced a trap composed of 159 places in 145 ms of which 0 ms to minimize.
[2022-05-19 04:18:41] [INFO ] Deduced a trap composed of 153 places in 148 ms of which 0 ms to minimize.
[2022-05-19 04:18:41] [INFO ] Deduced a trap composed of 171 places in 138 ms of which 1 ms to minimize.
[2022-05-19 04:18:41] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 0 ms to minimize.
[2022-05-19 04:18:42] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 0 ms to minimize.
[2022-05-19 04:18:42] [INFO ] Deduced a trap composed of 168 places in 141 ms of which 0 ms to minimize.
[2022-05-19 04:18:42] [INFO ] Deduced a trap composed of 165 places in 145 ms of which 1 ms to minimize.
[2022-05-19 04:18:42] [INFO ] Deduced a trap composed of 162 places in 148 ms of which 1 ms to minimize.
[2022-05-19 04:18:42] [INFO ] Deduced a trap composed of 159 places in 132 ms of which 1 ms to minimize.
[2022-05-19 04:18:43] [INFO ] Deduced a trap composed of 168 places in 137 ms of which 0 ms to minimize.
[2022-05-19 04:18:43] [INFO ] Deduced a trap composed of 162 places in 144 ms of which 0 ms to minimize.
[2022-05-19 04:18:43] [INFO ] Deduced a trap composed of 159 places in 143 ms of which 0 ms to minimize.
[2022-05-19 04:18:43] [INFO ] Deduced a trap composed of 165 places in 142 ms of which 1 ms to minimize.
[2022-05-19 04:18:43] [INFO ] Deduced a trap composed of 162 places in 151 ms of which 0 ms to minimize.
[2022-05-19 04:18:44] [INFO ] Deduced a trap composed of 174 places in 165 ms of which 1 ms to minimize.
[2022-05-19 04:18:44] [INFO ] Deduced a trap composed of 171 places in 145 ms of which 1 ms to minimize.
[2022-05-19 04:18:44] [INFO ] Deduced a trap composed of 162 places in 143 ms of which 0 ms to minimize.
[2022-05-19 04:18:44] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 0 ms to minimize.
[2022-05-19 04:18:45] [INFO ] Deduced a trap composed of 168 places in 161 ms of which 1 ms to minimize.
[2022-05-19 04:18:45] [INFO ] Deduced a trap composed of 156 places in 161 ms of which 0 ms to minimize.
[2022-05-19 04:18:45] [INFO ] Deduced a trap composed of 165 places in 157 ms of which 0 ms to minimize.
[2022-05-19 04:18:45] [INFO ] Deduced a trap composed of 159 places in 163 ms of which 0 ms to minimize.
[2022-05-19 04:18:45] [INFO ] Deduced a trap composed of 168 places in 163 ms of which 1 ms to minimize.
[2022-05-19 04:18:46] [INFO ] Deduced a trap composed of 171 places in 151 ms of which 0 ms to minimize.
[2022-05-19 04:18:46] [INFO ] Deduced a trap composed of 168 places in 161 ms of which 0 ms to minimize.
[2022-05-19 04:18:46] [INFO ] Deduced a trap composed of 162 places in 163 ms of which 1 ms to minimize.
[2022-05-19 04:18:47] [INFO ] Deduced a trap composed of 165 places in 165 ms of which 1 ms to minimize.
[2022-05-19 04:18:47] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 1 ms to minimize.
[2022-05-19 04:18:47] [INFO ] Deduced a trap composed of 165 places in 165 ms of which 0 ms to minimize.
[2022-05-19 04:18:47] [INFO ] Deduced a trap composed of 162 places in 163 ms of which 0 ms to minimize.
[2022-05-19 04:18:48] [INFO ] Deduced a trap composed of 165 places in 164 ms of which 1 ms to minimize.
[2022-05-19 04:18:48] [INFO ] Deduced a trap composed of 171 places in 164 ms of which 0 ms to minimize.
[2022-05-19 04:18:48] [INFO ] Deduced a trap composed of 153 places in 170 ms of which 1 ms to minimize.
[2022-05-19 04:18:48] [INFO ] Deduced a trap composed of 165 places in 163 ms of which 1 ms to minimize.
[2022-05-19 04:18:49] [INFO ] Deduced a trap composed of 171 places in 141 ms of which 0 ms to minimize.
[2022-05-19 04:18:49] [INFO ] Deduced a trap composed of 156 places in 144 ms of which 0 ms to minimize.
[2022-05-19 04:18:50] [INFO ] Deduced a trap composed of 162 places in 143 ms of which 1 ms to minimize.
[2022-05-19 04:18:50] [INFO ] Deduced a trap composed of 159 places in 164 ms of which 0 ms to minimize.
[2022-05-19 04:18:51] [INFO ] Deduced a trap composed of 150 places in 160 ms of which 0 ms to minimize.
[2022-05-19 04:18:51] [INFO ] Deduced a trap composed of 156 places in 158 ms of which 1 ms to minimize.
[2022-05-19 04:18:52] [INFO ] Deduced a trap composed of 156 places in 159 ms of which 0 ms to minimize.
[2022-05-19 04:18:53] [INFO ] Deduced a trap composed of 168 places in 161 ms of which 0 ms to minimize.
[2022-05-19 04:18:53] [INFO ] Deduced a trap composed of 156 places in 153 ms of which 1 ms to minimize.
[2022-05-19 04:18:53] [INFO ] Deduced a trap composed of 165 places in 163 ms of which 0 ms to minimize.
[2022-05-19 04:18:53] [INFO ] Deduced a trap composed of 156 places in 157 ms of which 1 ms to minimize.
[2022-05-19 04:18:54] [INFO ] Deduced a trap composed of 168 places in 161 ms of which 0 ms to minimize.
[2022-05-19 04:18:54] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 1 ms to minimize.
[2022-05-19 04:18:55] [INFO ] Deduced a trap composed of 168 places in 147 ms of which 0 ms to minimize.
[2022-05-19 04:18:56] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 1 ms to minimize.
[2022-05-19 04:18:58] [INFO ] Deduced a trap composed of 156 places in 160 ms of which 1 ms to minimize.
[2022-05-19 04:18:58] [INFO ] Deduced a trap composed of 171 places in 146 ms of which 0 ms to minimize.
[2022-05-19 04:18:58] [INFO ] Deduced a trap composed of 162 places in 142 ms of which 1 ms to minimize.
[2022-05-19 04:18:58] [INFO ] Deduced a trap composed of 156 places in 144 ms of which 0 ms to minimize.
[2022-05-19 04:18:59] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 1 ms to minimize.
[2022-05-19 04:18:59] [INFO ] Deduced a trap composed of 156 places in 142 ms of which 0 ms to minimize.
[2022-05-19 04:18:59] [INFO ] Deduced a trap composed of 165 places in 152 ms of which 0 ms to minimize.
[2022-05-19 04:18:59] [INFO ] Deduced a trap composed of 171 places in 143 ms of which 0 ms to minimize.
[2022-05-19 04:18:59] [INFO ] Deduced a trap composed of 153 places in 147 ms of which 0 ms to minimize.
[2022-05-19 04:19:00] [INFO ] Deduced a trap composed of 153 places in 162 ms of which 0 ms to minimize.
[2022-05-19 04:19:00] [INFO ] Deduced a trap composed of 183 places in 141 ms of which 1 ms to minimize.
[2022-05-19 04:19:00] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 1 ms to minimize.
[2022-05-19 04:19:00] [INFO ] Deduced a trap composed of 150 places in 149 ms of which 0 ms to minimize.
[2022-05-19 04:19:01] [INFO ] Deduced a trap composed of 171 places in 139 ms of which 0 ms to minimize.
[2022-05-19 04:19:01] [INFO ] Deduced a trap composed of 162 places in 145 ms of which 0 ms to minimize.
[2022-05-19 04:19:02] [INFO ] Deduced a trap composed of 169 places in 150 ms of which 1 ms to minimize.
[2022-05-19 04:19:03] [INFO ] Deduced a trap composed of 153 places in 141 ms of which 0 ms to minimize.
[2022-05-19 04:19:03] [INFO ] Deduced a trap composed of 165 places in 146 ms of which 0 ms to minimize.
[2022-05-19 04:19:03] [INFO ] Deduced a trap composed of 171 places in 170 ms of which 1 ms to minimize.
[2022-05-19 04:19:03] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 1 ms to minimize.
[2022-05-19 04:19:04] [INFO ] Deduced a trap composed of 168 places in 132 ms of which 1 ms to minimize.
[2022-05-19 04:19:04] [INFO ] Deduced a trap composed of 159 places in 150 ms of which 0 ms to minimize.
[2022-05-19 04:19:05] [INFO ] Deduced a trap composed of 171 places in 144 ms of which 0 ms to minimize.
[2022-05-19 04:19:05] [INFO ] Deduced a trap composed of 177 places in 137 ms of which 1 ms to minimize.
[2022-05-19 04:19:05] [INFO ] Deduced a trap composed of 153 places in 161 ms of which 0 ms to minimize.
[2022-05-19 04:19:07] [INFO ] Deduced a trap composed of 162 places in 145 ms of which 1 ms to minimize.
[2022-05-19 04:19:07] [INFO ] Deduced a trap composed of 165 places in 146 ms of which 1 ms to minimize.
[2022-05-19 04:19:10] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 1 ms to minimize.
[2022-05-19 04:19:11] [INFO ] Deduced a trap composed of 159 places in 148 ms of which 0 ms to minimize.
[2022-05-19 04:19:11] [INFO ] Deduced a trap composed of 165 places in 146 ms of which 0 ms to minimize.
[2022-05-19 04:19:12] [INFO ] Deduced a trap composed of 183 places in 166 ms of which 0 ms to minimize.
[2022-05-19 04:19:12] [INFO ] Deduced a trap composed of 165 places in 152 ms of which 0 ms to minimize.
[2022-05-19 04:19:14] [INFO ] Deduced a trap composed of 177 places in 138 ms of which 1 ms to minimize.
[2022-05-19 04:19:23] [INFO ] Trap strengthening (SAT) tested/added 120/120 trap constraints in 49859 ms
[2022-05-19 04:19:23] [INFO ] After 50273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-19 04:19:23] [INFO ] After 50371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-19 04:19:23] [INFO ] Flatten gal took : 51 ms
[2022-05-19 04:19:23] [INFO ] Flatten gal took : 46 ms
[2022-05-19 04:19:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1703838677961793090.gal : 24 ms
[2022-05-19 04:19:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1418600336323904633.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16028879493266196303;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1703838677961793090.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1418600336323904633.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality1418600336323904633.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 21
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :21 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 29
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :29 after 31
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :31 after 33
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :33 after 37
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :37 after 51
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :51 after 95
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :95 after 1501
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1501 after 1759
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1759 after 2570
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2570 after 3664
Detected timeout of ITS tools.
[2022-05-19 04:19:38] [INFO ] Flatten gal took : 55 ms
[2022-05-19 04:19:38] [INFO ] Applying decomposition
[2022-05-19 04:19:38] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15829268941482211364.txt' '-o' '/tmp/graph15829268941482211364.bin' '-w' '/tmp/graph15829268941482211364.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15829268941482211364.bin' '-l' '-1' '-v' '-w' '/tmp/graph15829268941482211364.weights' '-q' '0' '-e' '0.001'
[2022-05-19 04:19:39] [INFO ] Decomposing Gal with order
[2022-05-19 04:19:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 04:19:39] [INFO ] Removed a total of 936 redundant transitions.
[2022-05-19 04:19:39] [INFO ] Flatten gal took : 165 ms
[2022-05-19 04:19:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 219 labels/synchronizations in 28 ms.
[2022-05-19 04:19:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15161634613715465574.gal : 9 ms
[2022-05-19 04:19:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13025541838814867328.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16028879493266196303;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15161634613715465574.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13025541838814867328.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality13025541838814867328.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16695358303552456969
[2022-05-19 04:19:54] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16695358303552456969
Running compilation step : cd /tmp/ltsmin16695358303552456969;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1806 ms.
Running link step : cd /tmp/ltsmin16695358303552456969;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16695358303552456969;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&F(p1))))))'
Support contains 42 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 15 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2022-05-19 04:20:10] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:10] [INFO ] Computed 97 place invariants in 11 ms
[2022-05-19 04:20:11] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
[2022-05-19 04:20:11] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:11] [INFO ] Computed 97 place invariants in 13 ms
[2022-05-19 04:20:11] [INFO ] Implicit Places using invariants in 549 ms returned []
[2022-05-19 04:20:11] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:11] [INFO ] Computed 97 place invariants in 12 ms
[2022-05-19 04:20:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:20:14] [INFO ] Implicit Places using invariants and state equation in 3285 ms returned []
Implicit Place search using SMT with State Equation took 3840 ms to find 0 implicit places.
[2022-05-19 04:20:14] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:14] [INFO ] Computed 97 place invariants in 15 ms
[2022-05-19 04:20:15] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (LT s1 1) (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1) (LT s6 1) (LT s7 1) (LT s8 1) (LT s9 1) (LT s10 1) (LT s11 1) (LT s12 1) (LT s13 1) (LT s14 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 681 ms.
Product exploration explored 100000 steps with 33333 reset in 585 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 p1 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-00 finished in 7339 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0 U !(F(p0)||!p1))))))'
Support contains 253 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 10 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2022-05-19 04:20:17] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:17] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 04:20:18] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
[2022-05-19 04:20:18] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:18] [INFO ] Computed 97 place invariants in 12 ms
[2022-05-19 04:20:18] [INFO ] Implicit Places using invariants in 356 ms returned []
[2022-05-19 04:20:18] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:18] [INFO ] Computed 97 place invariants in 18 ms
[2022-05-19 04:20:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:20:21] [INFO ] Implicit Places using invariants and state equation in 2912 ms returned []
Implicit Place search using SMT with State Equation took 3270 ms to find 0 implicit places.
[2022-05-19 04:20:21] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:21] [INFO ] Computed 97 place invariants in 18 ms
[2022-05-19 04:20:22] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 223 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(OR (AND (GEQ s263 1) (GEQ s267 2) (GEQ s269 8)) (AND (GEQ s263 1) (GEQ s265 1) (GEQ s268 1) (GEQ s269 8)) (AND (GEQ s263 1) (GEQ s265 1) (GEQ s266 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-01 finished in 4940 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 44 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2022-05-19 04:20:22] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:22] [INFO ] Computed 97 place invariants in 19 ms
[2022-05-19 04:20:23] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
[2022-05-19 04:20:23] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:23] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 04:20:23] [INFO ] Implicit Places using invariants in 509 ms returned []
[2022-05-19 04:20:23] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:23] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 04:20:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:20:26] [INFO ] Implicit Places using invariants and state equation in 3143 ms returned []
Implicit Place search using SMT with State Equation took 3654 ms to find 0 implicit places.
[2022-05-19 04:20:26] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:26] [INFO ] Computed 97 place invariants in 19 ms
[2022-05-19 04:20:27] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s533 1) (GEQ s620 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-02 finished in 5242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 624 transition count 794
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 578 transition count 794
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 92 place count 578 transition count 749
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 182 place count 533 transition count 749
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 532 transition count 748
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 532 transition count 748
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 188 place count 530 transition count 746
Applied a total of 188 rules in 73 ms. Remains 530 /624 variables (removed 94) and now considering 746/840 (removed 94) transitions.
[2022-05-19 04:20:27] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-19 04:20:27] [INFO ] Computed 97 place invariants in 13 ms
[2022-05-19 04:20:27] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
[2022-05-19 04:20:27] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-19 04:20:27] [INFO ] Computed 97 place invariants in 15 ms
[2022-05-19 04:20:28] [INFO ] Implicit Places using invariants in 481 ms returned []
[2022-05-19 04:20:28] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-19 04:20:28] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 04:20:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:20:30] [INFO ] Implicit Places using invariants and state equation in 1808 ms returned []
Implicit Place search using SMT with State Equation took 2292 ms to find 0 implicit places.
[2022-05-19 04:20:30] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-19 04:20:30] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-19 04:20:30] [INFO ] Computed 97 place invariants in 14 ms
[2022-05-19 04:20:30] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 530/624 places, 746/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/624 places, 746/840 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J40-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:(GEQ s257 2)], 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 21 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-03 finished in 3313 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(!(p0 U (F(X(!p0)) U !p1))))))'
Support contains 41 out of 624 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 835
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 619 transition count 835
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 619 transition count 831
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 615 transition count 831
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 614 transition count 830
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 614 transition count 830
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 24 place count 612 transition count 828
Applied a total of 24 rules in 56 ms. Remains 612 /624 variables (removed 12) and now considering 828/840 (removed 12) transitions.
[2022-05-19 04:20:30] [INFO ] Flow matrix only has 824 transitions (discarded 4 similar events)
// Phase 1: matrix 824 rows 612 cols
[2022-05-19 04:20:30] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 04:20:31] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
[2022-05-19 04:20:31] [INFO ] Flow matrix only has 824 transitions (discarded 4 similar events)
// Phase 1: matrix 824 rows 612 cols
[2022-05-19 04:20:31] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 04:20:31] [INFO ] Implicit Places using invariants in 393 ms returned []
[2022-05-19 04:20:31] [INFO ] Flow matrix only has 824 transitions (discarded 4 similar events)
// Phase 1: matrix 824 rows 612 cols
[2022-05-19 04:20:31] [INFO ] Computed 97 place invariants in 22 ms
[2022-05-19 04:20:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:20:33] [INFO ] Implicit Places using invariants and state equation in 2142 ms returned []
Implicit Place search using SMT with State Equation took 2539 ms to find 0 implicit places.
[2022-05-19 04:20:33] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-19 04:20:33] [INFO ] Flow matrix only has 824 transitions (discarded 4 similar events)
// Phase 1: matrix 824 rows 612 cols
[2022-05-19 04:20:33] [INFO ] Computed 97 place invariants in 14 ms
[2022-05-19 04:20:34] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 612/624 places, 828/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 612/624 places, 828/840 transitions.
Stuttering acceptance computed with spot in 481 ms :[(NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (GEQ s571 1) (GEQ s570 1) (GEQ s573 1) (GEQ s572 1) (GEQ s575 1) (GEQ s574 1) (GEQ s577 1) (GEQ s576 1) (GEQ s569 1) (GEQ s568 1) (GEQ s587 1) (GEQ...], 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 7 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-04 finished in 4228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U X(p0)))'
Support contains 2 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Applied a total of 0 rules in 10 ms. Remains 624 /624 variables (removed 0) and now considering 840/840 (removed 0) transitions.
[2022-05-19 04:20:35] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 04:20:35] [INFO ] Computed 97 place invariants in 11 ms
[2022-05-19 04:20:35] [INFO ] Dead Transitions using invariants and state equation in 580 ms found 0 transitions.
[2022-05-19 04:20:35] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 04:20:35] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 04:20:36] [INFO ] Implicit Places using invariants in 526 ms returned []
[2022-05-19 04:20:36] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 04:20:36] [INFO ] Computed 97 place invariants in 17 ms
[2022-05-19 04:20:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:20:38] [INFO ] Implicit Places using invariants and state equation in 2004 ms returned []
Implicit Place search using SMT with State Equation took 2533 ms to find 0 implicit places.
[2022-05-19 04:20:38] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 04:20:38] [INFO ] Computed 97 place invariants in 14 ms
[2022-05-19 04:20:38] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 624/624 places, 840/840 transitions.
Stuttering acceptance computed with spot in 714 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s622 1) (LT s260 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 581 ms.
Product exploration explored 100000 steps with 50000 reset in 609 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), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-05 finished in 5703 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(G(p0)||!(X(G(p1)) U p2)))))'
Support contains 93 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 17 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2022-05-19 04:20:40] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:40] [INFO ] Computed 97 place invariants in 14 ms
[2022-05-19 04:20:41] [INFO ] Dead Transitions using invariants and state equation in 731 ms found 0 transitions.
[2022-05-19 04:20:41] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:41] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 04:20:41] [INFO ] Implicit Places using invariants in 395 ms returned []
[2022-05-19 04:20:41] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:41] [INFO ] Computed 97 place invariants in 11 ms
[2022-05-19 04:20:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:20:44] [INFO ] Implicit Places using invariants and state equation in 2866 ms returned []
Implicit Place search using SMT with State Equation took 3266 ms to find 0 implicit places.
[2022-05-19 04:20:44] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:44] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 04:20:45] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 400 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p0 (NOT p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={1} source=0 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=2 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 6}, { cond=(AND p0 p2 p1), acceptance={0, 1} source=2 dest: 7}, { cond=(AND p0 p2 p1), acceptance={1} source=2 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=3 dest: 5}, { cond=(AND p0 p2 p1), acceptance={1} source=3 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=5 dest: 5}, { cond=(OR (AND p0 p1) (AND (NOT p2) p1)), acceptance={0, 1} source=5 dest: 7}, { cond=(AND p0 p2 p1), acceptance={1} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=6 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=7 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=8 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=8 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=8 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=8 dest: 7}, { cond=(AND p0 p2 p1), acceptance={1} source=8 dest: 8}]], initial=0, aps=[p0:(AND (OR (LT s42 1) (LT s127 1) (LT s167 1)) (OR (LT s42 1) (LT s127 1) (LT s168 1)) (OR (LT s42 1) (LT s127 1) (LT s169 1)) (OR (LT s42 1) (LT s127 1)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1372 ms.
Product exploration explored 100000 steps with 50000 reset in 1403 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 p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (OR p0 (NOT p2))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (OR (AND p0 p1) (AND (NOT p2) p1))))), (X (X (OR p0 (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p2) (NOT p1))
Knowledge based reduction with 20 factoid took 1180 ms. Reduced automaton from 9 states, 40 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-07 finished in 9084 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (!(X(p0)&&!p2)||F(p2)||p1)))'
Support contains 42 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 17 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2022-05-19 04:20:49] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:49] [INFO ] Computed 97 place invariants in 18 ms
[2022-05-19 04:20:50] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
[2022-05-19 04:20:50] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:50] [INFO ] Computed 97 place invariants in 20 ms
[2022-05-19 04:20:51] [INFO ] Implicit Places using invariants in 512 ms returned []
[2022-05-19 04:20:51] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:51] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 04:20:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:20:54] [INFO ] Implicit Places using invariants and state equation in 3625 ms returned []
Implicit Place search using SMT with State Equation took 4139 ms to find 0 implicit places.
[2022-05-19 04:20:54] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:20:54] [INFO ] Computed 97 place invariants in 16 ms
[2022-05-19 04:20:55] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (GEQ s580 1) (GEQ s579 1) (GEQ s582 1) (GEQ s581 1) (GEQ s584 1) (GEQ s583 1) (GEQ s586 1) (GEQ s585 1) (GEQ s578 1) (GEQ s577 1) (GEQ s596 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 894 ms.
Product exploration explored 100000 steps with 50000 reset in 902 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p0)))
Knowledge based reduction with 7 factoid took 115 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-09 finished in 7705 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U (G(p2)&&p1))||(G(p3)&&p3))))'
Support contains 3 out of 624 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 624 transition count 794
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 578 transition count 794
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 92 place count 578 transition count 750
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 180 place count 534 transition count 750
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 533 transition count 749
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 533 transition count 749
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 186 place count 531 transition count 747
Applied a total of 186 rules in 44 ms. Remains 531 /624 variables (removed 93) and now considering 747/840 (removed 93) transitions.
[2022-05-19 04:20:57] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:20:57] [INFO ] Computed 97 place invariants in 8 ms
[2022-05-19 04:20:57] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
[2022-05-19 04:20:57] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:20:57] [INFO ] Computed 97 place invariants in 8 ms
[2022-05-19 04:20:58] [INFO ] Implicit Places using invariants in 425 ms returned []
[2022-05-19 04:20:58] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:20:58] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 04:20:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:21:00] [INFO ] Implicit Places using invariants and state equation in 2076 ms returned []
Implicit Place search using SMT with State Equation took 2502 ms to find 0 implicit places.
[2022-05-19 04:21:00] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-19 04:21:00] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:21:00] [INFO ] Computed 97 place invariants in 14 ms
[2022-05-19 04:21:00] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 531/624 places, 747/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 531/624 places, 747/840 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 (NOT p1)) (AND p3 (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p3 p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p1 p2), acceptance={1} source=0 dest: 1}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p3 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p3:(OR (LT s526 1) (LT s529 1)), p1:(AND (GEQ s526 1) (GEQ s530 10)), p2:(AND (GEQ s526 1) (GEQ s530 10))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6162 reset in 451 ms.
Product exploration explored 100000 steps with 6120 reset in 454 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 p3 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) p2))), (X (NOT (OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p3) p1 p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p3) p1 p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (AND p3 p1 p2)), (X (NOT (AND p3 p1 p2))), (X (AND p3 p2)), (X (NOT (AND p3 p2))), (X (OR (AND p3 (NOT p1)) (AND p3 (NOT p2)))), (X (NOT (OR (AND p3 (NOT p1)) (AND p3 (NOT p2))))), (X (AND p3 (NOT p2))), (X (NOT (AND p3 (NOT p2)))), (X (X (AND p3 p1 p2))), (X (X (NOT (AND p3 p1 p2)))), (X (X (AND p3 p2))), (X (X (NOT (AND p3 p2)))), (X (X (OR (AND p3 (NOT p1)) (AND p3 (NOT p2))))), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p3 (NOT p2)))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2)))))]
Knowledge based reduction with 9 factoid took 560 ms. Reduced automaton from 2 states, 8 edges and 3 AP to 2 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 568 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-19 04:21:02] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:21:02] [INFO ] Computed 97 place invariants in 8 ms
[2022-05-19 04:21:02] [INFO ] [Real]Absence check using 90 positive place invariants in 20 ms returned sat
[2022-05-19 04:21:02] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-19 04:21:02] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) p2))), (X (NOT (OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p3) p1 p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p3) p1 p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (G (NOT (AND p1 p2 (NOT p3)))), (G (NOT (AND p2 (NOT p3))))]
False Knowledge obtained : [(X (AND p3 p1 p2)), (X (NOT (AND p3 p1 p2))), (X (AND p3 p2)), (X (NOT (AND p3 p2))), (X (OR (AND p3 (NOT p1)) (AND p3 (NOT p2)))), (X (NOT (OR (AND p3 (NOT p1)) (AND p3 (NOT p2))))), (X (AND p3 (NOT p2))), (X (NOT (AND p3 (NOT p2)))), (X (X (AND p3 p1 p2))), (X (X (NOT (AND p3 p1 p2)))), (X (X (AND p3 p2))), (X (X (NOT (AND p3 p2)))), (X (X (OR (AND p3 (NOT p1)) (AND p3 (NOT p2))))), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p3 (NOT p2)))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (F (NOT (AND (NOT p2) p3))), (F (AND p2 p3)), (F (AND (NOT p2) (NOT p3))), (F (NOT (OR (AND (NOT p1) p3) (AND (NOT p2) p3)))), (F (AND p1 p2 p3)), (F (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 11 factoid took 834 ms. Reduced automaton from 2 states, 8 edges and 3 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p3)]
Support contains 2 out of 531 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 17 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2022-05-19 04:21:03] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:21:03] [INFO ] Computed 97 place invariants in 17 ms
[2022-05-19 04:21:04] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
[2022-05-19 04:21:04] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:21:04] [INFO ] Computed 97 place invariants in 12 ms
[2022-05-19 04:21:04] [INFO ] Implicit Places using invariants in 421 ms returned []
[2022-05-19 04:21:04] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:21:04] [INFO ] Computed 97 place invariants in 16 ms
[2022-05-19 04:21:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:21:06] [INFO ] Implicit Places using invariants and state equation in 2283 ms returned []
Implicit Place search using SMT with State Equation took 2707 ms to find 0 implicit places.
[2022-05-19 04:21:06] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-19 04:21:06] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:21:06] [INFO ] Computed 97 place invariants in 12 ms
[2022-05-19 04:21:07] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 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 : [p3, (X p3), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p3)]
Finished random walk after 82 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Knowledge obtained : [p3, (X p3), (X (X p3))]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p3)]
Product exploration explored 100000 steps with 6165 reset in 400 ms.
Product exploration explored 100000 steps with 6155 reset in 419 ms.
Built C files in :
/tmp/ltsmin7608690842482605197
[2022-05-19 04:21:08] [INFO ] Computing symmetric may disable matrix : 747 transitions.
[2022-05-19 04:21:08] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:21:08] [INFO ] Computing symmetric may enable matrix : 747 transitions.
[2022-05-19 04:21:08] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:21:08] [INFO ] Computing Do-Not-Accords matrix : 747 transitions.
[2022-05-19 04:21:08] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:21:08] [INFO ] Built C files in 135ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7608690842482605197
Running compilation step : cd /tmp/ltsmin7608690842482605197;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2129 ms.
Running link step : cd /tmp/ltsmin7608690842482605197;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin7608690842482605197;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14527952812798387613.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 15 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2022-05-19 04:21:23] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:21:23] [INFO ] Computed 97 place invariants in 15 ms
[2022-05-19 04:21:24] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
[2022-05-19 04:21:24] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:21:24] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 04:21:24] [INFO ] Implicit Places using invariants in 436 ms returned []
[2022-05-19 04:21:24] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:21:24] [INFO ] Computed 97 place invariants in 14 ms
[2022-05-19 04:21:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:21:26] [INFO ] Implicit Places using invariants and state equation in 2010 ms returned []
Implicit Place search using SMT with State Equation took 2447 ms to find 0 implicit places.
[2022-05-19 04:21:26] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-19 04:21:26] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:21:26] [INFO ] Computed 97 place invariants in 12 ms
[2022-05-19 04:21:26] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Built C files in :
/tmp/ltsmin13234158246885093242
[2022-05-19 04:21:27] [INFO ] Computing symmetric may disable matrix : 747 transitions.
[2022-05-19 04:21:27] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:21:27] [INFO ] Computing symmetric may enable matrix : 747 transitions.
[2022-05-19 04:21:27] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:21:27] [INFO ] Computing Do-Not-Accords matrix : 747 transitions.
[2022-05-19 04:21:27] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:21:27] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13234158246885093242
Running compilation step : cd /tmp/ltsmin13234158246885093242;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2060 ms.
Running link step : cd /tmp/ltsmin13234158246885093242;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin13234158246885093242;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12557386644365803307.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 04:21:42] [INFO ] Flatten gal took : 37 ms
[2022-05-19 04:21:42] [INFO ] Flatten gal took : 34 ms
[2022-05-19 04:21:42] [INFO ] Time to serialize gal into /tmp/LTL15320327310747681155.gal : 5 ms
[2022-05-19 04:21:42] [INFO ] Time to serialize properties into /tmp/LTL7147025501029187880.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15320327310747681155.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7147025501029187880.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1532032...267
Read 1 LTL properties
Checking formula 0 : !((F((("((((((((NotifyEventJobQueuedB_34>=1)&&(cJobCnt_0>=1))||((NotifyEventJobQueuedB_39>=1)&&(cJobCnt_0>=1)))||(((NotifyEventJobQueu...2281
Formula 0 simplified : !F(("((((((((NotifyEventJobQueuedB_34>=1)&&(cJobCnt_0>=1))||((NotifyEventJobQueuedB_39>=1)&&(cJobCnt_0>=1)))||(((NotifyEventJobQueue...2267
Detected timeout of ITS tools.
[2022-05-19 04:21:57] [INFO ] Flatten gal took : 32 ms
[2022-05-19 04:21:57] [INFO ] Applying decomposition
[2022-05-19 04:21:57] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17833278925173245609.txt' '-o' '/tmp/graph17833278925173245609.bin' '-w' '/tmp/graph17833278925173245609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17833278925173245609.bin' '-l' '-1' '-v' '-w' '/tmp/graph17833278925173245609.weights' '-q' '0' '-e' '0.001'
[2022-05-19 04:21:57] [INFO ] Decomposing Gal with order
[2022-05-19 04:21:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 04:21:57] [INFO ] Removed a total of 844 redundant transitions.
[2022-05-19 04:21:57] [INFO ] Flatten gal took : 124 ms
[2022-05-19 04:21:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 15 ms.
[2022-05-19 04:21:57] [INFO ] Time to serialize gal into /tmp/LTL12399330147107509191.gal : 7 ms
[2022-05-19 04:21:57] [INFO ] Time to serialize properties into /tmp/LTL13827688498657779178.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12399330147107509191.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13827688498657779178.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1239933...247
Read 1 LTL properties
Checking formula 0 : !((F((("((((((((i13.u39.NotifyEventJobQueuedB_34>=1)&&(u44.cJobCnt_0>=1))||((i29.u16.NotifyEventJobQueuedB_39>=1)&&(u44.cJobCnt_0>=1))...2709
Formula 0 simplified : !F(("((((((((i13.u39.NotifyEventJobQueuedB_34>=1)&&(u44.cJobCnt_0>=1))||((i29.u16.NotifyEventJobQueuedB_39>=1)&&(u44.cJobCnt_0>=1)))...2695
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11022045562373831370
[2022-05-19 04:22:12] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11022045562373831370
Running compilation step : cd /tmp/ltsmin11022045562373831370;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1466 ms.
Running link step : cd /tmp/ltsmin11022045562373831370;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11022045562373831370;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((((LTLAPp0==true) U ([]((LTLAPp2==true))&&(LTLAPp1==true)))||([]((LTLAPp3==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-10 finished in 90303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(X(X(p0)))))||(G(p1)&&(F(p2)||F(p3)))))'
Support contains 52 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 14 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2022-05-19 04:22:27] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:22:27] [INFO ] Computed 97 place invariants in 15 ms
[2022-05-19 04:22:28] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
[2022-05-19 04:22:28] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:22:28] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 04:22:29] [INFO ] Implicit Places using invariants in 441 ms returned []
[2022-05-19 04:22:29] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:22:29] [INFO ] Computed 97 place invariants in 15 ms
[2022-05-19 04:22:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:22:32] [INFO ] Implicit Places using invariants and state equation in 3228 ms returned []
Implicit Place search using SMT with State Equation took 3671 ms to find 0 implicit places.
[2022-05-19 04:22:32] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:22:32] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 04:22:32] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 698 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p1 (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p3 p1 (NOT p0)) (AND p1 p2 (NOT p0))), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 12}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 12}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 12}], [{ cond=(OR (AND p3 p1) (AND p1 p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 11}], [{ cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(OR (AND p3 p1) (AND p1 p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 12}], [{ cond=p1, acceptance={} source=5 dest: 6}, { cond=(NOT p1), acceptance={} source=5 dest: 10}], [{ cond=p1, acceptance={} source=6 dest: 1}, { cond=(NOT p1), acceptance={} source=6 dest: 11}], [{ cond=true, acceptance={} source=7 dest: 10}], [{ cond=(OR (AND p3 p1) (AND p1 p2)), acceptance={} source=8 dest: 5}, { cond=(NOT p1), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=9 dest: 3}, { cond=(OR (AND p3 p1) (AND p1 p2)), acceptance={} source=9 dest: 6}, { cond=(NOT p1), acceptance={} source=9 dest: 10}], [{ cond=true, acceptance={} source=10 dest: 11}], [{ cond=true, acceptance={} source=11 dest: 12}], [{ cond=(NOT p0), acceptance={0} source=12 dest: 12}]], initial=8, aps=[p3:(GEQ s260 2), p1:(OR (AND (GEQ s263 1) (GEQ s265 1) (GEQ s269 9)) (AND (GEQ s263 1) (GEQ s266 1) (GEQ s269 9)) (AND (GEQ s263 1) (GEQ s267 1) (GEQ s269...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-11 finished in 5816 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(!(X(G(p0)) U !p0)))))'
Support contains 2 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 22 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2022-05-19 04:22:33] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:22:33] [INFO ] Computed 97 place invariants in 14 ms
[2022-05-19 04:22:34] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
[2022-05-19 04:22:34] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:22:34] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 04:22:34] [INFO ] Implicit Places using invariants in 530 ms returned []
[2022-05-19 04:22:34] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:22:34] [INFO ] Computed 97 place invariants in 16 ms
[2022-05-19 04:22:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:22:38] [INFO ] Implicit Places using invariants and state equation in 3964 ms returned []
Implicit Place search using SMT with State Equation took 4500 ms to find 0 implicit places.
[2022-05-19 04:22:38] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:22:38] [INFO ] Computed 97 place invariants in 15 ms
[2022-05-19 04:22:39] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-12 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:(AND (GEQ s214 1) (GEQ s483 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-12 finished in 6039 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(X((p0 U p1)) U !(F(p3)||p2)))))'
Support contains 43 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 26 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2022-05-19 04:22:39] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:22:39] [INFO ] Computed 97 place invariants in 13 ms
[2022-05-19 04:22:40] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
[2022-05-19 04:22:40] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:22:40] [INFO ] Computed 97 place invariants in 15 ms
[2022-05-19 04:22:40] [INFO ] Implicit Places using invariants in 511 ms returned []
[2022-05-19 04:22:40] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:22:40] [INFO ] Computed 97 place invariants in 13 ms
[2022-05-19 04:22:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:22:43] [INFO ] Implicit Places using invariants and state equation in 2734 ms returned []
Implicit Place search using SMT with State Equation took 3246 ms to find 0 implicit places.
[2022-05-19 04:22:43] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:22:43] [INFO ] Computed 97 place invariants in 14 ms
[2022-05-19 04:22:44] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3) p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p2:(OR (GEQ s580 1) (GEQ s579 1) (GEQ s582 1) (GEQ s581 1) (GEQ s584 1) (GEQ s583 1) (GEQ s586 1) (GEQ s585 1) (GEQ s578 1) (GEQ s577 1) (GEQ s596 1) (GEQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 71 steps with 8 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-13 finished in 4844 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((F(p0)&&p1)))||G(!p1)))'
Support contains 42 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 16 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2022-05-19 04:22:44] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:22:44] [INFO ] Computed 97 place invariants in 13 ms
[2022-05-19 04:22:45] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
[2022-05-19 04:22:45] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:22:45] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 04:22:45] [INFO ] Implicit Places using invariants in 526 ms returned []
[2022-05-19 04:22:45] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:22:45] [INFO ] Computed 97 place invariants in 14 ms
[2022-05-19 04:22:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:22:48] [INFO ] Implicit Places using invariants and state equation in 3118 ms returned []
Implicit Place search using SMT with State Equation took 3646 ms to find 0 implicit places.
[2022-05-19 04:22:48] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 04:22:48] [INFO ] Computed 97 place invariants in 8 ms
[2022-05-19 04:22:49] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : PolyORBNT-COL-S05J40-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (LT s1 1) (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1) (LT s6 1) (LT s7 1) (LT s8 1) (LT s9 1) (LT s10 1) (LT s11 1) (LT s12 1) (LT s13 1) (LT s14 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 663 ms.
Product exploration explored 100000 steps with 50000 reset in 682 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 105 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-COL-S05J40-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S05J40-LTLFireability-15 finished in 6626 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U (G(p2)&&p1))||(G(p3)&&p3))))'
[2022-05-19 04:22:51] [INFO ] Flatten gal took : 35 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16963300422001911930
[2022-05-19 04:22:51] [INFO ] Computing symmetric may disable matrix : 840 transitions.
[2022-05-19 04:22:51] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:22:51] [INFO ] Computing symmetric may enable matrix : 840 transitions.
[2022-05-19 04:22:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:22:51] [INFO ] Applying decomposition
[2022-05-19 04:22:51] [INFO ] Flatten gal took : 37 ms
[2022-05-19 04:22:51] [INFO ] Computing Do-Not-Accords matrix : 840 transitions.
[2022-05-19 04:22:51] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12943495928616634091.txt' '-o' '/tmp/graph12943495928616634091.bin' '-w' '/tmp/graph12943495928616634091.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12943495928616634091.bin' '-l' '-1' '-v' '-w' '/tmp/graph12943495928616634091.weights' '-q' '0' '-e' '0.001'
[2022-05-19 04:22:51] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16963300422001911930
Running compilation step : cd /tmp/ltsmin16963300422001911930;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 04:22:51] [INFO ] Decomposing Gal with order
[2022-05-19 04:22:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 04:22:51] [INFO ] Removed a total of 881 redundant transitions.
[2022-05-19 04:22:51] [INFO ] Flatten gal took : 98 ms
[2022-05-19 04:22:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 15 ms.
[2022-05-19 04:22:51] [INFO ] Time to serialize gal into /tmp/LTLFireability11419519599912250939.gal : 6 ms
[2022-05-19 04:22:51] [INFO ] Time to serialize properties into /tmp/LTLFireability4986140367930997285.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11419519599912250939.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4986140367930997285.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((F((("((((((((i27.u60.NotifyEventJobQueuedB_34>=1)&&(i29.u87.cJobCnt_0>=1))||((i9.u35.NotifyEventJobQueuedB_39>=1)&&(i29.u87.cJobCnt...3013
Formula 0 simplified : !F(("((((((((i27.u60.NotifyEventJobQueuedB_34>=1)&&(i29.u87.cJobCnt_0>=1))||((i9.u35.NotifyEventJobQueuedB_39>=1)&&(i29.u87.cJobCnt_...2999
Compilation finished in 2410 ms.
Running link step : cd /tmp/ltsmin16963300422001911930;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin16963300422001911930;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((((LTLAPp0==true) U ([]((LTLAPp2==true))&&(LTLAPp1==true)))||([]((LTLAPp3==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 04:44:35] [INFO ] Applying decomposition
[2022-05-19 04:44:35] [INFO ] Flatten gal took : 95 ms
[2022-05-19 04:44:35] [INFO ] Decomposing Gal with order
[2022-05-19 04:44:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 04:44:36] [INFO ] Removed a total of 2721 redundant transitions.
[2022-05-19 04:44:36] [INFO ] Flatten gal took : 247 ms
[2022-05-19 04:44:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 27 ms.
[2022-05-19 04:44:36] [INFO ] Time to serialize gal into /tmp/LTLFireability15438208718884999232.gal : 7 ms
[2022-05-19 04:44:36] [INFO ] Time to serialize properties into /tmp/LTLFireability153716679946285696.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15438208718884999232.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability153716679946285696.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((F((("((((((((ThreadsJobs34.NotifyEventJobQueuedB_34>=1)&&(cJobCnt.cJobCnt_0>=1))||((ThreadsJobs39.NotifyEventJobQueuedB_39>=1)&&(cJ...3243
Formula 0 simplified : !F(("((((((((ThreadsJobs34.NotifyEventJobQueuedB_34>=1)&&(cJobCnt.cJobCnt_0>=1))||((ThreadsJobs39.NotifyEventJobQueuedB_39>=1)&&(cJo...3229
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.089: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.089: Initializing POR dependencies: labels 844, guards 840
pins2lts-mc-linux64( 2/ 8), 0.089: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.092: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.095: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.103: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.116: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.117: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 3.536: LTL layer: formula: <>((((LTLAPp0==true) U ([]((LTLAPp2==true))&&(LTLAPp1==true)))||([]((LTLAPp3==true))&&(LTLAPp3==true))))
pins2lts-mc-linux64( 7/ 8), 3.536: "<>((((LTLAPp0==true) U ([]((LTLAPp2==true))&&(LTLAPp1==true)))||([]((LTLAPp3==true))&&(LTLAPp3==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 3.537: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 3.670: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 3.697: There are 845 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 3.697: State length is 625, there are 858 groups
pins2lts-mc-linux64( 0/ 8), 3.697: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 3.697: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 3.697: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 3.697: Visible groups: 0 / 858, labels: 3 / 845
pins2lts-mc-linux64( 0/ 8), 3.697: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 3.697: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 3.852: [Blue] ~52 levels ~960 states ~5432 transitions
pins2lts-mc-linux64( 6/ 8), 3.916: [Blue] ~30 levels ~1920 states ~12728 transitions
pins2lts-mc-linux64( 6/ 8), 4.015: [Blue] ~30 levels ~3840 states ~18968 transitions
pins2lts-mc-linux64( 2/ 8), 4.247: [Blue] ~30 levels ~7680 states ~32728 transitions
pins2lts-mc-linux64( 6/ 8), 4.641: [Blue] ~30 levels ~15360 states ~59288 transitions
pins2lts-mc-linux64( 6/ 8), 5.414: [Blue] ~30 levels ~30720 states ~109672 transitions
pins2lts-mc-linux64( 6/ 8), 6.995: [Blue] ~30 levels ~61440 states ~211896 transitions
pins2lts-mc-linux64( 4/ 8), 10.041: [Blue] ~30 levels ~122880 states ~437520 transitions
pins2lts-mc-linux64( 5/ 8), 16.325: [Blue] ~52 levels ~245760 states ~1020520 transitions
pins2lts-mc-linux64( 5/ 8), 27.660: [Blue] ~52 levels ~491520 states ~1961704 transitions
pins2lts-mc-linux64( 5/ 8), 49.333: [Blue] ~52 levels ~983040 states ~3842216 transitions
pins2lts-mc-linux64( 5/ 8), 92.845: [Blue] ~52 levels ~1966080 states ~7641736 transitions
pins2lts-mc-linux64( 5/ 8), 176.061: [Blue] ~65 levels ~3932160 states ~14696936 transitions
pins2lts-mc-linux64( 5/ 8), 342.230: [Blue] ~65 levels ~7864320 states ~28429912 transitions
pins2lts-mc-linux64( 5/ 8), 675.971: [Blue] ~65 levels ~15728640 states ~56176136 transitions
pins2lts-mc-linux64( 5/ 8), 1330.073: [Blue] ~65 levels ~31457280 states ~109316376 transitions
pins2lts-mc-linux64( 5/ 8), 1604.676: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1604.796:
pins2lts-mc-linux64( 0/ 8), 1604.796: Explored 31265949 states 123154575 transitions, fanout: 3.939
pins2lts-mc-linux64( 0/ 8), 1604.796: Total exploration time 1601.090 sec (1600.950 sec minimum, 1601.000 sec on average)
pins2lts-mc-linux64( 0/ 8), 1604.796: States per second: 19528, Transitions per second: 76919
pins2lts-mc-linux64( 0/ 8), 1604.796:
pins2lts-mc-linux64( 0/ 8), 1604.796: State space has 31268337 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1604.796: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1604.796: blue states: 31265949 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1604.796: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1604.796: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1604.796:
pins2lts-mc-linux64( 0/ 8), 1604.796: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1604.796:
pins2lts-mc-linux64( 0/ 8), 1604.796: Queue width: 8B, total height: 275, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1604.796: Tree memory: 494.6MB, 16.6 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1604.796: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1604.796: Stored 850 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1604.796: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1604.796: Est. total memory use: 494.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16963300422001911930;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((((LTLAPp0==true) U ([]((LTLAPp2==true))&&(LTLAPp1==true)))||([]((LTLAPp3==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16963300422001911930;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((((LTLAPp0==true) U ([]((LTLAPp2==true))&&(LTLAPp1==true)))||([]((LTLAPp3==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 05:06:21] [INFO ] Flatten gal took : 367 ms
[2022-05-19 05:06:22] [INFO ] Input system was already deterministic with 840 transitions.
[2022-05-19 05:06:22] [INFO ] Transformed 624 places.
[2022-05-19 05:06:22] [INFO ] Transformed 840 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-19 05:06:52] [INFO ] Time to serialize gal into /tmp/LTLFireability2449678209179206631.gal : 6 ms
[2022-05-19 05:06:52] [INFO ] Time to serialize properties into /tmp/LTLFireability14978353057155692347.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2449678209179206631.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14978353057155692347.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((("((((((((NotifyEventJobQueuedB_34>=1)&&(cJobCnt_0>=1))||((NotifyEventJobQueuedB_39>=1)&&(cJobCnt_0>=1)))||(((NotifyEventJobQueu...2281
Formula 0 simplified : !F(("((((((((NotifyEventJobQueuedB_34>=1)&&(cJobCnt_0>=1))||((NotifyEventJobQueuedB_39>=1)&&(cJobCnt_0>=1)))||(((NotifyEventJobQueue...2267
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-S05J40"
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-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S05J40, 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 r168-tall-165277017100748"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J40.tgz
mv PolyORBNT-COL-S05J40 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 ;