fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r307-tall-167873961300402
Last Updated
May 14, 2023

About the Execution of ITS-Tools for PolyORBNT-COL-S05J30

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13931.903 1800000.00 2826875.00 4633.10 [undef] Time out reached

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.r307-tall-167873961300402.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBNT-COL-S05J30, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tall-167873961300402
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.4K Feb 25 23:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 23:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 23:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K 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.3K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 23:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678866304913

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S05J30
Not applying reductions.
Model is COL
QuasiLiveness COL
Running Version 202303021504
[2023-03-15 07:45:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-15 07:45:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:45:06] [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-15 07:45:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 07:45:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 718 ms
[2023-03-15 07:45:07] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 19 ms.
[2023-03-15 07:45:07] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 52 ms.
[2023-03-15 07:45:07] [INFO ] Unfolded 38 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 07:45:07] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-15 07:45:07] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 07:45:07] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 30 places in 7 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 694 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 36) seen :32
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-15 07:45:07] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2023-03-15 07:45:07] [INFO ] Flatten gal took : 188 ms
[2023-03-15 07:45:07] [INFO ] Computed 82 place invariants in 42 ms
[2023-03-15 07:45:07] [INFO ] Flatten gal took : 103 ms
[2023-03-15 07:45:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13099619116503952553.gal : 68 ms
[2023-03-15 07:45:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15212974641148333456.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13099619116503952553.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15212974641148333456.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
[2023-03-15 07:45:08] [INFO ] [Real]Absence check using 75 positive place invariants in 25 ms returned sat
[2023-03-15 07:45:08] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 12 ms returned sat
Loading property file /tmp/ReachabilityCardinality15212974641148333456.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14 after 17
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :17 after 30
[2023-03-15 07:45:08] [INFO ] After 647ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :30 after 48
[2023-03-15 07:45:08] [INFO ] [Nat]Absence check using 75 positive place invariants in 19 ms returned sat
[2023-03-15 07:45:08] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :48 after 71
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :71 after 115
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :115 after 192
[2023-03-15 07:45:09] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:45:09] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :192 after 789
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :789 after 2259
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2259 after 5455
[2023-03-15 07:45:18] [INFO ] After 9005ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:45:18] [INFO ] After 9706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 484 transition count 709
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 77 place count 448 transition count 709
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 77 place count 448 transition count 674
Deduced a syphon composed of 35 places in 6 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 147 place count 413 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 412 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 412 transition count 673
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 153 place count 410 transition count 671
Applied a total of 153 rules in 162 ms. Remains 410 /489 variables (removed 79) and now considering 671/745 (removed 74) transitions.
[2023-03-15 07:45:18] [INFO ] Flow matrix only has 667 transitions (discarded 4 similar events)
// Phase 1: matrix 667 rows 410 cols
[2023-03-15 07:45:18] [INFO ] Computed 77 place invariants in 20 ms
[2023-03-15 07:45:18] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 410/489 places, 576/745 transitions.
Applied a total of 0 rules in 32 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 544 ms. Remains : 410/489 places, 576/745 transitions.
Incomplete random walk after 1000000 steps, including 52160 resets, run finished after 3702 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5667 resets, run finished after 960 ms. (steps per millisecond=1041 ) properties (out of 1) seen :0
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5455 after 17487
Interrupted probabilistic random walk after 3000457 steps, run timeout after 12001 ms. (steps per millisecond=250 ) properties seen :{}
Probabilistic random walk after 3000457 steps, saw 876819 distinct states, run finished after 12002 ms. (steps per millisecond=249 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:45:35] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 07:45:35] [INFO ] Computed 77 place invariants in 24 ms
[2023-03-15 07:45:35] [INFO ] [Real]Absence check using 70 positive place invariants in 21 ms returned sat
[2023-03-15 07:45:35] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 07:45:35] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:45:35] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-15 07:45:35] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 07:45:35] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:45:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:45:35] [INFO ] After 112ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:45:36] [INFO ] Deduced a trap composed of 137 places in 141 ms of which 3 ms to minimize.
[2023-03-15 07:45:36] [INFO ] Deduced a trap composed of 125 places in 148 ms of which 1 ms to minimize.
[2023-03-15 07:45:36] [INFO ] Deduced a trap composed of 125 places in 167 ms of which 1 ms to minimize.
[2023-03-15 07:45:36] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 2 ms to minimize.
[2023-03-15 07:45:36] [INFO ] Deduced a trap composed of 128 places in 131 ms of which 0 ms to minimize.
[2023-03-15 07:45:36] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 1 ms to minimize.
[2023-03-15 07:45:37] [INFO ] Deduced a trap composed of 134 places in 120 ms of which 0 ms to minimize.
[2023-03-15 07:45:37] [INFO ] Deduced a trap composed of 128 places in 157 ms of which 1 ms to minimize.
[2023-03-15 07:45:37] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 1 ms to minimize.
[2023-03-15 07:45:37] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:45:37] [INFO ] Deduced a trap composed of 122 places in 108 ms of which 0 ms to minimize.
[2023-03-15 07:45:37] [INFO ] Deduced a trap composed of 137 places in 132 ms of which 0 ms to minimize.
[2023-03-15 07:45:38] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 0 ms to minimize.
[2023-03-15 07:45:38] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:45:38] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 0 ms to minimize.
[2023-03-15 07:45:38] [INFO ] Deduced a trap composed of 128 places in 117 ms of which 1 ms to minimize.
[2023-03-15 07:45:38] [INFO ] Deduced a trap composed of 134 places in 111 ms of which 1 ms to minimize.
[2023-03-15 07:45:38] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 0 ms to minimize.
[2023-03-15 07:45:39] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 1 ms to minimize.
[2023-03-15 07:45:39] [INFO ] Deduced a trap composed of 131 places in 120 ms of which 0 ms to minimize.
[2023-03-15 07:45:39] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 0 ms to minimize.
[2023-03-15 07:45:39] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:45:39] [INFO ] Deduced a trap composed of 119 places in 123 ms of which 0 ms to minimize.
[2023-03-15 07:45:40] [INFO ] Deduced a trap composed of 134 places in 121 ms of which 0 ms to minimize.
[2023-03-15 07:45:40] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 0 ms to minimize.
[2023-03-15 07:45:41] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 1 ms to minimize.
[2023-03-15 07:45:41] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 0 ms to minimize.
[2023-03-15 07:45:41] [INFO ] Deduced a trap composed of 137 places in 117 ms of which 0 ms to minimize.
[2023-03-15 07:45:41] [INFO ] Deduced a trap composed of 137 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:45:41] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:45:41] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 0 ms to minimize.
[2023-03-15 07:45:42] [INFO ] Deduced a trap composed of 134 places in 131 ms of which 1 ms to minimize.
[2023-03-15 07:45:42] [INFO ] Deduced a trap composed of 116 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:45:42] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 1 ms to minimize.
[2023-03-15 07:45:42] [INFO ] Deduced a trap composed of 137 places in 129 ms of which 4 ms to minimize.
[2023-03-15 07:45:43] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 0 ms to minimize.
[2023-03-15 07:45:43] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:45:43] [INFO ] Deduced a trap composed of 113 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:45:44] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 1 ms to minimize.
[2023-03-15 07:45:45] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :17487 after 111100
[2023-03-15 07:45:47] [INFO ] Deduced a trap composed of 119 places in 117 ms of which 0 ms to minimize.
[2023-03-15 07:45:47] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 1 ms to minimize.
[2023-03-15 07:45:47] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 0 ms to minimize.
[2023-03-15 07:45:48] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 1 ms to minimize.
[2023-03-15 07:45:48] [INFO ] Deduced a trap composed of 143 places in 122 ms of which 1 ms to minimize.
[2023-03-15 07:45:48] [INFO ] Deduced a trap composed of 119 places in 121 ms of which 0 ms to minimize.
[2023-03-15 07:45:49] [INFO ] Deduced a trap composed of 114 places in 123 ms of which 1 ms to minimize.
[2023-03-15 07:45:49] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 0 ms to minimize.
[2023-03-15 07:45:49] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 1 ms to minimize.
[2023-03-15 07:45:49] [INFO ] Deduced a trap composed of 123 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:45:50] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 1 ms to minimize.
[2023-03-15 07:45:50] [INFO ] Deduced a trap composed of 141 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:45:50] [INFO ] Deduced a trap composed of 134 places in 116 ms of which 1 ms to minimize.
[2023-03-15 07:45:50] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:45:50] [INFO ] Deduced a trap composed of 122 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:45:51] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 9 ms to minimize.
[2023-03-15 07:45:51] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 0 ms to minimize.
[2023-03-15 07:45:51] [INFO ] Deduced a trap composed of 122 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:45:54] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:45:55] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 0 ms to minimize.
[2023-03-15 07:45:56] [INFO ] Deduced a trap composed of 129 places in 120 ms of which 0 ms to minimize.
[2023-03-15 07:45:56] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 1 ms to minimize.
[2023-03-15 07:45:57] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:45:57] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2023-03-15 07:45:57] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 2 ms to minimize.
[2023-03-15 07:46:01] [INFO ] Deduced a trap composed of 128 places in 122 ms of which 1 ms to minimize.
[2023-03-15 07:46:10] [INFO ] Trap strengthening (SAT) tested/added 66/66 trap constraints in 35001 ms
[2023-03-15 07:46:11] [INFO ] After 35189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:46:11] [INFO ] After 35466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 19 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 15 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-15 07:46:11] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 07:46:11] [INFO ] Invariant cache hit.
[2023-03-15 07:46:11] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-15 07:46:11] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 07:46:11] [INFO ] Invariant cache hit.
[2023-03-15 07:46:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:46:12] [INFO ] Implicit Places using invariants and state equation in 1287 ms returned []
Implicit Place search using SMT with State Equation took 1602 ms to find 0 implicit places.
[2023-03-15 07:46:12] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-15 07:46:12] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 07:46:12] [INFO ] Invariant cache hit.
[2023-03-15 07:46:12] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1938 ms. Remains : 410/410 places, 576/576 transitions.
Incomplete random walk after 100000 steps, including 5208 resets, run finished after 514 ms. (steps per millisecond=194 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:46:13] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 07:46:13] [INFO ] Invariant cache hit.
[2023-03-15 07:46:13] [INFO ] [Real]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-15 07:46:13] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 07:46:13] [INFO ] After 124ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 07:46:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:46:13] [INFO ] After 49ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 07:46:13] [INFO ] After 100ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:46:13] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:46:13] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-15 07:46:13] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 07:46:14] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:46:14] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:46:14] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 0 ms to minimize.
[2023-03-15 07:46:14] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 1 ms to minimize.
[2023-03-15 07:46:14] [INFO ] Deduced a trap composed of 140 places in 106 ms of which 0 ms to minimize.
[2023-03-15 07:46:14] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 0 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 131072
[2023-03-15 07:46:14] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 0 ms to minimize.
SDD size :111100 after 362095
[2023-03-15 07:46:15] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 1 ms to minimize.
[2023-03-15 07:46:15] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 1 ms to minimize.
[2023-03-15 07:46:15] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:46:15] [INFO ] Deduced a trap composed of 119 places in 106 ms of which 0 ms to minimize.
[2023-03-15 07:46:15] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 0 ms to minimize.
[2023-03-15 07:46:15] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 0 ms to minimize.
[2023-03-15 07:46:15] [INFO ] Deduced a trap composed of 128 places in 107 ms of which 0 ms to minimize.
[2023-03-15 07:46:16] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 0 ms to minimize.
[2023-03-15 07:46:16] [INFO ] Deduced a trap composed of 119 places in 109 ms of which 0 ms to minimize.
[2023-03-15 07:46:16] [INFO ] Deduced a trap composed of 125 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:46:16] [INFO ] Deduced a trap composed of 119 places in 106 ms of which 0 ms to minimize.
[2023-03-15 07:46:16] [INFO ] Deduced a trap composed of 134 places in 107 ms of which 0 ms to minimize.
[2023-03-15 07:46:17] [INFO ] Deduced a trap composed of 134 places in 108 ms of which 1 ms to minimize.
[2023-03-15 07:46:17] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 1 ms to minimize.
[2023-03-15 07:46:17] [INFO ] Deduced a trap composed of 122 places in 107 ms of which 0 ms to minimize.
[2023-03-15 07:46:17] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 0 ms to minimize.
[2023-03-15 07:46:17] [INFO ] Deduced a trap composed of 137 places in 120 ms of which 1 ms to minimize.
[2023-03-15 07:46:21] [INFO ] Deduced a trap composed of 116 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:46:23] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 0 ms to minimize.
[2023-03-15 07:46:24] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:46:29] [INFO ] Deduced a trap composed of 134 places in 120 ms of which 1 ms to minimize.
[2023-03-15 07:46:31] [INFO ] Deduced a trap composed of 137 places in 119 ms of which 2 ms to minimize.
[2023-03-15 07:46:33] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:46:40] [INFO ] Deduced a trap composed of 119 places in 119 ms of which 1 ms to minimize.
[2023-03-15 07:46:49] [INFO ] Trap strengthening (SAT) tested/added 29/29 trap constraints in 35078 ms
[2023-03-15 07:46:49] [INFO ] After 35161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:46:49] [INFO ] After 35604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 52318 resets, run finished after 3633 ms. (steps per millisecond=275 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5555 resets, run finished after 950 ms. (steps per millisecond=1052 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3027138 steps, run timeout after 12001 ms. (steps per millisecond=252 ) properties seen :{}
Probabilistic random walk after 3027138 steps, saw 884381 distinct states, run finished after 12001 ms. (steps per millisecond=252 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:47:06] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 07:47:06] [INFO ] Invariant cache hit.
[2023-03-15 07:47:06] [INFO ] [Real]Absence check using 70 positive place invariants in 30 ms returned sat
[2023-03-15 07:47:06] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 07:47:06] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:47:06] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-15 07:47:06] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 07:47:06] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:47:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:47:06] [INFO ] After 79ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:47:06] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:47:06] [INFO ] Deduced a trap composed of 131 places in 107 ms of which 1 ms to minimize.
[2023-03-15 07:47:06] [INFO ] Deduced a trap composed of 137 places in 105 ms of which 0 ms to minimize.
[2023-03-15 07:47:07] [INFO ] Deduced a trap composed of 125 places in 106 ms of which 1 ms to minimize.
[2023-03-15 07:47:07] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 1 ms to minimize.
[2023-03-15 07:47:07] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 1 ms to minimize.
[2023-03-15 07:47:07] [INFO ] Deduced a trap composed of 122 places in 108 ms of which 0 ms to minimize.
[2023-03-15 07:47:07] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:47:07] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:47:07] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:47:08] [INFO ] Deduced a trap composed of 119 places in 107 ms of which 0 ms to minimize.
[2023-03-15 07:47:08] [INFO ] Deduced a trap composed of 146 places in 107 ms of which 0 ms to minimize.
[2023-03-15 07:47:08] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 0 ms to minimize.
[2023-03-15 07:47:08] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 1 ms to minimize.
[2023-03-15 07:47:08] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:47:08] [INFO ] Deduced a trap composed of 140 places in 109 ms of which 0 ms to minimize.
[2023-03-15 07:47:08] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:47:09] [INFO ] Deduced a trap composed of 122 places in 108 ms of which 0 ms to minimize.
[2023-03-15 07:47:09] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 1 ms to minimize.
[2023-03-15 07:47:09] [INFO ] Deduced a trap composed of 140 places in 107 ms of which 1 ms to minimize.
[2023-03-15 07:47:09] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:47:09] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 1 ms to minimize.
[2023-03-15 07:47:09] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:47:09] [INFO ] Deduced a trap composed of 137 places in 107 ms of which 1 ms to minimize.
[2023-03-15 07:47:10] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 1 ms to minimize.
[2023-03-15 07:47:10] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:47:10] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 1 ms to minimize.
[2023-03-15 07:47:11] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:47:12] [INFO ] Deduced a trap composed of 122 places in 131 ms of which 1 ms to minimize.
[2023-03-15 07:47:13] [INFO ] Deduced a trap composed of 128 places in 117 ms of which 1 ms to minimize.
[2023-03-15 07:47:13] [INFO ] Deduced a trap composed of 125 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:47:13] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:47:13] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 1 ms to minimize.
[2023-03-15 07:47:15] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 0 ms to minimize.
[2023-03-15 07:47:16] [INFO ] Deduced a trap composed of 116 places in 114 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :362095 after 915485
[2023-03-15 07:47:24] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:47:24] [INFO ] Deduced a trap composed of 125 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:47:24] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:47:25] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2023-03-15 07:47:26] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:47:26] [INFO ] Deduced a trap composed of 131 places in 106 ms of which 1 ms to minimize.
[2023-03-15 07:47:27] [INFO ] Deduced a trap composed of 116 places in 118 ms of which 0 ms to minimize.
[2023-03-15 07:47:28] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 1 ms to minimize.
[2023-03-15 07:47:28] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:47:31] [INFO ] Deduced a trap composed of 134 places in 109 ms of which 1 ms to minimize.
[2023-03-15 07:47:32] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:47:32] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:47:32] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 2 ms to minimize.
[2023-03-15 07:47:41] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 34921 ms
[2023-03-15 07:47:41] [INFO ] After 35056ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:47:41] [INFO ] After 35469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 16 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 14 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-15 07:47:41] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 07:47:41] [INFO ] Invariant cache hit.
[2023-03-15 07:47:41] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-15 07:47:41] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 07:47:41] [INFO ] Invariant cache hit.
[2023-03-15 07:47:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:47:43] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 1653 ms to find 0 implicit places.
[2023-03-15 07:47:43] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-15 07:47:43] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 07:47:43] [INFO ] Invariant cache hit.
[2023-03-15 07:47:43] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1960 ms. Remains : 410/410 places, 576/576 transitions.
Incomplete random walk after 100000 steps, including 5198 resets, run finished after 363 ms. (steps per millisecond=275 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:47:43] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 07:47:43] [INFO ] Invariant cache hit.
[2023-03-15 07:47:44] [INFO ] [Real]Absence check using 70 positive place invariants in 23 ms returned sat
[2023-03-15 07:47:44] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 07:47:44] [INFO ] After 130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 07:47:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:47:44] [INFO ] After 47ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 07:47:44] [INFO ] After 85ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:47:44] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:47:44] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 07:47:44] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 07:47:44] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:47:44] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:47:44] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 1 ms to minimize.
[2023-03-15 07:47:45] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 0 ms to minimize.
[2023-03-15 07:47:45] [INFO ] Deduced a trap composed of 140 places in 106 ms of which 0 ms to minimize.
[2023-03-15 07:47:45] [INFO ] Deduced a trap composed of 131 places in 120 ms of which 0 ms to minimize.
[2023-03-15 07:47:45] [INFO ] Deduced a trap composed of 131 places in 105 ms of which 0 ms to minimize.
[2023-03-15 07:47:45] [INFO ] Deduced a trap composed of 128 places in 117 ms of which 0 ms to minimize.
[2023-03-15 07:47:45] [INFO ] Deduced a trap composed of 134 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:47:45] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:47:46] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 0 ms to minimize.
[2023-03-15 07:47:46] [INFO ] Deduced a trap composed of 125 places in 110 ms of which 1 ms to minimize.
[2023-03-15 07:47:46] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:47:46] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:47:46] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:47:46] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:47:46] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 0 ms to minimize.
[2023-03-15 07:47:47] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:47:47] [INFO ] Deduced a trap composed of 134 places in 118 ms of which 0 ms to minimize.
[2023-03-15 07:47:47] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:47:47] [INFO ] Deduced a trap composed of 134 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:47:47] [INFO ] Deduced a trap composed of 122 places in 108 ms of which 0 ms to minimize.
[2023-03-15 07:47:48] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 1 ms to minimize.
[2023-03-15 07:47:48] [INFO ] Deduced a trap composed of 137 places in 123 ms of which 0 ms to minimize.
[2023-03-15 07:47:52] [INFO ] Deduced a trap composed of 116 places in 119 ms of which 0 ms to minimize.
[2023-03-15 07:47:54] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:47:54] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:47:59] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:48:02] [INFO ] Deduced a trap composed of 137 places in 117 ms of which 0 ms to minimize.
[2023-03-15 07:48:04] [INFO ] Deduced a trap composed of 119 places in 119 ms of which 1 ms to minimize.
[2023-03-15 07:48:11] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 1 ms to minimize.
[2023-03-15 07:48:20] [INFO ] Trap strengthening (SAT) tested/added 29/29 trap constraints in 35440 ms
[2023-03-15 07:48:20] [INFO ] After 35485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:48:20] [INFO ] After 35922ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 544 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 675866 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{}
Probabilistic random walk after 675866 steps, saw 208389 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:48:23] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 07:48:23] [INFO ] Invariant cache hit.
[2023-03-15 07:48:23] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 07:48:23] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 07:48:23] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:48:23] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 07:48:23] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-15 07:48:23] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:48:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:48:23] [INFO ] After 109ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:48:23] [INFO ] Deduced a trap composed of 129 places in 121 ms of which 0 ms to minimize.
[2023-03-15 07:48:24] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:48:24] [INFO ] Deduced a trap composed of 129 places in 114 ms of which 1 ms to minimize.
[2023-03-15 07:48:24] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:48:24] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 0 ms to minimize.
[2023-03-15 07:48:24] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:48:24] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 1 ms to minimize.
[2023-03-15 07:48:25] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:48:25] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 1 ms to minimize.
[2023-03-15 07:48:25] [INFO ] Deduced a trap composed of 138 places in 117 ms of which 1 ms to minimize.
[2023-03-15 07:48:25] [INFO ] Deduced a trap composed of 123 places in 137 ms of which 1 ms to minimize.
[2023-03-15 07:48:25] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:48:25] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 1 ms to minimize.
[2023-03-15 07:48:26] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:48:26] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:48:26] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:48:26] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:48:26] [INFO ] Deduced a trap composed of 134 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:48:27] [INFO ] Deduced a trap composed of 137 places in 119 ms of which 0 ms to minimize.
[2023-03-15 07:48:27] [INFO ] Deduced a trap composed of 137 places in 109 ms of which 0 ms to minimize.
[2023-03-15 07:48:27] [INFO ] Deduced a trap composed of 140 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:48:28] [INFO ] Deduced a trap composed of 134 places in 121 ms of which 0 ms to minimize.
[2023-03-15 07:48:28] [INFO ] Deduced a trap composed of 137 places in 107 ms of which 0 ms to minimize.
[2023-03-15 07:48:28] [INFO ] Deduced a trap composed of 128 places in 108 ms of which 1 ms to minimize.
[2023-03-15 07:48:28] [INFO ] Deduced a trap composed of 140 places in 109 ms of which 0 ms to minimize.
[2023-03-15 07:48:28] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:48:28] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 0 ms to minimize.
[2023-03-15 07:48:29] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:48:29] [INFO ] Deduced a trap composed of 140 places in 109 ms of which 1 ms to minimize.
[2023-03-15 07:48:29] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:48:29] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:48:29] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:48:29] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:48:30] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:48:30] [INFO ] Deduced a trap composed of 126 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:48:30] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:48:30] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:48:30] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 1 ms to minimize.
[2023-03-15 07:48:31] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:48:31] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:48:31] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:48:31] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 0 ms to minimize.
[2023-03-15 07:48:32] [INFO ] Deduced a trap composed of 137 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:48:32] [INFO ] Deduced a trap composed of 138 places in 117 ms of which 0 ms to minimize.
[2023-03-15 07:48:32] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:48:33] [INFO ] Deduced a trap composed of 134 places in 114 ms of which 1 ms to minimize.
[2023-03-15 07:48:33] [INFO ] Deduced a trap composed of 119 places in 109 ms of which 1 ms to minimize.
[2023-03-15 07:48:36] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 0 ms to minimize.
[2023-03-15 07:48:45] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 21175 ms
[2023-03-15 07:48:45] [INFO ] After 21303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:48:45] [INFO ] After 21727ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 17 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-15 07:48:45] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 07:48:45] [INFO ] Invariant cache hit.
[2023-03-15 07:48:45] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 410/410 places, 576/576 transitions.
Incomplete random walk after 10000 steps, including 501 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 682089 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 682089 steps, saw 210431 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:48:48] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 07:48:48] [INFO ] Invariant cache hit.
[2023-03-15 07:48:48] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 07:48:48] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 07:48:48] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:48:48] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 07:48:48] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 07:48:48] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:48:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:48:49] [INFO ] After 113ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:48:49] [INFO ] Deduced a trap composed of 129 places in 122 ms of which 1 ms to minimize.
[2023-03-15 07:48:49] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:48:49] [INFO ] Deduced a trap composed of 129 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:48:49] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:48:49] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:48:49] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:48:50] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 1 ms to minimize.
[2023-03-15 07:48:50] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 0 ms to minimize.
[2023-03-15 07:48:50] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:48:50] [INFO ] Deduced a trap composed of 138 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:48:50] [INFO ] Deduced a trap composed of 123 places in 122 ms of which 1 ms to minimize.
[2023-03-15 07:48:50] [INFO ] Deduced a trap composed of 128 places in 131 ms of which 1 ms to minimize.
[2023-03-15 07:48:51] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 1 ms to minimize.
[2023-03-15 07:48:51] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:48:51] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:48:51] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:48:51] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:48:51] [INFO ] Deduced a trap composed of 134 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:48:52] [INFO ] Deduced a trap composed of 137 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:48:52] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 1 ms to minimize.
[2023-03-15 07:48:53] [INFO ] Deduced a trap composed of 140 places in 118 ms of which 0 ms to minimize.
[2023-03-15 07:48:53] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:48:53] [INFO ] Deduced a trap composed of 137 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:48:53] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:48:53] [INFO ] Deduced a trap composed of 140 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:48:53] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:48:54] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 1 ms to minimize.
[2023-03-15 07:48:54] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:48:54] [INFO ] Deduced a trap composed of 140 places in 121 ms of which 1 ms to minimize.
[2023-03-15 07:48:54] [INFO ] Deduced a trap composed of 134 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:48:54] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 1 ms to minimize.
[2023-03-15 07:48:54] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 1 ms to minimize.
[2023-03-15 07:48:55] [INFO ] Deduced a trap composed of 129 places in 120 ms of which 1 ms to minimize.
[2023-03-15 07:48:55] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 0 ms to minimize.
[2023-03-15 07:48:55] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 1 ms to minimize.
[2023-03-15 07:48:55] [INFO ] Deduced a trap composed of 119 places in 119 ms of which 3 ms to minimize.
[2023-03-15 07:48:55] [INFO ] Deduced a trap composed of 131 places in 120 ms of which 1 ms to minimize.
[2023-03-15 07:48:56] [INFO ] Deduced a trap composed of 119 places in 117 ms of which 0 ms to minimize.
[2023-03-15 07:48:56] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:48:56] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 1 ms to minimize.
[2023-03-15 07:48:56] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 1 ms to minimize.
[2023-03-15 07:48:56] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 0 ms to minimize.
[2023-03-15 07:48:57] [INFO ] Deduced a trap composed of 137 places in 120 ms of which 0 ms to minimize.
[2023-03-15 07:48:57] [INFO ] Deduced a trap composed of 138 places in 120 ms of which 1 ms to minimize.
[2023-03-15 07:48:57] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 0 ms to minimize.
[2023-03-15 07:48:58] [INFO ] Deduced a trap composed of 134 places in 121 ms of which 1 ms to minimize.
[2023-03-15 07:48:58] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:49:01] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:49:10] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 21363 ms
[2023-03-15 07:49:10] [INFO ] After 21494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:49:10] [INFO ] After 21921ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 22 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 26 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-15 07:49:10] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 07:49:10] [INFO ] Invariant cache hit.
[2023-03-15 07:49:10] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-15 07:49:10] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 07:49:10] [INFO ] Invariant cache hit.
[2023-03-15 07:49:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:49:12] [INFO ] Implicit Places using invariants and state equation in 1328 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
[2023-03-15 07:49:12] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-15 07:49:12] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 07:49:12] [INFO ] Invariant cache hit.
[2023-03-15 07:49:12] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2005 ms. Remains : 410/410 places, 576/576 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 410 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 410 transition count 571
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 409 transition count 571
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 409 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 408 transition count 570
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 408 transition count 565
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 403 transition count 565
Applied a total of 18 rules in 50 ms. Remains 403 /410 variables (removed 7) and now considering 565/576 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 565 rows 403 cols
[2023-03-15 07:49:12] [INFO ] Computed 77 place invariants in 12 ms
[2023-03-15 07:49:12] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 07:49:12] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 07:49:12] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:49:12] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-15 07:49:12] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 07:49:12] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:49:12] [INFO ] Deduced a trap composed of 123 places in 119 ms of which 1 ms to minimize.
[2023-03-15 07:49:13] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:49:13] [INFO ] Deduced a trap composed of 123 places in 111 ms of which 1 ms to minimize.
[2023-03-15 07:49:13] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 1 ms to minimize.
[2023-03-15 07:49:13] [INFO ] Deduced a trap composed of 129 places in 108 ms of which 1 ms to minimize.
[2023-03-15 07:49:13] [INFO ] Deduced a trap composed of 126 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:49:13] [INFO ] Deduced a trap composed of 117 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:49:13] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:49:14] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 0 ms to minimize.
[2023-03-15 07:49:14] [INFO ] Deduced a trap composed of 123 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:49:14] [INFO ] Deduced a trap composed of 126 places in 110 ms of which 1 ms to minimize.
[2023-03-15 07:49:14] [INFO ] Deduced a trap composed of 123 places in 119 ms of which 1 ms to minimize.
[2023-03-15 07:49:14] [INFO ] Deduced a trap composed of 126 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:49:14] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:49:15] [INFO ] Deduced a trap composed of 129 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:49:15] [INFO ] Deduced a trap composed of 132 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:49:15] [INFO ] Deduced a trap composed of 132 places in 107 ms of which 0 ms to minimize.
[2023-03-15 07:49:15] [INFO ] Deduced a trap composed of 126 places in 109 ms of which 1 ms to minimize.
[2023-03-15 07:49:15] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 1 ms to minimize.
[2023-03-15 07:49:15] [INFO ] Deduced a trap composed of 135 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:49:15] [INFO ] Deduced a trap composed of 117 places in 108 ms of which 0 ms to minimize.
[2023-03-15 07:49:16] [INFO ] Deduced a trap composed of 129 places in 110 ms of which 1 ms to minimize.
[2023-03-15 07:49:16] [INFO ] Deduced a trap composed of 126 places in 110 ms of which 1 ms to minimize.
[2023-03-15 07:49:16] [INFO ] Deduced a trap composed of 117 places in 109 ms of which 0 ms to minimize.
[2023-03-15 07:49:16] [INFO ] Deduced a trap composed of 120 places in 109 ms of which 0 ms to minimize.
[2023-03-15 07:49:16] [INFO ] Deduced a trap composed of 126 places in 108 ms of which 0 ms to minimize.
[2023-03-15 07:49:16] [INFO ] Deduced a trap composed of 126 places in 108 ms of which 1 ms to minimize.
[2023-03-15 07:49:17] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:49:17] [INFO ] Deduced a trap composed of 126 places in 109 ms of which 1 ms to minimize.
[2023-03-15 07:49:17] [INFO ] Deduced a trap composed of 120 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:49:17] [INFO ] Deduced a trap composed of 114 places in 116 ms of which 1 ms to minimize.
[2023-03-15 07:49:17] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 0 ms to minimize.
[2023-03-15 07:49:18] [INFO ] Deduced a trap composed of 121 places in 114 ms of which 1 ms to minimize.
[2023-03-15 07:49:18] [INFO ] Deduced a trap composed of 117 places in 111 ms of which 1 ms to minimize.
[2023-03-15 07:49:18] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:49:18] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:49:18] [INFO ] Deduced a trap composed of 132 places in 110 ms of which 1 ms to minimize.
[2023-03-15 07:49:18] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:49:18] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:49:19] [INFO ] Deduced a trap composed of 120 places in 108 ms of which 1 ms to minimize.
[2023-03-15 07:49:19] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:49:19] [INFO ] Deduced a trap composed of 132 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:49:19] [INFO ] Deduced a trap composed of 135 places in 108 ms of which 0 ms to minimize.
[2023-03-15 07:49:19] [INFO ] Deduced a trap composed of 123 places in 109 ms of which 0 ms to minimize.
[2023-03-15 07:49:20] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:49:20] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 1 ms to minimize.
[2023-03-15 07:49:20] [INFO ] Deduced a trap composed of 120 places in 111 ms of which 1 ms to minimize.
[2023-03-15 07:49:20] [INFO ] Deduced a trap composed of 129 places in 120 ms of which 0 ms to minimize.
[2023-03-15 07:49:20] [INFO ] Deduced a trap composed of 144 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:49:21] [INFO ] Deduced a trap composed of 135 places in 118 ms of which 0 ms to minimize.
[2023-03-15 07:49:22] [INFO ] Deduced a trap composed of 135 places in 121 ms of which 0 ms to minimize.
[2023-03-15 07:49:22] [INFO ] Deduced a trap composed of 132 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:49:23] [INFO ] Deduced a trap composed of 114 places in 119 ms of which 0 ms to minimize.
[2023-03-15 07:49:26] [INFO ] Deduced a trap composed of 123 places in 118 ms of which 1 ms to minimize.
[2023-03-15 07:49:26] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:49:27] [INFO ] Deduced a trap composed of 138 places in 119 ms of which 1 ms to minimize.
[2023-03-15 07:49:31] [INFO ] Deduced a trap composed of 120 places in 118 ms of which 0 ms to minimize.
[2023-03-15 07:49:32] [INFO ] Deduced a trap composed of 126 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:49:32] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:49:34] [INFO ] Deduced a trap composed of 120 places in 117 ms of which 1 ms to minimize.
[2023-03-15 07:49:35] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:49:35] [INFO ] Deduced a trap composed of 138 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:49:39] [INFO ] Deduced a trap composed of 117 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:49:40] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:49:42] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:49:42] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:49:42] [INFO ] Deduced a trap composed of 138 places in 118 ms of which 1 ms to minimize.
[2023-03-15 07:49:43] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 1 ms to minimize.
[2023-03-15 07:49:43] [INFO ] Deduced a trap composed of 117 places in 110 ms of which 1 ms to minimize.
[2023-03-15 07:49:47] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 1 ms to minimize.
[2023-03-15 07:49:49] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:49:53] [INFO ] Deduced a trap composed of 132 places in 118 ms of which 1 ms to minimize.
[2023-03-15 07:49:57] [INFO ] Deduced a trap composed of 114 places in 111 ms of which 1 ms to minimize.
[2023-03-15 07:50:00] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 0 ms to minimize.
[2023-03-15 07:50:06] [INFO ] Deduced a trap composed of 117 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:50:12] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:50:19] [INFO ] Deduced a trap composed of 120 places in 107 ms of which 0 ms to minimize.
[2023-03-15 07:50:20] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 1 ms to minimize.
[2023-03-15 07:50:25] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:50:29] [INFO ] Deduced a trap composed of 123 places in 120 ms of which 0 ms to minimize.
[2023-03-15 07:50:31] [INFO ] Deduced a trap composed of 120 places in 117 ms of which 0 ms to minimize.
[2023-03-15 07:50:40] [INFO ] Trap strengthening (SAT) tested/added 81/81 trap constraints in 87159 ms
[2023-03-15 07:50:40] [INFO ] After 87401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:50:40] [INFO ] After 87482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 410 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 410 transition count 571
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 409 transition count 571
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 409 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 408 transition count 570
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 408 transition count 565
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 403 transition count 565
Applied a total of 18 rules in 44 ms. Remains 403 /410 variables (removed 7) and now considering 565/576 (removed 11) transitions.
Running SMT prover for 1 properties.
[2023-03-15 07:50:40] [INFO ] Invariant cache hit.
[2023-03-15 07:50:40] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 07:50:40] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 07:50:40] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:50:40] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-15 07:50:40] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 07:50:40] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:50:40] [INFO ] Deduced a trap composed of 146 places in 122 ms of which 0 ms to minimize.
[2023-03-15 07:50:40] [INFO ] Deduced a trap composed of 148 places in 116 ms of which 1 ms to minimize.
[2023-03-15 07:50:40] [INFO ] Deduced a trap composed of 148 places in 116 ms of which 1 ms to minimize.
[2023-03-15 07:50:41] [INFO ] Deduced a trap composed of 146 places in 110 ms of which 1 ms to minimize.
[2023-03-15 07:50:41] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:50:41] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:50:41] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:50:41] [INFO ] Deduced a trap composed of 117 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:50:41] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 1 ms to minimize.
[2023-03-15 07:50:41] [INFO ] Deduced a trap composed of 117 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:50:42] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:50:42] [INFO ] Deduced a trap composed of 126 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:50:42] [INFO ] Deduced a trap composed of 126 places in 123 ms of which 0 ms to minimize.
[2023-03-15 07:50:42] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 1 ms to minimize.
[2023-03-15 07:50:42] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:50:42] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:50:43] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 0 ms to minimize.
[2023-03-15 07:50:43] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:50:43] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 1 ms to minimize.
[2023-03-15 07:50:43] [INFO ] Deduced a trap composed of 120 places in 109 ms of which 0 ms to minimize.
[2023-03-15 07:50:43] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 1 ms to minimize.
[2023-03-15 07:50:43] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 1 ms to minimize.
[2023-03-15 07:50:44] [INFO ] Deduced a trap composed of 117 places in 116 ms of which 1 ms to minimize.
[2023-03-15 07:50:44] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:50:44] [INFO ] Deduced a trap composed of 120 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:50:44] [INFO ] Deduced a trap composed of 123 places in 107 ms of which 0 ms to minimize.
[2023-03-15 07:50:44] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:50:44] [INFO ] Deduced a trap composed of 129 places in 110 ms of which 1 ms to minimize.
[2023-03-15 07:50:45] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 0 ms to minimize.
[2023-03-15 07:50:45] [INFO ] Deduced a trap composed of 141 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:50:45] [INFO ] Deduced a trap composed of 114 places in 108 ms of which 1 ms to minimize.
[2023-03-15 07:50:45] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:50:45] [INFO ] Deduced a trap composed of 126 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:50:45] [INFO ] Deduced a trap composed of 123 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:50:45] [INFO ] Deduced a trap composed of 132 places in 118 ms of which 0 ms to minimize.
[2023-03-15 07:50:46] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 1 ms to minimize.
[2023-03-15 07:50:46] [INFO ] Deduced a trap composed of 135 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:50:46] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:50:46] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:50:46] [INFO ] Deduced a trap composed of 132 places in 107 ms of which 0 ms to minimize.
[2023-03-15 07:50:47] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:50:47] [INFO ] Deduced a trap composed of 120 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:50:47] [INFO ] Deduced a trap composed of 123 places in 114 ms of which 0 ms to minimize.
[2023-03-15 07:50:47] [INFO ] Deduced a trap composed of 111 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:50:47] [INFO ] Deduced a trap composed of 129 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:50:47] [INFO ] Deduced a trap composed of 135 places in 108 ms of which 0 ms to minimize.
[2023-03-15 07:50:48] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:50:48] [INFO ] Deduced a trap composed of 126 places in 111 ms of which 1 ms to minimize.
[2023-03-15 07:50:48] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:50:48] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:50:48] [INFO ] Deduced a trap composed of 123 places in 105 ms of which 1 ms to minimize.
[2023-03-15 07:50:48] [INFO ] Deduced a trap composed of 117 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:50:48] [INFO ] Deduced a trap composed of 135 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:50:49] [INFO ] Deduced a trap composed of 117 places in 105 ms of which 0 ms to minimize.
[2023-03-15 07:50:49] [INFO ] Deduced a trap composed of 126 places in 116 ms of which 1 ms to minimize.
[2023-03-15 07:50:49] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:50:49] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 0 ms to minimize.
[2023-03-15 07:50:49] [INFO ] Deduced a trap composed of 120 places in 105 ms of which 0 ms to minimize.
[2023-03-15 07:50:50] [INFO ] Deduced a trap composed of 117 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:50:50] [INFO ] Deduced a trap composed of 117 places in 114 ms of which 1 ms to minimize.
[2023-03-15 07:50:50] [INFO ] Deduced a trap composed of 120 places in 111 ms of which 1 ms to minimize.
[2023-03-15 07:50:50] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:50:50] [INFO ] Deduced a trap composed of 117 places in 109 ms of which 0 ms to minimize.
[2023-03-15 07:50:51] [INFO ] Deduced a trap composed of 135 places in 107 ms of which 0 ms to minimize.
[2023-03-15 07:50:51] [INFO ] Deduced a trap composed of 120 places in 106 ms of which 1 ms to minimize.
[2023-03-15 07:50:51] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 1 ms to minimize.
[2023-03-15 07:50:51] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:50:51] [INFO ] Deduced a trap composed of 138 places in 112 ms of which 0 ms to minimize.
[2023-03-15 07:50:51] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:50:52] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 1 ms to minimize.
[2023-03-15 07:50:52] [INFO ] Deduced a trap composed of 129 places in 114 ms of which 1 ms to minimize.
[2023-03-15 07:50:52] [INFO ] Deduced a trap composed of 135 places in 119 ms of which 0 ms to minimize.
[2023-03-15 07:50:52] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 1 ms to minimize.
[2023-03-15 07:50:53] [INFO ] Deduced a trap composed of 132 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:50:53] [INFO ] Deduced a trap composed of 144 places in 120 ms of which 0 ms to minimize.
[2023-03-15 07:50:53] [INFO ] Deduced a trap composed of 123 places in 111 ms of which 1 ms to minimize.
[2023-03-15 07:50:53] [INFO ] Deduced a trap composed of 129 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:50:53] [INFO ] Deduced a trap composed of 114 places in 118 ms of which 1 ms to minimize.
[2023-03-15 07:50:53] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 1 ms to minimize.
[2023-03-15 07:50:54] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 1 ms to minimize.
[2023-03-15 07:50:54] [INFO ] Deduced a trap composed of 118 places in 121 ms of which 0 ms to minimize.
[2023-03-15 07:50:54] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:50:55] [INFO ] Deduced a trap composed of 127 places in 108 ms of which 1 ms to minimize.
[2023-03-15 07:50:55] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 0 ms to minimize.
[2023-03-15 07:50:56] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 0 ms to minimize.
[2023-03-15 07:50:56] [INFO ] Deduced a trap composed of 126 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:50:56] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 0 ms to minimize.
[2023-03-15 07:50:56] [INFO ] Deduced a trap composed of 129 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:50:56] [INFO ] Deduced a trap composed of 126 places in 110 ms of which 0 ms to minimize.
[2023-03-15 07:50:57] [INFO ] Deduced a trap composed of 144 places in 123 ms of which 0 ms to minimize.
[2023-03-15 07:50:57] [INFO ] Deduced a trap composed of 129 places in 114 ms of which 1 ms to minimize.
[2023-03-15 07:50:57] [INFO ] Deduced a trap composed of 126 places in 116 ms of which 0 ms to minimize.
[2023-03-15 07:50:57] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 1 ms to minimize.
[2023-03-15 07:50:58] [INFO ] Deduced a trap composed of 138 places in 111 ms of which 0 ms to minimize.
[2023-03-15 07:51:00] [INFO ] Deduced a trap composed of 135 places in 112 ms of which 1 ms to minimize.
[2023-03-15 07:51:01] [INFO ] Deduced a trap composed of 123 places in 106 ms of which 1 ms to minimize.
[2023-03-15 07:51:10] [INFO ] Trap strengthening (SAT) tested/added 96/96 trap constraints in 29896 ms
[2023-03-15 07:51:10] [INFO ] After 30150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:51:10] [INFO ] After 30233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:51:10] [INFO ] Flatten gal took : 46 ms
[2023-03-15 07:51:10] [INFO ] Flatten gal took : 46 ms
[2023-03-15 07:51:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14932372182701130291.gal : 7 ms
[2023-03-15 07:51:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1519713305080625191.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14932372182701130291.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1519713305080625191.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1519713305080625191.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 19
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :19 after 22
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :22 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 29
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :29 after 34
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :34 after 39
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :39 after 45
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :45 after 59
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :59 after 1318
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1318 after 1437
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1437 after 1972
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1972 after 2879
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2879 after 4151
Detected timeout of ITS tools.
[2023-03-15 07:51:25] [INFO ] Flatten gal took : 34 ms
[2023-03-15 07:51:25] [INFO ] Applying decomposition
[2023-03-15 07:51:25] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10812491438431123080.txt' '-o' '/tmp/graph10812491438431123080.bin' '-w' '/tmp/graph10812491438431123080.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10812491438431123080.bin' '-l' '-1' '-v' '-w' '/tmp/graph10812491438431123080.weights' '-q' '0' '-e' '0.001'
[2023-03-15 07:51:25] [INFO ] Decomposing Gal with order
[2023-03-15 07:51:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 07:51:26] [INFO ] Removed a total of 636 redundant transitions.
[2023-03-15 07:51:26] [INFO ] Flatten gal took : 144 ms
[2023-03-15 07:51:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 259 labels/synchronizations in 27 ms.
[2023-03-15 07:51:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3570813620259906539.gal : 86 ms
[2023-03-15 07:51:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality720009410629326315.prop : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3570813620259906539.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality720009410629326315.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality720009410629326315.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2442605315554871714
[2023-03-15 07:51:41] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2442605315554871714
Running compilation step : cd /tmp/ltsmin2442605315554871714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1128 ms.
Running link step : cd /tmp/ltsmin2442605315554871714;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2442605315554871714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :915485 after 3.1887e+06
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 07:51:56] [INFO ] Flatten gal took : 39 ms
[2023-03-15 07:51:56] [INFO ] Applying decomposition
[2023-03-15 07:51:56] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16460661278380004867.txt' '-o' '/tmp/graph16460661278380004867.bin' '-w' '/tmp/graph16460661278380004867.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16460661278380004867.bin' '-l' '-1' '-v' '-w' '/tmp/graph16460661278380004867.weights' '-q' '0' '-e' '0.001'
[2023-03-15 07:51:56] [INFO ] Decomposing Gal with order
[2023-03-15 07:51:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 07:51:56] [INFO ] Removed a total of 1317 redundant transitions.
[2023-03-15 07:51:56] [INFO ] Flatten gal took : 118 ms
[2023-03-15 07:51:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 245 labels/synchronizations in 24 ms.
[2023-03-15 07:51:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4979528374458612017.gal : 8 ms
[2023-03-15 07:51:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15139575270214080725.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4979528374458612017.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15139575270214080725.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality15139575270214080725.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 96
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :96 after 192
Detected timeout of ITS tools.
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9.16534e+08 after 9.16534e+08
Detected timeout of ITS tools.
[2023-03-15 08:01:57] [INFO ] Flatten gal took : 23 ms
[2023-03-15 08:01:57] [INFO ] Flatten gal took : 21 ms
[2023-03-15 08:01:57] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16462156154148000891.gal : 5 ms
[2023-03-15 08:01:57] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5878862751421337867.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability16462156154148000891.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5878862751421337867.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability5878862751421337867.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 171
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :171 after 231
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :231 after 303
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :303 after 547
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :547 after 1157
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1157 after 1872
Detected timeout of ITS tools.
[2023-03-15 08:02:00] [INFO ] Flatten gal took : 24 ms
[2023-03-15 08:02:00] [INFO ] Applying decomposition
[2023-03-15 08:02:00] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3992771201929073418.txt' '-o' '/tmp/graph3992771201929073418.bin' '-w' '/tmp/graph3992771201929073418.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3992771201929073418.bin' '-l' '-1' '-v' '-w' '/tmp/graph3992771201929073418.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:02:00] [INFO ] Decomposing Gal with order
[2023-03-15 08:02:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:02:00] [INFO ] Removed a total of 697 redundant transitions.
[2023-03-15 08:02:00] [INFO ] Flatten gal took : 52 ms
[2023-03-15 08:02:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 153 labels/synchronizations in 8 ms.
[2023-03-15 08:02:00] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16839091888361122716.gal : 6 ms
[2023-03-15 08:02:00] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8380041444783576533.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability16839091888361122716.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8380041444783576533.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability8380041444783576533.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1.09844e+07
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1.09844e+07 after 1.09864e+07
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1.09864e+07 after 1.09866e+07
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.09866e+07 after 1.09867e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.09867e+07 after 1.09872e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.09872e+07 after 1.0988e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.0988e+07 after 1.09894e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17729629566313263422
[2023-03-15 08:02:03] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17729629566313263422
Running compilation step : cd /tmp/ltsmin17729629566313263422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 957 ms.
Running link step : cd /tmp/ltsmin17729629566313263422;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin17729629566313263422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 08:02:06] [INFO ] Flatten gal took : 32 ms
[2023-03-15 08:02:06] [INFO ] Flatten gal took : 21 ms
[2023-03-15 08:02:06] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15564958357247094027.gal : 4 ms
[2023-03-15 08:02:06] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14998737618694446330.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability15564958357247094027.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14998737618694446330.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityFireability14998737618694446330.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 171
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :171 after 231
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :231 after 303
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :303 after 547
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :547 after 1157
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1157 after 1872
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1872 after 4049
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4049 after 27722
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :27722 after 95398
Detected timeout of ITS tools.
[2023-03-15 08:02:36] [INFO ] Flatten gal took : 19 ms
[2023-03-15 08:02:36] [INFO ] Applying decomposition
[2023-03-15 08:02:36] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6453728884562823318.txt' '-o' '/tmp/graph6453728884562823318.bin' '-w' '/tmp/graph6453728884562823318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6453728884562823318.bin' '-l' '-1' '-v' '-w' '/tmp/graph6453728884562823318.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:02:36] [INFO ] Decomposing Gal with order
[2023-03-15 08:02:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:02:36] [INFO ] Removed a total of 697 redundant transitions.
[2023-03-15 08:02:36] [INFO ] Flatten gal took : 46 ms
[2023-03-15 08:02:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 153 labels/synchronizations in 7 ms.
[2023-03-15 08:02:36] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13275848462799278377.gal : 5 ms
[2023-03-15 08:02:36] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8021201786971886266.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability13275848462799278377.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8021201786971886266.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability8021201786971886266.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 92
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :92 after 93
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :93 after 94
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :94 after 95
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :95 after 98
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :98 after 105
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :105 after 38027
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :38027 after 38099
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :38099 after 38247
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13488738885479627826
[2023-03-15 08:03:06] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13488738885479627826
Running compilation step : cd /tmp/ltsmin13488738885479627826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 932 ms.
Running link step : cd /tmp/ltsmin13488738885479627826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13488738885479627826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 08:03:36] [INFO ] Flatten gal took : 20 ms
[2023-03-15 08:03:36] [INFO ] Flatten gal took : 19 ms
[2023-03-15 08:03:36] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3244909196149400039.gal : 4 ms
[2023-03-15 08:03:37] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3310726465277226043.prop : 33 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability3244909196149400039.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3310726465277226043.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityFireability3310726465277226043.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 171
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :171 after 231
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :231 after 303
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :303 after 547
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :547 after 1157
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1157 after 1872
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1872 after 4049
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4049 after 27722
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :27722 after 95398
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :95398 after 329502
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :329502 after 2.66494e+06
Detected timeout of ITS tools.
[2023-03-15 08:08:37] [INFO ] Flatten gal took : 20 ms
[2023-03-15 08:08:37] [INFO ] Applying decomposition
[2023-03-15 08:08:37] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3450571341807823135.txt' '-o' '/tmp/graph3450571341807823135.bin' '-w' '/tmp/graph3450571341807823135.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3450571341807823135.bin' '-l' '-1' '-v' '-w' '/tmp/graph3450571341807823135.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:08:37] [INFO ] Decomposing Gal with order
[2023-03-15 08:08:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:08:37] [INFO ] Removed a total of 544 redundant transitions.
[2023-03-15 08:08:37] [INFO ] Flatten gal took : 57 ms
[2023-03-15 08:08:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 243 labels/synchronizations in 9 ms.
[2023-03-15 08:08:37] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6642502222846769296.gal : 6 ms
[2023-03-15 08:08:37] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6293489013504844569.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability6642502222846769296.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6293489013504844569.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability6293489013504844569.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :65 after 69
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :69 after 71
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :71 after 80
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :80 after 124
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :124 after 235
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :235 after 3.0143e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5275713753672774221
[2023-03-15 08:13:37] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5275713753672774221
Running compilation step : cd /tmp/ltsmin5275713753672774221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '60' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 964 ms.
Running link step : cd /tmp/ltsmin5275713753672774221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5275713753672774221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 14021336 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16086836 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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-S05J30"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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