Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r298-tall-167873952100690.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is PolyORBNT-COL-S10J40, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952100690
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 12K Feb 26 00:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 00:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 23:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 01:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 01:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 01:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679635998019

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J40
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 05:33:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 05:33:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 05:33:19] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-24 05:33:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 05:33:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 663 ms
[2023-03-24 05:33:20] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 894 PT places and 12462.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
[2023-03-24 05:33:20] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-24 05:33:20] [INFO ] Skeletonized 15 HLPN properties in 1 ms. Removed 1 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10002 steps, including 571 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 21) seen :3
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :15
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-24 05:33:20] [INFO ] Computed 13 place invariants in 9 ms
[2023-03-24 05:33:20] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2023-03-24 05:33:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-24 05:33:20] [INFO ] After 29ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-24 05:33:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:33:20] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-24 05:33:20] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 4 ms to minimize.
[2023-03-24 05:33:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-24 05:33:20] [INFO ] After 57ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 05:33:20] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 05:33:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
[2023-03-24 05:33:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 05:33:21] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 05:33:21] [INFO ] After 46ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 05:33:21] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2023-03-24 05:33:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-24 05:33:21] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-24 05:33:21] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 37 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 35 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 28
Applied a total of 27 rules in 26 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 34 cols
[2023-03-24 05:33:21] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-24 05:33:21] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10007 steps, including 740 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 297 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-24 05:33:21] [INFO ] Invariant cache hit.
[2023-03-24 05:33:21] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-24 05:33:21] [INFO ] [Real]Absence check using 5 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 05:33:21] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 05:33:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:33:21] [INFO ] After 2ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-24 05:33:21] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2023-03-24 05:33:21] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2023-03-24 05:33:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
[2023-03-24 05:33:21] [INFO ] After 76ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 05:33:21] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 05:33:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-24 05:33:21] [INFO ] [Nat]Absence check using 5 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 05:33:21] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 05:33:21] [INFO ] After 2ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 05:33:21] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2023-03-24 05:33:21] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2023-03-24 05:33:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2023-03-24 05:33:21] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-24 05:33:21] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 34 /34 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 34/34 places, 28/28 transitions.
Incomplete random walk after 10004 steps, including 734 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 297 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Probably explored full state space saw : 521 states, properties seen :0
Probabilistic random walk after 1393 steps, saw 521 distinct states, run finished after 16 ms. (steps per millisecond=87 ) properties seen :0
Explored full state space saw : 521 states, properties seen :0
Exhaustive walk after 1393 steps, saw 521 distinct states, run finished after 4 ms. (steps per millisecond=348 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2023-03-24 05:33:21] [INFO ] Flatten gal took : 19 ms
[2023-03-24 05:33:21] [INFO ] Flatten gal took : 6 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-24 05:33:22] [INFO ] Unfolded HLPN to a Petri net with 894 places and 12380 transitions 114079 arcs in 206 ms.
[2023-03-24 05:33:22] [INFO ] Unfolded 16 HLPN properties in 4 ms.
[2023-03-24 05:33:22] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-24 05:33:22] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-24 05:33:22] [INFO ] Reduced 9285 identical enabling conditions.
Deduced a syphon composed of 40 places in 25 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 852 out of 854 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Applied a total of 0 rules in 35 ms. Remains 854 /854 variables (removed 0) and now considering 2230/2230 (removed 0) transitions.
[2023-03-24 05:33:22] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2023-03-24 05:33:22] [INFO ] Computed 112 place invariants in 152 ms
[2023-03-24 05:33:23] [INFO ] Dead Transitions using invariants and state equation in 1460 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-24 05:33:23] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
// Phase 1: matrix 1606 rows 854 cols
[2023-03-24 05:33:23] [INFO ] Computed 112 place invariants in 43 ms
[2023-03-24 05:33:23] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-24 05:33:23] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-24 05:33:23] [INFO ] Invariant cache hit.
[2023-03-24 05:33:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:33:24] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 854/854 places, 1615/2230 transitions.
Applied a total of 0 rules in 8 ms. Remains 854 /854 variables (removed 0) and now considering 1615/1615 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2286 ms. Remains : 854/854 places, 1615/2230 transitions.
Support contains 852 out of 854 places after structural reductions.
[2023-03-24 05:33:24] [INFO ] Flatten gal took : 218 ms
[2023-03-24 05:33:25] [INFO ] Flatten gal took : 157 ms
[2023-03-24 05:33:25] [INFO ] Input system was already deterministic with 1615 transitions.
Incomplete random walk after 10000 steps, including 558 resets, run finished after 675 ms. (steps per millisecond=14 ) properties (out of 42) seen :17
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :17
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-24 05:33:26] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-24 05:33:26] [INFO ] Invariant cache hit.
[2023-03-24 05:33:27] [INFO ] [Real]Absence check using 105 positive place invariants in 29 ms returned sat
[2023-03-24 05:33:27] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-24 05:33:28] [INFO ] After 938ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-24 05:33:28] [INFO ] [Nat]Absence check using 105 positive place invariants in 38 ms returned sat
[2023-03-24 05:33:28] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-24 05:33:31] [INFO ] After 2891ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-24 05:33:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:33:36] [INFO ] After 4475ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2023-03-24 05:33:36] [INFO ] Deduced a trap composed of 397 places in 379 ms of which 1 ms to minimize.
[2023-03-24 05:33:37] [INFO ] Deduced a trap composed of 395 places in 353 ms of which 1 ms to minimize.
[2023-03-24 05:33:37] [INFO ] Deduced a trap composed of 387 places in 361 ms of which 1 ms to minimize.
[2023-03-24 05:33:38] [INFO ] Deduced a trap composed of 399 places in 378 ms of which 1 ms to minimize.
[2023-03-24 05:33:38] [INFO ] Deduced a trap composed of 403 places in 398 ms of which 0 ms to minimize.
[2023-03-24 05:33:39] [INFO ] Deduced a trap composed of 397 places in 377 ms of which 1 ms to minimize.
[2023-03-24 05:33:39] [INFO ] Deduced a trap composed of 399 places in 371 ms of which 0 ms to minimize.
[2023-03-24 05:33:39] [INFO ] Deduced a trap composed of 385 places in 383 ms of which 1 ms to minimize.
[2023-03-24 05:33:40] [INFO ] Deduced a trap composed of 407 places in 384 ms of which 0 ms to minimize.
[2023-03-24 05:33:40] [INFO ] Deduced a trap composed of 395 places in 391 ms of which 0 ms to minimize.
[2023-03-24 05:33:41] [INFO ] Deduced a trap composed of 401 places in 376 ms of which 1 ms to minimize.
[2023-03-24 05:33:41] [INFO ] Deduced a trap composed of 407 places in 377 ms of which 1 ms to minimize.
[2023-03-24 05:33:42] [INFO ] Deduced a trap composed of 405 places in 388 ms of which 0 ms to minimize.
[2023-03-24 05:33:42] [INFO ] Deduced a trap composed of 395 places in 382 ms of which 1 ms to minimize.
[2023-03-24 05:33:43] [INFO ] Deduced a trap composed of 397 places in 388 ms of which 1 ms to minimize.
[2023-03-24 05:33:43] [INFO ] Deduced a trap composed of 391 places in 382 ms of which 1 ms to minimize.
[2023-03-24 05:33:44] [INFO ] Deduced a trap composed of 389 places in 360 ms of which 1 ms to minimize.
[2023-03-24 05:33:44] [INFO ] Deduced a trap composed of 389 places in 352 ms of which 1 ms to minimize.
[2023-03-24 05:33:45] [INFO ] Deduced a trap composed of 397 places in 369 ms of which 1 ms to minimize.
[2023-03-24 05:33:45] [INFO ] Deduced a trap composed of 383 places in 350 ms of which 0 ms to minimize.
[2023-03-24 05:33:46] [INFO ] Deduced a trap composed of 397 places in 385 ms of which 0 ms to minimize.
[2023-03-24 05:33:46] [INFO ] Deduced a trap composed of 399 places in 359 ms of which 1 ms to minimize.
[2023-03-24 05:33:47] [INFO ] Deduced a trap composed of 387 places in 370 ms of which 1 ms to minimize.
[2023-03-24 05:33:47] [INFO ] Deduced a trap composed of 399 places in 352 ms of which 1 ms to minimize.
[2023-03-24 05:33:47] [INFO ] Deduced a trap composed of 395 places in 349 ms of which 1 ms to minimize.
[2023-03-24 05:33:48] [INFO ] Deduced a trap composed of 403 places in 356 ms of which 1 ms to minimize.
[2023-03-24 05:33:48] [INFO ] Deduced a trap composed of 387 places in 363 ms of which 1 ms to minimize.
[2023-03-24 05:33:49] [INFO ] Deduced a trap composed of 401 places in 363 ms of which 1 ms to minimize.
[2023-03-24 05:33:49] [INFO ] Deduced a trap composed of 395 places in 345 ms of which 1 ms to minimize.
[2023-03-24 05:33:50] [INFO ] Deduced a trap composed of 411 places in 371 ms of which 1 ms to minimize.
[2023-03-24 05:33:50] [INFO ] Deduced a trap composed of 393 places in 334 ms of which 1 ms to minimize.
[2023-03-24 05:33:50] [INFO ] Deduced a trap composed of 387 places in 349 ms of which 3 ms to minimize.
[2023-03-24 05:33:51] [INFO ] Deduced a trap composed of 399 places in 349 ms of which 0 ms to minimize.
[2023-03-24 05:33:51] [INFO ] Deduced a trap composed of 393 places in 347 ms of which 1 ms to minimize.
[2023-03-24 05:33:52] [INFO ] Deduced a trap composed of 407 places in 354 ms of which 1 ms to minimize.
[2023-03-24 05:33:52] [INFO ] Deduced a trap composed of 391 places in 355 ms of which 1 ms to minimize.
[2023-03-24 05:33:53] [INFO ] Deduced a trap composed of 395 places in 352 ms of which 1 ms to minimize.
[2023-03-24 05:33:53] [INFO ] Deduced a trap composed of 407 places in 352 ms of which 1 ms to minimize.
[2023-03-24 05:33:54] [INFO ] Deduced a trap composed of 3 places in 499 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 05:33:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 05:33:54] [INFO ] After 25526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 41 ms.
Support contains 197 out of 854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 844 transition count 1572
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 97 place count 801 transition count 1571
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 800 transition count 1571
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 98 place count 800 transition count 1529
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 182 place count 758 transition count 1529
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 757 transition count 1528
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 757 transition count 1528
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 188 place count 755 transition count 1526
Applied a total of 188 rules in 212 ms. Remains 755 /854 variables (removed 99) and now considering 1526/1615 (removed 89) transitions.
[2023-03-24 05:33:54] [INFO ] Flow matrix only has 1517 transitions (discarded 9 similar events)
// Phase 1: matrix 1517 rows 755 cols
[2023-03-24 05:33:54] [INFO ] Computed 102 place invariants in 22 ms
[2023-03-24 05:33:55] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 933 ms. Remains : 755/854 places, 1526/1615 transitions.
Incomplete random walk after 10000 steps, including 634 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 05:33:55] [INFO ] Flow matrix only has 1517 transitions (discarded 9 similar events)
[2023-03-24 05:33:55] [INFO ] Invariant cache hit.
[2023-03-24 05:33:55] [INFO ] [Real]Absence check using 95 positive place invariants in 23 ms returned sat
[2023-03-24 05:33:55] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-24 05:33:55] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 05:33:55] [INFO ] [Nat]Absence check using 95 positive place invariants in 23 ms returned sat
[2023-03-24 05:33:55] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-24 05:33:56] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 05:33:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:33:56] [INFO ] After 250ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 05:33:56] [INFO ] Deduced a trap composed of 306 places in 311 ms of which 1 ms to minimize.
[2023-03-24 05:33:57] [INFO ] Deduced a trap composed of 312 places in 335 ms of which 1 ms to minimize.
[2023-03-24 05:33:57] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 1 ms to minimize.
[2023-03-24 05:33:57] [INFO ] Deduced a trap composed of 310 places in 304 ms of which 1 ms to minimize.
[2023-03-24 05:33:58] [INFO ] Deduced a trap composed of 310 places in 297 ms of which 1 ms to minimize.
[2023-03-24 05:33:58] [INFO ] Deduced a trap composed of 306 places in 309 ms of which 1 ms to minimize.
[2023-03-24 05:33:58] [INFO ] Deduced a trap composed of 300 places in 312 ms of which 1 ms to minimize.
[2023-03-24 05:33:59] [INFO ] Deduced a trap composed of 308 places in 339 ms of which 1 ms to minimize.
[2023-03-24 05:33:59] [INFO ] Deduced a trap composed of 296 places in 329 ms of which 1 ms to minimize.
[2023-03-24 05:34:00] [INFO ] Deduced a trap composed of 304 places in 320 ms of which 6 ms to minimize.
[2023-03-24 05:34:00] [INFO ] Deduced a trap composed of 308 places in 314 ms of which 1 ms to minimize.
[2023-03-24 05:34:00] [INFO ] Deduced a trap composed of 304 places in 314 ms of which 0 ms to minimize.
[2023-03-24 05:34:01] [INFO ] Deduced a trap composed of 302 places in 316 ms of which 1 ms to minimize.
[2023-03-24 05:34:01] [INFO ] Deduced a trap composed of 302 places in 318 ms of which 0 ms to minimize.
[2023-03-24 05:34:02] [INFO ] Deduced a trap composed of 300 places in 348 ms of which 0 ms to minimize.
[2023-03-24 05:34:02] [INFO ] Deduced a trap composed of 304 places in 343 ms of which 1 ms to minimize.
[2023-03-24 05:34:02] [INFO ] Deduced a trap composed of 304 places in 335 ms of which 2 ms to minimize.
[2023-03-24 05:34:03] [INFO ] Deduced a trap composed of 304 places in 316 ms of which 0 ms to minimize.
[2023-03-24 05:34:03] [INFO ] Deduced a trap composed of 306 places in 336 ms of which 0 ms to minimize.
[2023-03-24 05:34:04] [INFO ] Deduced a trap composed of 306 places in 336 ms of which 1 ms to minimize.
[2023-03-24 05:34:04] [INFO ] Deduced a trap composed of 302 places in 335 ms of which 1 ms to minimize.
[2023-03-24 05:34:04] [INFO ] Deduced a trap composed of 304 places in 331 ms of which 0 ms to minimize.
[2023-03-24 05:34:05] [INFO ] Deduced a trap composed of 300 places in 331 ms of which 0 ms to minimize.
[2023-03-24 05:34:05] [INFO ] Deduced a trap composed of 308 places in 336 ms of which 0 ms to minimize.
[2023-03-24 05:34:06] [INFO ] Deduced a trap composed of 302 places in 313 ms of which 1 ms to minimize.
[2023-03-24 05:34:06] [INFO ] Deduced a trap composed of 302 places in 339 ms of which 1 ms to minimize.
[2023-03-24 05:34:06] [INFO ] Deduced a trap composed of 304 places in 314 ms of which 1 ms to minimize.
[2023-03-24 05:34:07] [INFO ] Deduced a trap composed of 302 places in 305 ms of which 1 ms to minimize.
[2023-03-24 05:34:08] [INFO ] Deduced a trap composed of 298 places in 316 ms of which 1 ms to minimize.
[2023-03-24 05:34:08] [INFO ] Deduced a trap composed of 308 places in 313 ms of which 1 ms to minimize.
[2023-03-24 05:34:08] [INFO ] Deduced a trap composed of 312 places in 312 ms of which 1 ms to minimize.
[2023-03-24 05:34:09] [INFO ] Deduced a trap composed of 306 places in 307 ms of which 1 ms to minimize.
[2023-03-24 05:34:10] [INFO ] Deduced a trap composed of 302 places in 315 ms of which 1 ms to minimize.
[2023-03-24 05:34:11] [INFO ] Deduced a trap composed of 306 places in 317 ms of which 0 ms to minimize.
[2023-03-24 05:34:12] [INFO ] Deduced a trap composed of 304 places in 307 ms of which 0 ms to minimize.
[2023-03-24 05:34:13] [INFO ] Deduced a trap composed of 296 places in 304 ms of which 0 ms to minimize.
[2023-03-24 05:34:13] [INFO ] Deduced a trap composed of 304 places in 312 ms of which 1 ms to minimize.
[2023-03-24 05:34:13] [INFO ] Deduced a trap composed of 306 places in 309 ms of which 1 ms to minimize.
[2023-03-24 05:34:14] [INFO ] Deduced a trap composed of 308 places in 305 ms of which 0 ms to minimize.
[2023-03-24 05:34:15] [INFO ] Deduced a trap composed of 302 places in 317 ms of which 0 ms to minimize.
[2023-03-24 05:34:15] [INFO ] Deduced a trap composed of 304 places in 301 ms of which 1 ms to minimize.
[2023-03-24 05:34:15] [INFO ] Deduced a trap composed of 298 places in 307 ms of which 0 ms to minimize.
[2023-03-24 05:34:16] [INFO ] Deduced a trap composed of 312 places in 322 ms of which 1 ms to minimize.
[2023-03-24 05:34:17] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 0 ms to minimize.
[2023-03-24 05:34:17] [INFO ] Deduced a trap composed of 298 places in 298 ms of which 1 ms to minimize.
[2023-03-24 05:34:19] [INFO ] Deduced a trap composed of 302 places in 306 ms of which 1 ms to minimize.
[2023-03-24 05:34:20] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 24214 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 05:34:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 05:34:20] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 755 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 755/755 places, 1526/1526 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 755 transition count 1524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 753 transition count 1524
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 753 transition count 1521
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 10 place count 750 transition count 1521
Applied a total of 10 rules in 69 ms. Remains 750 /755 variables (removed 5) and now considering 1521/1526 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 750/755 places, 1521/1526 transitions.
Incomplete random walk after 10000 steps, including 727 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 381361 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 381361 steps, saw 61449 distinct states, run finished after 3004 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 05:34:23] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2023-03-24 05:34:23] [INFO ] Computed 102 place invariants in 22 ms
[2023-03-24 05:34:23] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2023-03-24 05:34:23] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-24 05:34:23] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 05:34:24] [INFO ] [Nat]Absence check using 95 positive place invariants in 20 ms returned sat
[2023-03-24 05:34:24] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-24 05:34:24] [INFO ] After 382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 05:34:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:34:25] [INFO ] After 572ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 05:34:25] [INFO ] Deduced a trap composed of 306 places in 302 ms of which 0 ms to minimize.
[2023-03-24 05:34:25] [INFO ] Deduced a trap composed of 308 places in 310 ms of which 1 ms to minimize.
[2023-03-24 05:34:26] [INFO ] Deduced a trap composed of 314 places in 303 ms of which 0 ms to minimize.
[2023-03-24 05:34:26] [INFO ] Deduced a trap composed of 306 places in 300 ms of which 1 ms to minimize.
[2023-03-24 05:34:26] [INFO ] Deduced a trap composed of 296 places in 301 ms of which 1 ms to minimize.
[2023-03-24 05:34:27] [INFO ] Deduced a trap composed of 296 places in 304 ms of which 0 ms to minimize.
[2023-03-24 05:34:27] [INFO ] Deduced a trap composed of 294 places in 295 ms of which 0 ms to minimize.
[2023-03-24 05:34:27] [INFO ] Deduced a trap composed of 292 places in 309 ms of which 1 ms to minimize.
[2023-03-24 05:34:28] [INFO ] Deduced a trap composed of 304 places in 312 ms of which 0 ms to minimize.
[2023-03-24 05:34:28] [INFO ] Deduced a trap composed of 298 places in 305 ms of which 1 ms to minimize.
[2023-03-24 05:34:28] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 0 ms to minimize.
[2023-03-24 05:34:29] [INFO ] Deduced a trap composed of 306 places in 310 ms of which 1 ms to minimize.
[2023-03-24 05:34:29] [INFO ] Deduced a trap composed of 294 places in 312 ms of which 1 ms to minimize.
[2023-03-24 05:34:30] [INFO ] Deduced a trap composed of 296 places in 311 ms of which 1 ms to minimize.
[2023-03-24 05:34:30] [INFO ] Deduced a trap composed of 311 places in 319 ms of which 0 ms to minimize.
[2023-03-24 05:34:31] [INFO ] Deduced a trap composed of 299 places in 301 ms of which 1 ms to minimize.
[2023-03-24 05:34:31] [INFO ] Deduced a trap composed of 300 places in 305 ms of which 1 ms to minimize.
[2023-03-24 05:34:32] [INFO ] Deduced a trap composed of 290 places in 309 ms of which 1 ms to minimize.
[2023-03-24 05:34:32] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 0 ms to minimize.
[2023-03-24 05:34:32] [INFO ] Deduced a trap composed of 296 places in 310 ms of which 1 ms to minimize.
[2023-03-24 05:34:33] [INFO ] Deduced a trap composed of 306 places in 308 ms of which 1 ms to minimize.
[2023-03-24 05:34:33] [INFO ] Deduced a trap composed of 298 places in 301 ms of which 1 ms to minimize.
[2023-03-24 05:34:34] [INFO ] Deduced a trap composed of 290 places in 323 ms of which 1 ms to minimize.
[2023-03-24 05:34:34] [INFO ] Deduced a trap composed of 296 places in 296 ms of which 0 ms to minimize.
[2023-03-24 05:34:35] [INFO ] Deduced a trap composed of 306 places in 304 ms of which 0 ms to minimize.
[2023-03-24 05:34:35] [INFO ] Deduced a trap composed of 294 places in 297 ms of which 0 ms to minimize.
[2023-03-24 05:34:35] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 1 ms to minimize.
[2023-03-24 05:34:36] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 1 ms to minimize.
[2023-03-24 05:34:36] [INFO ] Deduced a trap composed of 306 places in 298 ms of which 0 ms to minimize.
[2023-03-24 05:34:36] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 1 ms to minimize.
[2023-03-24 05:34:37] [INFO ] Deduced a trap composed of 296 places in 305 ms of which 1 ms to minimize.
[2023-03-24 05:34:37] [INFO ] Deduced a trap composed of 296 places in 296 ms of which 1 ms to minimize.
[2023-03-24 05:34:37] [INFO ] Deduced a trap composed of 306 places in 301 ms of which 0 ms to minimize.
[2023-03-24 05:34:38] [INFO ] Deduced a trap composed of 294 places in 305 ms of which 1 ms to minimize.
[2023-03-24 05:34:38] [INFO ] Deduced a trap composed of 298 places in 295 ms of which 1 ms to minimize.
[2023-03-24 05:34:39] [INFO ] Deduced a trap composed of 298 places in 305 ms of which 1 ms to minimize.
[2023-03-24 05:34:39] [INFO ] Deduced a trap composed of 315 places in 304 ms of which 1 ms to minimize.
[2023-03-24 05:34:39] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 1 ms to minimize.
[2023-03-24 05:34:40] [INFO ] Deduced a trap composed of 302 places in 311 ms of which 1 ms to minimize.
[2023-03-24 05:34:43] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 1 ms to minimize.
[2023-03-24 05:34:43] [INFO ] Deduced a trap composed of 296 places in 303 ms of which 1 ms to minimize.
[2023-03-24 05:34:44] [INFO ] Deduced a trap composed of 310 places in 316 ms of which 1 ms to minimize.
[2023-03-24 05:34:44] [INFO ] Deduced a trap composed of 310 places in 306 ms of which 0 ms to minimize.
[2023-03-24 05:34:44] [INFO ] Deduced a trap composed of 308 places in 299 ms of which 1 ms to minimize.
[2023-03-24 05:34:45] [INFO ] Deduced a trap composed of 294 places in 307 ms of which 1 ms to minimize.
[2023-03-24 05:34:45] [INFO ] Deduced a trap composed of 304 places in 303 ms of which 1 ms to minimize.
[2023-03-24 05:34:45] [INFO ] Deduced a trap composed of 302 places in 313 ms of which 1 ms to minimize.
[2023-03-24 05:34:46] [INFO ] Deduced a trap composed of 300 places in 311 ms of which 1 ms to minimize.
[2023-03-24 05:34:46] [INFO ] Deduced a trap composed of 300 places in 310 ms of which 1 ms to minimize.
[2023-03-24 05:34:48] [INFO ] Deduced a trap composed of 296 places in 310 ms of which 1 ms to minimize.
[2023-03-24 05:34:48] [INFO ] Deduced a trap composed of 309 places in 302 ms of which 0 ms to minimize.
[2023-03-24 05:34:49] [INFO ] Deduced a trap composed of 300 places in 314 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 05:34:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 05:34:49] [INFO ] After 25104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 50 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 48 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-24 05:34:49] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 05:34:49] [INFO ] Invariant cache hit.
[2023-03-24 05:34:49] [INFO ] Implicit Places using invariants in 588 ms returned []
[2023-03-24 05:34:49] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 05:34:49] [INFO ] Invariant cache hit.
[2023-03-24 05:34:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:34:53] [INFO ] Implicit Places using invariants and state equation in 3765 ms returned []
Implicit Place search using SMT with State Equation took 4368 ms to find 0 implicit places.
[2023-03-24 05:34:53] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-24 05:34:53] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-24 05:34:53] [INFO ] Invariant cache hit.
[2023-03-24 05:34:54] [INFO ] Dead Transitions using invariants and state equation in 664 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5173 ms. Remains : 750/750 places, 1521/1521 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 750 transition count 1512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 750 transition count 1511
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 749 transition count 1511
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 749 transition count 1510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 748 transition count 1510
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 748 transition count 1500
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 738 transition count 1500
Applied a total of 33 rules in 142 ms. Remains 738 /750 variables (removed 12) and now considering 1500/1521 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1500 rows 738 cols
[2023-03-24 05:34:54] [INFO ] Computed 102 place invariants in 23 ms
[2023-03-24 05:34:54] [INFO ] [Real]Absence check using 95 positive place invariants in 20 ms returned sat
[2023-03-24 05:34:54] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-24 05:34:54] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 05:34:54] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2023-03-24 05:34:54] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-24 05:34:55] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 05:34:55] [INFO ] Deduced a trap composed of 294 places in 282 ms of which 1 ms to minimize.
[2023-03-24 05:34:55] [INFO ] Deduced a trap composed of 298 places in 271 ms of which 0 ms to minimize.
[2023-03-24 05:34:56] [INFO ] Deduced a trap composed of 292 places in 275 ms of which 1 ms to minimize.
[2023-03-24 05:34:56] [INFO ] Deduced a trap composed of 298 places in 273 ms of which 1 ms to minimize.
[2023-03-24 05:34:56] [INFO ] Deduced a trap composed of 288 places in 275 ms of which 0 ms to minimize.
[2023-03-24 05:34:57] [INFO ] Deduced a trap composed of 302 places in 280 ms of which 0 ms to minimize.
[2023-03-24 05:34:57] [INFO ] Deduced a trap composed of 292 places in 271 ms of which 0 ms to minimize.
[2023-03-24 05:34:57] [INFO ] Deduced a trap composed of 300 places in 286 ms of which 1 ms to minimize.
[2023-03-24 05:34:57] [INFO ] Deduced a trap composed of 298 places in 278 ms of which 1 ms to minimize.
[2023-03-24 05:34:58] [INFO ] Deduced a trap composed of 294 places in 270 ms of which 0 ms to minimize.
[2023-03-24 05:34:58] [INFO ] Deduced a trap composed of 302 places in 275 ms of which 1 ms to minimize.
[2023-03-24 05:34:58] [INFO ] Deduced a trap composed of 300 places in 280 ms of which 0 ms to minimize.
[2023-03-24 05:34:59] [INFO ] Deduced a trap composed of 302 places in 272 ms of which 0 ms to minimize.
[2023-03-24 05:34:59] [INFO ] Deduced a trap composed of 296 places in 274 ms of which 1 ms to minimize.
[2023-03-24 05:34:59] [INFO ] Deduced a trap composed of 306 places in 277 ms of which 1 ms to minimize.
[2023-03-24 05:35:00] [INFO ] Deduced a trap composed of 308 places in 274 ms of which 0 ms to minimize.
[2023-03-24 05:35:00] [INFO ] Deduced a trap composed of 306 places in 277 ms of which 1 ms to minimize.
[2023-03-24 05:35:00] [INFO ] Deduced a trap composed of 304 places in 283 ms of which 3 ms to minimize.
[2023-03-24 05:35:01] [INFO ] Deduced a trap composed of 294 places in 275 ms of which 1 ms to minimize.
[2023-03-24 05:35:01] [INFO ] Deduced a trap composed of 306 places in 279 ms of which 1 ms to minimize.
[2023-03-24 05:35:01] [INFO ] Deduced a trap composed of 300 places in 268 ms of which 1 ms to minimize.
[2023-03-24 05:35:02] [INFO ] Deduced a trap composed of 308 places in 278 ms of which 1 ms to minimize.
[2023-03-24 05:35:02] [INFO ] Deduced a trap composed of 306 places in 267 ms of which 1 ms to minimize.
[2023-03-24 05:35:02] [INFO ] Deduced a trap composed of 300 places in 272 ms of which 0 ms to minimize.
[2023-03-24 05:35:03] [INFO ] Deduced a trap composed of 302 places in 265 ms of which 1 ms to minimize.
[2023-03-24 05:35:03] [INFO ] Deduced a trap composed of 294 places in 270 ms of which 0 ms to minimize.
[2023-03-24 05:35:03] [INFO ] Deduced a trap composed of 300 places in 264 ms of which 0 ms to minimize.
[2023-03-24 05:35:04] [INFO ] Deduced a trap composed of 304 places in 272 ms of which 0 ms to minimize.
[2023-03-24 05:35:04] [INFO ] Deduced a trap composed of 296 places in 272 ms of which 0 ms to minimize.
[2023-03-24 05:35:04] [INFO ] Deduced a trap composed of 286 places in 272 ms of which 0 ms to minimize.
[2023-03-24 05:35:05] [INFO ] Deduced a trap composed of 296 places in 273 ms of which 0 ms to minimize.
[2023-03-24 05:35:05] [INFO ] Deduced a trap composed of 300 places in 273 ms of which 1 ms to minimize.
[2023-03-24 05:35:05] [INFO ] Deduced a trap composed of 302 places in 270 ms of which 0 ms to minimize.
[2023-03-24 05:35:06] [INFO ] Deduced a trap composed of 304 places in 270 ms of which 0 ms to minimize.
[2023-03-24 05:35:06] [INFO ] Deduced a trap composed of 296 places in 271 ms of which 1 ms to minimize.
[2023-03-24 05:35:06] [INFO ] Deduced a trap composed of 298 places in 279 ms of which 1 ms to minimize.
[2023-03-24 05:35:06] [INFO ] Deduced a trap composed of 308 places in 266 ms of which 0 ms to minimize.
[2023-03-24 05:35:07] [INFO ] Deduced a trap composed of 296 places in 268 ms of which 0 ms to minimize.
[2023-03-24 05:35:07] [INFO ] Deduced a trap composed of 300 places in 274 ms of which 0 ms to minimize.
[2023-03-24 05:35:07] [INFO ] Deduced a trap composed of 300 places in 265 ms of which 1 ms to minimize.
[2023-03-24 05:35:08] [INFO ] Deduced a trap composed of 292 places in 266 ms of which 0 ms to minimize.
[2023-03-24 05:35:08] [INFO ] Deduced a trap composed of 300 places in 270 ms of which 1 ms to minimize.
[2023-03-24 05:35:08] [INFO ] Deduced a trap composed of 290 places in 273 ms of which 0 ms to minimize.
[2023-03-24 05:35:09] [INFO ] Deduced a trap composed of 290 places in 271 ms of which 1 ms to minimize.
[2023-03-24 05:35:09] [INFO ] Deduced a trap composed of 296 places in 265 ms of which 1 ms to minimize.
[2023-03-24 05:35:09] [INFO ] Deduced a trap composed of 300 places in 271 ms of which 0 ms to minimize.
[2023-03-24 05:35:10] [INFO ] Deduced a trap composed of 306 places in 277 ms of which 1 ms to minimize.
[2023-03-24 05:35:10] [INFO ] Deduced a trap composed of 294 places in 269 ms of which 0 ms to minimize.
[2023-03-24 05:35:10] [INFO ] Deduced a trap composed of 304 places in 264 ms of which 0 ms to minimize.
[2023-03-24 05:35:11] [INFO ] Deduced a trap composed of 294 places in 273 ms of which 0 ms to minimize.
[2023-03-24 05:35:11] [INFO ] Deduced a trap composed of 290 places in 269 ms of which 1 ms to minimize.
[2023-03-24 05:35:11] [INFO ] Deduced a trap composed of 296 places in 274 ms of which 0 ms to minimize.
[2023-03-24 05:35:12] [INFO ] Deduced a trap composed of 292 places in 273 ms of which 1 ms to minimize.
[2023-03-24 05:35:12] [INFO ] Deduced a trap composed of 294 places in 270 ms of which 0 ms to minimize.
[2023-03-24 05:35:12] [INFO ] Deduced a trap composed of 298 places in 263 ms of which 0 ms to minimize.
[2023-03-24 05:35:13] [INFO ] Deduced a trap composed of 300 places in 278 ms of which 0 ms to minimize.
[2023-03-24 05:35:13] [INFO ] Deduced a trap composed of 290 places in 275 ms of which 1 ms to minimize.
[2023-03-24 05:35:13] [INFO ] Deduced a trap composed of 300 places in 284 ms of which 1 ms to minimize.
[2023-03-24 05:35:13] [INFO ] Deduced a trap composed of 304 places in 278 ms of which 1 ms to minimize.
[2023-03-24 05:35:14] [INFO ] Deduced a trap composed of 298 places in 270 ms of which 0 ms to minimize.
[2023-03-24 05:35:14] [INFO ] Deduced a trap composed of 292 places in 272 ms of which 1 ms to minimize.
[2023-03-24 05:38:39] [INFO ] Trap strengthening (SAT) tested/added 61/61 trap constraints in 224505 ms
[2023-03-24 05:38:39] [INFO ] After 224894ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 05:38:39] [INFO ] After 225022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-24 05:38:39] [INFO ] Flatten gal took : 98 ms
[2023-03-24 05:38:40] [INFO ] Flatten gal took : 120 ms
[2023-03-24 05:38:40] [INFO ] Input system was already deterministic with 1615 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 1615
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 843 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 843 transition count 1614
Applied a total of 12 rules in 33 ms. Remains 843 /854 variables (removed 11) and now considering 1614/1615 (removed 1) transitions.
[2023-03-24 05:38:40] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-24 05:38:40] [INFO ] Computed 102 place invariants in 34 ms
[2023-03-24 05:38:41] [INFO ] Dead Transitions using invariants and state equation in 1048 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1084 ms. Remains : 843/854 places, 1614/1615 transitions.
[2023-03-24 05:38:41] [INFO ] Flatten gal took : 63 ms
[2023-03-24 05:38:42] [INFO ] Flatten gal took : 67 ms
[2023-03-24 05:38:42] [INFO ] Input system was already deterministic with 1614 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 854 transition count 1572
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 811 transition count 1572
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 86 place count 811 transition count 1528
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 174 place count 767 transition count 1528
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 766 transition count 1527
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 766 transition count 1527
Applied a total of 176 rules in 218 ms. Remains 766 /854 variables (removed 88) and now considering 1527/1615 (removed 88) transitions.
[2023-03-24 05:38:42] [INFO ] Flow matrix only has 1518 transitions (discarded 9 similar events)
// Phase 1: matrix 1518 rows 766 cols
[2023-03-24 05:38:42] [INFO ] Computed 112 place invariants in 22 ms
[2023-03-24 05:38:43] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 989 ms. Remains : 766/854 places, 1527/1615 transitions.
[2023-03-24 05:38:43] [INFO ] Flatten gal took : 49 ms
[2023-03-24 05:38:43] [INFO ] Flatten gal took : 55 ms
[2023-03-24 05:38:43] [INFO ] Input system was already deterministic with 1527 transitions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Applied a total of 0 rules in 32 ms. Remains 854 /854 variables (removed 0) and now considering 1615/1615 (removed 0) transitions.
[2023-03-24 05:38:43] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
// Phase 1: matrix 1606 rows 854 cols
[2023-03-24 05:38:43] [INFO ] Computed 112 place invariants in 20 ms
[2023-03-24 05:38:44] [INFO ] Dead Transitions using invariants and state equation in 1069 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1102 ms. Remains : 854/854 places, 1615/1615 transitions.
[2023-03-24 05:38:44] [INFO ] Flatten gal took : 63 ms
[2023-03-24 05:38:44] [INFO ] Flatten gal took : 65 ms
[2023-03-24 05:38:44] [INFO ] Input system was already deterministic with 1615 transitions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 1615
Applied a total of 10 rules in 16 ms. Remains 844 /854 variables (removed 10) and now considering 1615/1615 (removed 0) transitions.
[2023-03-24 05:38:44] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
// Phase 1: matrix 1606 rows 844 cols
[2023-03-24 05:38:44] [INFO ] Computed 102 place invariants in 20 ms
[2023-03-24 05:38:46] [INFO ] Dead Transitions using invariants and state equation in 1217 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1235 ms. Remains : 844/854 places, 1615/1615 transitions.
[2023-03-24 05:38:46] [INFO ] Flatten gal took : 59 ms
[2023-03-24 05:38:46] [INFO ] Flatten gal took : 61 ms
[2023-03-24 05:38:46] [INFO ] Input system was already deterministic with 1615 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 854 transition count 1570
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 809 transition count 1570
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 90 place count 809 transition count 1525
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 180 place count 764 transition count 1525
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 182 place count 763 transition count 1524
Applied a total of 182 rules in 71 ms. Remains 763 /854 variables (removed 91) and now considering 1524/1615 (removed 91) transitions.
[2023-03-24 05:38:46] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
// Phase 1: matrix 1515 rows 763 cols
[2023-03-24 05:38:46] [INFO ] Computed 112 place invariants in 21 ms
[2023-03-24 05:38:47] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 796 ms. Remains : 763/854 places, 1524/1615 transitions.
[2023-03-24 05:38:47] [INFO ] Flatten gal took : 59 ms
[2023-03-24 05:38:47] [INFO ] Flatten gal took : 61 ms
[2023-03-24 05:38:47] [INFO ] Input system was already deterministic with 1524 transitions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 1615
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 843 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 843 transition count 1614
Applied a total of 12 rules in 28 ms. Remains 843 /854 variables (removed 11) and now considering 1614/1615 (removed 1) transitions.
[2023-03-24 05:38:47] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-24 05:38:47] [INFO ] Computed 102 place invariants in 25 ms
[2023-03-24 05:38:48] [INFO ] Dead Transitions using invariants and state equation in 1044 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1074 ms. Remains : 843/854 places, 1614/1615 transitions.
[2023-03-24 05:38:48] [INFO ] Flatten gal took : 66 ms
[2023-03-24 05:38:48] [INFO ] Flatten gal took : 75 ms
[2023-03-24 05:38:48] [INFO ] Input system was already deterministic with 1614 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
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 844 transition count 1569
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 798 transition count 1569
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 798 transition count 1525
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 754 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 753 transition count 1524
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 753 transition count 1524
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 186 place count 751 transition count 1522
Applied a total of 186 rules in 89 ms. Remains 751 /854 variables (removed 103) and now considering 1522/1615 (removed 93) transitions.
[2023-03-24 05:38:48] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-24 05:38:48] [INFO ] Computed 102 place invariants in 19 ms
[2023-03-24 05:38:49] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 900 ms. Remains : 751/854 places, 1522/1615 transitions.
[2023-03-24 05:38:49] [INFO ] Flatten gal took : 55 ms
[2023-03-24 05:38:49] [INFO ] Flatten gal took : 59 ms
[2023-03-24 05:38:49] [INFO ] Input system was already deterministic with 1522 transitions.
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
FORMULA PolyORBNT-COL-S10J40-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 844 transition count 1570
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 799 transition count 1570
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 90 place count 799 transition count 1525
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 180 place count 754 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 753 transition count 1524
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 753 transition count 1524
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 752 transition count 1523
Applied a total of 184 rules in 96 ms. Remains 752 /854 variables (removed 102) and now considering 1523/1615 (removed 92) transitions.
[2023-03-24 05:38:49] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
// Phase 1: matrix 1514 rows 752 cols
[2023-03-24 05:38:50] [INFO ] Computed 102 place invariants in 22 ms
[2023-03-24 05:38:50] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 786 ms. Remains : 752/854 places, 1523/1615 transitions.
[2023-03-24 05:38:50] [INFO ] Flatten gal took : 54 ms
[2023-03-24 05:38:50] [INFO ] Flatten gal took : 59 ms
[2023-03-24 05:38:50] [INFO ] Input system was already deterministic with 1523 transitions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 853 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 853 transition count 1614
Applied a total of 2 rules in 27 ms. Remains 853 /854 variables (removed 1) and now considering 1614/1615 (removed 1) transitions.
[2023-03-24 05:38:50] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 853 cols
[2023-03-24 05:38:50] [INFO ] Computed 112 place invariants in 20 ms
[2023-03-24 05:38:51] [INFO ] Dead Transitions using invariants and state equation in 983 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1011 ms. Remains : 853/854 places, 1614/1615 transitions.
[2023-03-24 05:38:51] [INFO ] Flatten gal took : 59 ms
[2023-03-24 05:38:52] [INFO ] Flatten gal took : 78 ms
[2023-03-24 05:38:52] [INFO ] Input system was already deterministic with 1614 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 844 transition count 1610
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 839 transition count 1610
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 10 place count 839 transition count 1565
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 100 place count 794 transition count 1565
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 793 transition count 1564
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 793 transition count 1564
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 106 place count 791 transition count 1562
Applied a total of 106 rules in 61 ms. Remains 791 /854 variables (removed 63) and now considering 1562/1615 (removed 53) transitions.
[2023-03-24 05:38:52] [INFO ] Flow matrix only has 1553 transitions (discarded 9 similar events)
// Phase 1: matrix 1553 rows 791 cols
[2023-03-24 05:38:52] [INFO ] Computed 102 place invariants in 18 ms
[2023-03-24 05:38:53] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 879 ms. Remains : 791/854 places, 1562/1615 transitions.
[2023-03-24 05:38:53] [INFO ] Flatten gal took : 61 ms
[2023-03-24 05:38:53] [INFO ] Flatten gal took : 62 ms
[2023-03-24 05:38:53] [INFO ] Input system was already deterministic with 1562 transitions.
Finished random walk after 571 steps, including 45 resets, run visited all 1 properties in 27 ms. (steps per millisecond=21 )
FORMULA PolyORBNT-COL-S10J40-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 853 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 853 transition count 1614
Applied a total of 2 rules in 24 ms. Remains 853 /854 variables (removed 1) and now considering 1614/1615 (removed 1) transitions.
[2023-03-24 05:38:53] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 853 cols
[2023-03-24 05:38:53] [INFO ] Computed 112 place invariants in 26 ms
[2023-03-24 05:38:54] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1020 ms. Remains : 853/854 places, 1614/1615 transitions.
[2023-03-24 05:38:54] [INFO ] Flatten gal took : 59 ms
[2023-03-24 05:38:54] [INFO ] Flatten gal took : 61 ms
[2023-03-24 05:38:54] [INFO ] Input system was already deterministic with 1614 transitions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 1615
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 843 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 843 transition count 1614
Applied a total of 12 rules in 29 ms. Remains 843 /854 variables (removed 11) and now considering 1614/1615 (removed 1) transitions.
[2023-03-24 05:38:54] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-24 05:38:54] [INFO ] Computed 102 place invariants in 29 ms
[2023-03-24 05:38:55] [INFO ] Dead Transitions using invariants and state equation in 1026 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1056 ms. Remains : 843/854 places, 1614/1615 transitions.
[2023-03-24 05:38:55] [INFO ] Flatten gal took : 56 ms
[2023-03-24 05:38:55] [INFO ] Flatten gal took : 59 ms
[2023-03-24 05:38:55] [INFO ] Input system was already deterministic with 1614 transitions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 1615
Applied a total of 10 rules in 12 ms. Remains 844 /854 variables (removed 10) and now considering 1615/1615 (removed 0) transitions.
[2023-03-24 05:38:55] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
// Phase 1: matrix 1606 rows 844 cols
[2023-03-24 05:38:55] [INFO ] Computed 102 place invariants in 27 ms
[2023-03-24 05:38:56] [INFO ] Dead Transitions using invariants and state equation in 982 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 995 ms. Remains : 844/854 places, 1615/1615 transitions.
[2023-03-24 05:38:57] [INFO ] Flatten gal took : 59 ms
[2023-03-24 05:38:57] [INFO ] Flatten gal took : 66 ms
[2023-03-24 05:38:57] [INFO ] Input system was already deterministic with 1615 transitions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 1615
Applied a total of 10 rules in 16 ms. Remains 844 /854 variables (removed 10) and now considering 1615/1615 (removed 0) transitions.
[2023-03-24 05:38:57] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-24 05:38:57] [INFO ] Invariant cache hit.
[2023-03-24 05:38:58] [INFO ] Dead Transitions using invariants and state equation in 974 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 995 ms. Remains : 844/854 places, 1615/1615 transitions.
[2023-03-24 05:38:58] [INFO ] Flatten gal took : 60 ms
[2023-03-24 05:38:58] [INFO ] Flatten gal took : 66 ms
[2023-03-24 05:38:58] [INFO ] Input system was already deterministic with 1615 transitions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 1615
Applied a total of 10 rules in 13 ms. Remains 844 /854 variables (removed 10) and now considering 1615/1615 (removed 0) transitions.
[2023-03-24 05:38:58] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-24 05:38:58] [INFO ] Invariant cache hit.
[2023-03-24 05:38:59] [INFO ] Dead Transitions using invariants and state equation in 963 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 978 ms. Remains : 844/854 places, 1615/1615 transitions.
[2023-03-24 05:38:59] [INFO ] Flatten gal took : 64 ms
[2023-03-24 05:38:59] [INFO ] Flatten gal took : 74 ms
[2023-03-24 05:38:59] [INFO ] Input system was already deterministic with 1615 transitions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 1615/1615 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 1615
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 843 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 843 transition count 1614
Applied a total of 12 rules in 27 ms. Remains 843 /854 variables (removed 11) and now considering 1614/1615 (removed 1) transitions.
[2023-03-24 05:38:59] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-24 05:38:59] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-24 05:39:00] [INFO ] Dead Transitions using invariants and state equation in 1039 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1068 ms. Remains : 843/854 places, 1614/1615 transitions.
[2023-03-24 05:39:00] [INFO ] Flatten gal took : 57 ms
[2023-03-24 05:39:00] [INFO ] Flatten gal took : 59 ms
[2023-03-24 05:39:01] [INFO ] Input system was already deterministic with 1614 transitions.
[2023-03-24 05:39:01] [INFO ] Flatten gal took : 100 ms
[2023-03-24 05:39:01] [INFO ] Flatten gal took : 101 ms
[2023-03-24 05:39:01] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 26 ms.
[2023-03-24 05:39:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 854 places, 1615 transitions and 9824 arcs took 8 ms.
Total runtime 342453 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 854 NrTr: 1615 NrArc: 9824)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.199sec

net check time: 0m 0.001sec

init dd package: 0m 2.682sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7640244 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16088044 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.013sec

956325 2297233 2777090

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-S10J40"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is PolyORBNT-COL-S10J40, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tall-167873952100690"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J40.tgz
mv PolyORBNT-COL-S10J40 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;