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-167873961400432.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-S10J40, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tall-167873961400432
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678868152050

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-S10J40
Not applying reductions.
Model is COL
QuasiLiveness COL
Running Version 202303021504
[2023-03-15 08:15:53] [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 08:15:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 08:15:53] [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 08:15:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 08:15:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 678 ms
[2023-03-15 08:15:54] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 894 PT places and 12462.0 transition bindings in 17 ms.
[2023-03-15 08:15:54] [INFO ] Unfolded HLPN to a Petri net with 894 places and 12380 transitions 114079 arcs in 186 ms.
[2023-03-15 08:15:54] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 08:15:54] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-15 08:15:54] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 08:15:54] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 40 places in 39 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
[2023-03-15 08:15:55] [INFO ] Flatten gal took : 429 ms
[2023-03-15 08:15:55] [INFO ] Flatten gal took : 459 ms
[2023-03-15 08:15:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13299677971876363799.gal : 111 ms
[2023-03-15 08:15:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3028125742160713514.prop : 39 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/ReachabilityCardinality13299677971876363799.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3028125742160713514.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
Incomplete random walk after 10000 steps, including 560 resets, run finished after 1535 ms. (steps per millisecond=6 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Loading property file /tmp/ReachabilityCardinality3028125742160713514.prop.
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=8 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :16
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-15 08:15:56] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2023-03-15 08:15:56] [INFO ] Computed 112 place invariants in 123 ms
[2023-03-15 08:15:58] [INFO ] [Real]Absence check using 105 positive place invariants in 35 ms returned sat
[2023-03-15 08:15:58] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 23 ms returned sat
Reachability property qltransition_31 is true.
SDD proceeding with computation,35 properties remain. new max is 2
SDD size :1 after 2
Reachability property qltransition_35 is true.
Reachability property qltransition_32 is true.
Reachability property qltransition_16 is true.
SDD proceeding with computation,32 properties remain. new max is 2
SDD size :2 after 5
SDD proceeding with computation,32 properties remain. new max is 4
SDD size :5 after 6
Reachability property qltransition_27 is true.
Reachability property qltransition_20 is true.
Reachability property qltransition_15 is true.
SDD proceeding with computation,29 properties remain. new max is 4
SDD size :6 after 14
Reachability property qltransition_21 is true.
SDD proceeding with computation,28 properties remain. new max is 4
SDD size :14 after 15
Reachability property qltransition_6 is true.
SDD proceeding with computation,27 properties remain. new max is 4
SDD size :15 after 16
Reachability property qltransition_25 is true.
Reachability property qltransition_14 is true.
Reachability property qltransition_7 is true.
Reachability property qltransition_5 is true.
SDD proceeding with computation,23 properties remain. new max is 4
SDD size :16 after 20
Reachability property qltransition_9 is true.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :20 after 21
Reachability property qltransition_36 is true.
Reachability property qltransition_10 is true.
Reachability property qltransition_8 is true.
SDD proceeding with computation,19 properties remain. new max is 4
SDD size :21 after 24
SDD proceeding with computation,19 properties remain. new max is 8
SDD size :24 after 25
Reachability property qltransition_30 is true.
SDD proceeding with computation,18 properties remain. new max is 8
SDD size :25 after 26
Reachability property qltransition_34 is true.
Reachability property qltransition_28 is true.
Reachability property qltransition_3 is true.
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :26 after 29
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :29 after 35
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :35 after 38
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :38 after 40
[2023-03-15 08:16:00] [INFO ] After 1370ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:9
[2023-03-15 08:16:00] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :40 after 43
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :43 after 57
[2023-03-15 08:16:00] [INFO ] After 212ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:9
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :57 after 81
[2023-03-15 08:16:00] [INFO ] After 490ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:9
Attempting to minimize the solution found.
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :81 after 110
Minimization took 170 ms.
[2023-03-15 08:16:00] [INFO ] After 2706ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:9
[2023-03-15 08:16:01] [INFO ] [Nat]Absence check using 105 positive place invariants in 34 ms returned sat
[2023-03-15 08:16:01] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 21 ms returned sat
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :110 after 168
Reachability property qltransition_33 is true.
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :168 after 282
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :282 after 378
[2023-03-15 08:16:05] [INFO ] After 4117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
Reachability property qltransition_24 is true.
Reachability property qltransition_19 is true.
Reachability property qltransition_13 is true.
Reachability property qltransition_4 is true.
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :378 after 1353
[2023-03-15 08:16:07] [INFO ] After 2518ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :11
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :1353 after 2543
[2023-03-15 08:16:10] [INFO ] After 4825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :2543 after 4832
Minimization took 1881 ms.
[2023-03-15 08:16:12] [INFO ] After 11326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 2034 ms.
Support contains 145 out of 854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 844 transition count 2185
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 100 place count 799 transition count 2185
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 100 place count 799 transition count 2142
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 186 place count 756 transition count 2142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 755 transition count 2141
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 755 transition count 2141
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 192 place count 753 transition count 2139
Applied a total of 192 rules in 315 ms. Remains 753 /854 variables (removed 101) and now considering 2139/2230 (removed 91) transitions.
[2023-03-15 08:16:14] [INFO ] Flow matrix only has 2130 transitions (discarded 9 similar events)
// Phase 1: matrix 2130 rows 753 cols
[2023-03-15 08:16:14] [INFO ] Computed 102 place invariants in 65 ms
[2023-03-15 08:16:15] [INFO ] Dead Transitions using invariants and state equation in 970 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 753/854 places, 1524/2230 transitions.
Applied a total of 0 rules in 40 ms. Remains 753 /753 variables (removed 0) and now considering 1524/1524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1327 ms. Remains : 753/854 places, 1524/2230 transitions.
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :4832 after 9794
Incomplete random walk after 1000000 steps, including 65352 resets, run finished after 7038 ms. (steps per millisecond=142 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 1000001 steps, including 8278 resets, run finished after 1544 ms. (steps per millisecond=647 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:16:24] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
// Phase 1: matrix 1515 rows 753 cols
[2023-03-15 08:16:24] [INFO ] Computed 102 place invariants in 23 ms
[2023-03-15 08:16:24] [INFO ] [Real]Absence check using 95 positive place invariants in 24 ms returned sat
[2023-03-15 08:16:24] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 08:16:24] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:16:24] [INFO ] [Nat]Absence check using 95 positive place invariants in 19 ms returned sat
[2023-03-15 08:16:24] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 08:16:24] [INFO ] After 496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:16:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:16:24] [INFO ] After 103ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:16:25] [INFO ] Deduced a trap composed of 304 places in 344 ms of which 1 ms to minimize.
[2023-03-15 08:16:25] [INFO ] Deduced a trap composed of 302 places in 321 ms of which 1 ms to minimize.
[2023-03-15 08:16:26] [INFO ] Deduced a trap composed of 308 places in 351 ms of which 2 ms to minimize.
[2023-03-15 08:16:26] [INFO ] Deduced a trap composed of 308 places in 707 ms of which 1 ms to minimize.
[2023-03-15 08:16:27] [INFO ] Deduced a trap composed of 296 places in 371 ms of which 1 ms to minimize.
[2023-03-15 08:16:27] [INFO ] Deduced a trap composed of 292 places in 353 ms of which 1 ms to minimize.
[2023-03-15 08:16:28] [INFO ] Deduced a trap composed of 298 places in 353 ms of which 1 ms to minimize.
[2023-03-15 08:16:28] [INFO ] Deduced a trap composed of 292 places in 365 ms of which 1 ms to minimize.
[2023-03-15 08:16:29] [INFO ] Deduced a trap composed of 288 places in 351 ms of which 1 ms to minimize.
[2023-03-15 08:16:29] [INFO ] Deduced a trap composed of 298 places in 350 ms of which 0 ms to minimize.
[2023-03-15 08:16:30] [INFO ] Deduced a trap composed of 304 places in 350 ms of which 1 ms to minimize.
[2023-03-15 08:16:30] [INFO ] Deduced a trap composed of 306 places in 352 ms of which 0 ms to minimize.
[2023-03-15 08:16:30] [INFO ] Deduced a trap composed of 314 places in 349 ms of which 1 ms to minimize.
[2023-03-15 08:16:31] [INFO ] Deduced a trap composed of 310 places in 357 ms of which 1 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 65536
SDD size :9794 after 19746
[2023-03-15 08:16:31] [INFO ] Deduced a trap composed of 308 places in 354 ms of which 1 ms to minimize.
[2023-03-15 08:16:32] [INFO ] Deduced a trap composed of 302 places in 349 ms of which 1 ms to minimize.
[2023-03-15 08:16:32] [INFO ] Deduced a trap composed of 294 places in 355 ms of which 1 ms to minimize.
[2023-03-15 08:16:32] [INFO ] Deduced a trap composed of 304 places in 346 ms of which 1 ms to minimize.
[2023-03-15 08:16:33] [INFO ] Deduced a trap composed of 305 places in 347 ms of which 1 ms to minimize.
[2023-03-15 08:16:33] [INFO ] Deduced a trap composed of 302 places in 357 ms of which 1 ms to minimize.
[2023-03-15 08:16:34] [INFO ] Deduced a trap composed of 292 places in 346 ms of which 1 ms to minimize.
[2023-03-15 08:16:34] [INFO ] Deduced a trap composed of 310 places in 346 ms of which 1 ms to minimize.
[2023-03-15 08:16:35] [INFO ] Deduced a trap composed of 286 places in 351 ms of which 1 ms to minimize.
[2023-03-15 08:16:35] [INFO ] Deduced a trap composed of 296 places in 356 ms of which 0 ms to minimize.
[2023-03-15 08:16:44] [INFO ] Deduced a trap composed of 304 places in 334 ms of which 0 ms to minimize.
[2023-03-15 08:16:44] [INFO ] Deduced a trap composed of 310 places in 335 ms of which 0 ms to minimize.
[2023-03-15 08:16:44] [INFO ] Deduced a trap composed of 298 places in 342 ms of which 1 ms to minimize.
[2023-03-15 08:16:45] [INFO ] Deduced a trap composed of 290 places in 334 ms of which 0 ms to minimize.
[2023-03-15 08:16:45] [INFO ] Deduced a trap composed of 302 places in 317 ms of which 0 ms to minimize.
[2023-03-15 08:16:46] [INFO ] Deduced a trap composed of 290 places in 322 ms of which 0 ms to minimize.
[2023-03-15 08:16:46] [INFO ] Deduced a trap composed of 286 places in 326 ms of which 1 ms to minimize.
[2023-03-15 08:16:46] [INFO ] Deduced a trap composed of 300 places in 352 ms of which 2 ms to minimize.
[2023-03-15 08:16:47] [INFO ] Deduced a trap composed of 312 places in 346 ms of which 5 ms to minimize.
[2023-03-15 08:16:47] [INFO ] Deduced a trap composed of 294 places in 340 ms of which 1 ms to minimize.
[2023-03-15 08:16:52] [INFO ] Deduced a trap composed of 306 places in 321 ms of which 1 ms to minimize.
[2023-03-15 08:16:52] [INFO ] Deduced a trap composed of 300 places in 316 ms of which 1 ms to minimize.
[2023-03-15 08:16:52] [INFO ] Deduced a trap composed of 304 places in 320 ms of which 1 ms to minimize.
[2023-03-15 08:16:53] [INFO ] Deduced a trap composed of 302 places in 343 ms of which 2 ms to minimize.
[2023-03-15 08:16:53] [INFO ] Deduced a trap composed of 304 places in 312 ms of which 1 ms to minimize.
[2023-03-15 08:16:54] [INFO ] Deduced a trap composed of 304 places in 308 ms of which 2 ms to minimize.
[2023-03-15 08:16:54] [INFO ] Deduced a trap composed of 304 places in 327 ms of which 1 ms to minimize.
[2023-03-15 08:16:55] [INFO ] Deduced a trap composed of 300 places in 322 ms of which 1 ms to minimize.
[2023-03-15 08:16:55] [INFO ] Deduced a trap composed of 304 places in 321 ms of which 0 ms to minimize.
[2023-03-15 08:16:55] [INFO ] Deduced a trap composed of 300 places in 306 ms of which 2 ms to minimize.
[2023-03-15 08:16:56] [INFO ] Deduced a trap composed of 300 places in 349 ms of which 1 ms to minimize.
[2023-03-15 08:16:56] [INFO ] Deduced a trap composed of 296 places in 321 ms of which 0 ms to minimize.
[2023-03-15 08:16:56] [INFO ] Deduced a trap composed of 304 places in 312 ms of which 1 ms to minimize.
[2023-03-15 08:16:57] [INFO ] Deduced a trap composed of 298 places in 321 ms of which 0 ms to minimize.
[2023-03-15 08:16:58] [INFO ] Deduced a trap composed of 300 places in 314 ms of which 2 ms to minimize.
[2023-03-15 08:16:58] [INFO ] Deduced a trap composed of 312 places in 305 ms of which 0 ms to minimize.
[2023-03-15 08:16:58] [INFO ] Deduced a trap composed of 304 places in 317 ms of which 0 ms to minimize.
[2023-03-15 08:16:59] [INFO ] Deduced a trap composed of 308 places in 321 ms of which 1 ms to minimize.
[2023-03-15 08:16:59] [INFO ] Deduced a trap composed of 308 places in 338 ms of which 1 ms to minimize.
[2023-03-15 08:17:00] [INFO ] Deduced a trap composed of 308 places in 314 ms of which 9 ms to minimize.
[2023-03-15 08:17:00] [INFO ] Deduced a trap composed of 306 places in 368 ms of which 1 ms to minimize.
[2023-03-15 08:17:00] [INFO ] Deduced a trap composed of 296 places in 319 ms of which 1 ms to minimize.
[2023-03-15 08:17:01] [INFO ] Deduced a trap composed of 302 places in 328 ms of which 1 ms to minimize.
[2023-03-15 08:17:02] [INFO ] Deduced a trap composed of 310 places in 322 ms of which 0 ms to minimize.
[2023-03-15 08:17:02] [INFO ] Deduced a trap composed of 298 places in 329 ms of which 1 ms to minimize.
[2023-03-15 08:17:03] [INFO ] Deduced a trap composed of 296 places in 319 ms of which 1 ms to minimize.
[2023-03-15 08:17:03] [INFO ] Deduced a trap composed of 304 places in 331 ms of which 0 ms to minimize.
[2023-03-15 08:17:03] [INFO ] Deduced a trap composed of 290 places in 322 ms of which 5 ms to minimize.
[2023-03-15 08:17:04] [INFO ] Deduced a trap composed of 294 places in 327 ms of which 1 ms to minimize.
[2023-03-15 08:17:05] [INFO ] Deduced a trap composed of 296 places in 343 ms of which 1 ms to minimize.
[2023-03-15 08:17:06] [INFO ] Deduced a trap composed of 302 places in 326 ms of which 2 ms to minimize.
[2023-03-15 08:17:06] [INFO ] Deduced a trap composed of 300 places in 343 ms of which 5 ms to minimize.
[2023-03-15 08:17:07] [INFO ] Deduced a trap composed of 294 places in 329 ms of which 2 ms to minimize.
[2023-03-15 08:17:07] [INFO ] Deduced a trap composed of 296 places in 328 ms of which 0 ms to minimize.
[2023-03-15 08:17:08] [INFO ] Deduced a trap composed of 310 places in 323 ms of which 1 ms to minimize.
[2023-03-15 08:17:08] [INFO ] Deduced a trap composed of 294 places in 331 ms of which 1 ms to minimize.
[2023-03-15 08:17:09] [INFO ] Deduced a trap composed of 310 places in 316 ms of which 0 ms to minimize.
[2023-03-15 08:17:09] [INFO ] Deduced a trap composed of 296 places in 323 ms of which 1 ms to minimize.
[2023-03-15 08:17:10] [INFO ] Deduced a trap composed of 304 places in 318 ms of which 0 ms to minimize.
[2023-03-15 08:17:10] [INFO ] Deduced a trap composed of 298 places in 324 ms of which 1 ms to minimize.
[2023-03-15 08:17:11] [INFO ] Deduced a trap composed of 308 places in 326 ms of which 0 ms to minimize.
[2023-03-15 08:17:11] [INFO ] Deduced a trap composed of 304 places in 324 ms of which 0 ms to minimize.
[2023-03-15 08:17:12] [INFO ] Deduced a trap composed of 308 places in 365 ms of which 0 ms to minimize.
[2023-03-15 08:17:21] [INFO ] Trap strengthening (SAT) tested/added 77/77 trap constraints in 56762 ms
[2023-03-15 08:17:21] [INFO ] After 56959ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:17:21] [INFO ] After 57588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 1524/1524 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 753 transition count 1523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 752 transition count 1523
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 752 transition count 1521
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 750 transition count 1521
Applied a total of 6 rules in 72 ms. Remains 750 /753 variables (removed 3) and now considering 1521/1524 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 750/753 places, 1521/1524 transitions.
Incomplete random walk after 1000000 steps, including 72634 resets, run finished after 9695 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8416 resets, run finished after 1749 ms. (steps per millisecond=571 ) properties (out of 1) seen :0
Reachability property qltransition_23 is true.
Reachability property qltransition_18 is true.
Reachability property qltransition_0 is true.
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :19746 after 55322
Interrupted probabilistic random walk after 4190272 steps, run timeout after 33001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 4190272 steps, saw 712917 distinct states, run finished after 33002 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:18:06] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2023-03-15 08:18:06] [INFO ] Computed 102 place invariants in 46 ms
[2023-03-15 08:18:06] [INFO ] [Real]Absence check using 95 positive place invariants in 107 ms returned sat
[2023-03-15 08:18:06] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 08:18:06] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:18:06] [INFO ] [Nat]Absence check using 95 positive place invariants in 21 ms returned sat
[2023-03-15 08:18:06] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-15 08:18:07] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:18:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:18:07] [INFO ] After 197ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:18:07] [INFO ] Deduced a trap composed of 302 places in 319 ms of which 0 ms to minimize.
[2023-03-15 08:18:08] [INFO ] Deduced a trap composed of 300 places in 354 ms of which 1 ms to minimize.
[2023-03-15 08:18:08] [INFO ] Deduced a trap composed of 300 places in 318 ms of which 0 ms to minimize.
[2023-03-15 08:18:08] [INFO ] Deduced a trap composed of 306 places in 322 ms of which 1 ms to minimize.
[2023-03-15 08:18:09] [INFO ] Deduced a trap composed of 302 places in 334 ms of which 1 ms to minimize.
[2023-03-15 08:18:09] [INFO ] Deduced a trap composed of 310 places in 315 ms of which 1 ms to minimize.
[2023-03-15 08:18:10] [INFO ] Deduced a trap composed of 314 places in 318 ms of which 1 ms to minimize.
[2023-03-15 08:18:10] [INFO ] Deduced a trap composed of 300 places in 326 ms of which 0 ms to minimize.
[2023-03-15 08:18:10] [INFO ] Deduced a trap composed of 300 places in 318 ms of which 0 ms to minimize.
[2023-03-15 08:18:11] [INFO ] Deduced a trap composed of 304 places in 314 ms of which 0 ms to minimize.
[2023-03-15 08:18:11] [INFO ] Deduced a trap composed of 304 places in 316 ms of which 1 ms to minimize.
[2023-03-15 08:18:12] [INFO ] Deduced a trap composed of 300 places in 308 ms of which 1 ms to minimize.
[2023-03-15 08:18:12] [INFO ] Deduced a trap composed of 298 places in 314 ms of which 1 ms to minimize.
[2023-03-15 08:18:13] [INFO ] Deduced a trap composed of 304 places in 321 ms of which 1 ms to minimize.
[2023-03-15 08:18:14] [INFO ] Deduced a trap composed of 298 places in 345 ms of which 1 ms to minimize.
[2023-03-15 08:18:14] [INFO ] Deduced a trap composed of 308 places in 460 ms of which 1 ms to minimize.
[2023-03-15 08:18:15] [INFO ] Deduced a trap composed of 308 places in 354 ms of which 1 ms to minimize.
[2023-03-15 08:18:15] [INFO ] Deduced a trap composed of 306 places in 316 ms of which 1 ms to minimize.
[2023-03-15 08:18:16] [INFO ] Deduced a trap composed of 304 places in 341 ms of which 0 ms to minimize.
[2023-03-15 08:18:16] [INFO ] Deduced a trap composed of 310 places in 330 ms of which 1 ms to minimize.
[2023-03-15 08:18:16] [INFO ] Deduced a trap composed of 296 places in 311 ms of which 0 ms to minimize.
[2023-03-15 08:18:17] [INFO ] Deduced a trap composed of 302 places in 319 ms of which 0 ms to minimize.
[2023-03-15 08:18:17] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 1 ms to minimize.
[2023-03-15 08:18:18] [INFO ] Deduced a trap composed of 308 places in 316 ms of which 1 ms to minimize.
[2023-03-15 08:18:18] [INFO ] Deduced a trap composed of 296 places in 325 ms of which 0 ms to minimize.
[2023-03-15 08:18:19] [INFO ] Deduced a trap composed of 296 places in 335 ms of which 0 ms to minimize.
[2023-03-15 08:18:19] [INFO ] Deduced a trap composed of 290 places in 316 ms of which 0 ms to minimize.
[2023-03-15 08:18:20] [INFO ] Deduced a trap composed of 288 places in 323 ms of which 1 ms to minimize.
[2023-03-15 08:18:21] [INFO ] Deduced a trap composed of 304 places in 335 ms of which 1 ms to minimize.
[2023-03-15 08:18:21] [INFO ] Deduced a trap composed of 300 places in 338 ms of which 0 ms to minimize.
[2023-03-15 08:18:22] [INFO ] Deduced a trap composed of 299 places in 328 ms of which 1 ms to minimize.
[2023-03-15 08:18:22] [INFO ] Deduced a trap composed of 304 places in 320 ms of which 1 ms to minimize.
[2023-03-15 08:18:22] [INFO ] Deduced a trap composed of 309 places in 318 ms of which 1 ms to minimize.
[2023-03-15 08:18:23] [INFO ] Deduced a trap composed of 296 places in 329 ms of which 1 ms to minimize.
[2023-03-15 08:18:23] [INFO ] Deduced a trap composed of 301 places in 332 ms of which 1 ms to minimize.
[2023-03-15 08:18:24] [INFO ] Deduced a trap composed of 296 places in 325 ms of which 1 ms to minimize.
[2023-03-15 08:18:24] [INFO ] Deduced a trap composed of 290 places in 332 ms of which 1 ms to minimize.
[2023-03-15 08:18:24] [INFO ] Deduced a trap composed of 294 places in 342 ms of which 0 ms to minimize.
[2023-03-15 08:18:25] [INFO ] Deduced a trap composed of 313 places in 328 ms of which 0 ms to minimize.
[2023-03-15 08:18:26] [INFO ] Deduced a trap composed of 298 places in 325 ms of which 1 ms to minimize.
[2023-03-15 08:18:26] [INFO ] Deduced a trap composed of 292 places in 333 ms of which 0 ms to minimize.
[2023-03-15 08:18:26] [INFO ] Deduced a trap composed of 302 places in 334 ms of which 1 ms to minimize.
[2023-03-15 08:18:27] [INFO ] Deduced a trap composed of 296 places in 329 ms of which 1 ms to minimize.
[2023-03-15 08:18:27] [INFO ] Deduced a trap composed of 299 places in 342 ms of which 1 ms to minimize.
[2023-03-15 08:18:29] [INFO ] Deduced a trap composed of 294 places in 354 ms of which 1 ms to minimize.
[2023-03-15 08:18:29] [INFO ] Deduced a trap composed of 306 places in 372 ms of which 1 ms to minimize.
[2023-03-15 08:18:31] [INFO ] Deduced a trap composed of 294 places in 330 ms of which 1 ms to minimize.
[2023-03-15 08:18:32] [INFO ] Deduced a trap composed of 290 places in 328 ms of which 1 ms to minimize.
[2023-03-15 08:18:32] [INFO ] Deduced a trap composed of 292 places in 313 ms of which 0 ms to minimize.
[2023-03-15 08:18:32] [INFO ] Deduced a trap composed of 304 places in 329 ms of which 1 ms to minimize.
[2023-03-15 08:18:33] [INFO ] Deduced a trap composed of 294 places in 329 ms of which 1 ms to minimize.
[2023-03-15 08:18:33] [INFO ] Deduced a trap composed of 310 places in 312 ms of which 1 ms to minimize.
[2023-03-15 08:18:34] [INFO ] Deduced a trap composed of 296 places in 323 ms of which 1 ms to minimize.
[2023-03-15 08:18:34] [INFO ] Deduced a trap composed of 298 places in 378 ms of which 1 ms to minimize.
[2023-03-15 08:18:34] [INFO ] Deduced a trap composed of 302 places in 316 ms of which 0 ms to minimize.
[2023-03-15 08:18:35] [INFO ] Deduced a trap composed of 300 places in 321 ms of which 0 ms to minimize.
[2023-03-15 08:18:35] [INFO ] Deduced a trap composed of 300 places in 319 ms of which 0 ms to minimize.
Reachability property qltransition_12 is true.
[2023-03-15 08:18:39] [INFO ] Deduced a trap composed of 304 places in 335 ms of which 0 ms to minimize.
[2023-03-15 08:18:40] [INFO ] Deduced a trap composed of 296 places in 342 ms of which 1 ms to minimize.
[2023-03-15 08:18:40] [INFO ] Deduced a trap composed of 294 places in 344 ms of which 0 ms to minimize.
[2023-03-15 08:18:40] [INFO ] Deduced a trap composed of 298 places in 328 ms of which 1 ms to minimize.
[2023-03-15 08:18:41] [INFO ] Deduced a trap composed of 307 places in 375 ms of which 0 ms to minimize.
[2023-03-15 08:18:41] [INFO ] Deduced a trap composed of 310 places in 338 ms of which 1 ms to minimize.
[2023-03-15 08:18:42] [INFO ] Deduced a trap composed of 288 places in 319 ms of which 2 ms to minimize.
[2023-03-15 08:18:42] [INFO ] Deduced a trap composed of 292 places in 320 ms of which 0 ms to minimize.
[2023-03-15 08:18:43] [INFO ] Deduced a trap composed of 288 places in 348 ms of which 0 ms to minimize.
[2023-03-15 08:18:43] [INFO ] Deduced a trap composed of 300 places in 351 ms of which 1 ms to minimize.
[2023-03-15 08:18:44] [INFO ] Deduced a trap composed of 304 places in 325 ms of which 0 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 65536
[2023-03-15 08:18:44] [INFO ] Deduced a trap composed of 304 places in 325 ms of which 1 ms to minimize.
SDD size :55322 after 215368
[2023-03-15 08:18:45] [INFO ] Deduced a trap composed of 290 places in 346 ms of which 0 ms to minimize.
[2023-03-15 08:18:46] [INFO ] Deduced a trap composed of 301 places in 364 ms of which 1 ms to minimize.
[2023-03-15 08:18:46] [INFO ] Deduced a trap composed of 308 places in 330 ms of which 0 ms to minimize.
[2023-03-15 08:18:47] [INFO ] Deduced a trap composed of 302 places in 350 ms of which 0 ms to minimize.
[2023-03-15 08:18:47] [INFO ] Deduced a trap composed of 306 places in 329 ms of which 0 ms to minimize.
[2023-03-15 08:18:48] [INFO ] Deduced a trap composed of 302 places in 323 ms of which 0 ms to minimize.
[2023-03-15 08:18:48] [INFO ] Deduced a trap composed of 306 places in 308 ms of which 0 ms to minimize.
[2023-03-15 08:18:49] [INFO ] Deduced a trap composed of 292 places in 327 ms of which 1 ms to minimize.
[2023-03-15 08:18:50] [INFO ] Deduced a trap composed of 296 places in 331 ms of which 1 ms to minimize.
[2023-03-15 08:18:50] [INFO ] Deduced a trap composed of 309 places in 333 ms of which 0 ms to minimize.
[2023-03-15 08:18:51] [INFO ] Deduced a trap composed of 296 places in 337 ms of which 1 ms to minimize.
[2023-03-15 08:18:52] [INFO ] Deduced a trap composed of 294 places in 302 ms of which 1 ms to minimize.
[2023-03-15 08:18:52] [INFO ] Deduced a trap composed of 309 places in 321 ms of which 0 ms to minimize.
[2023-03-15 08:18:54] [INFO ] Deduced a trap composed of 307 places in 312 ms of which 0 ms to minimize.
[2023-03-15 08:18:55] [INFO ] Deduced a trap composed of 311 places in 321 ms of which 0 ms to minimize.
[2023-03-15 08:18:55] [INFO ] Deduced a trap composed of 296 places in 322 ms of which 1 ms to minimize.
[2023-03-15 08:18:56] [INFO ] Deduced a trap composed of 292 places in 325 ms of which 0 ms to minimize.
[2023-03-15 08:18:56] [INFO ] Deduced a trap composed of 290 places in 336 ms of which 1 ms to minimize.
[2023-03-15 08:18:57] [INFO ] Deduced a trap composed of 298 places in 342 ms of which 1 ms to minimize.
[2023-03-15 08:18:57] [INFO ] Deduced a trap composed of 294 places in 330 ms of which 1 ms to minimize.
[2023-03-15 08:18:57] [INFO ] Deduced a trap composed of 296 places in 328 ms of which 1 ms to minimize.
[2023-03-15 08:18:58] [INFO ] Deduced a trap composed of 300 places in 325 ms of which 1 ms to minimize.
[2023-03-15 08:19:01] [INFO ] Deduced a trap composed of 296 places in 322 ms of which 1 ms to minimize.
[2023-03-15 08:19:02] [INFO ] Deduced a trap composed of 294 places in 326 ms of which 0 ms to minimize.
[2023-03-15 08:19:03] [INFO ] Deduced a trap composed of 292 places in 343 ms of which 1 ms to minimize.
[2023-03-15 08:19:03] [INFO ] Deduced a trap composed of 292 places in 318 ms of which 0 ms to minimize.
[2023-03-15 08:19:04] [INFO ] Deduced a trap composed of 298 places in 337 ms of which 1 ms to minimize.
[2023-03-15 08:19:05] [INFO ] Deduced a trap composed of 294 places in 329 ms of which 1 ms to minimize.
[2023-03-15 08:19:07] [INFO ] Deduced a trap composed of 298 places in 323 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :215368 after 414068
[2023-03-15 08:19:15] [INFO ] Deduced a trap composed of 288 places in 344 ms of which 0 ms to minimize.
[2023-03-15 08:19:16] [INFO ] Deduced a trap composed of 292 places in 341 ms of which 1 ms to minimize.
[2023-03-15 08:19:20] [INFO ] Deduced a trap composed of 300 places in 344 ms of which 0 ms to minimize.
[2023-03-15 08:19:24] [INFO ] Deduced a trap composed of 296 places in 346 ms of which 0 ms to minimize.
[2023-03-15 08:19:33] [INFO ] Trap strengthening (SAT) tested/added 102/102 trap constraints in 86362 ms
[2023-03-15 08:19:33] [INFO ] After 86703ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:19:33] [INFO ] After 87243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 63 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 42 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-15 08:19:34] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 08:19:34] [INFO ] Invariant cache hit.
[2023-03-15 08:19:34] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-03-15 08:19:34] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 08:19:34] [INFO ] Invariant cache hit.
[2023-03-15 08:19:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:19:39] [INFO ] Implicit Places using invariants and state equation in 4615 ms returned []
Implicit Place search using SMT with State Equation took 5152 ms to find 0 implicit places.
[2023-03-15 08:19:39] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-15 08:19:39] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 08:19:39] [INFO ] Invariant cache hit.
[2023-03-15 08:19:39] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5994 ms. Remains : 750/750 places, 1521/1521 transitions.
Incomplete random walk after 100000 steps, including 7215 resets, run finished after 1049 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:19:41] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 08:19:41] [INFO ] Invariant cache hit.
[2023-03-15 08:19:41] [INFO ] [Real]Absence check using 95 positive place invariants in 20 ms returned sat
[2023-03-15 08:19:41] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-15 08:19:41] [INFO ] After 354ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 08:19:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:19:41] [INFO ] After 79ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 08:19:41] [INFO ] After 161ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:19:41] [INFO ] After 641ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:19:41] [INFO ] [Nat]Absence check using 95 positive place invariants in 41 ms returned sat
[2023-03-15 08:19:41] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-15 08:19:42] [INFO ] After 394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:19:42] [INFO ] After 153ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:19:42] [INFO ] Deduced a trap composed of 296 places in 329 ms of which 0 ms to minimize.
[2023-03-15 08:19:43] [INFO ] Deduced a trap composed of 300 places in 332 ms of which 1 ms to minimize.
[2023-03-15 08:19:43] [INFO ] Deduced a trap composed of 298 places in 301 ms of which 0 ms to minimize.
[2023-03-15 08:19:43] [INFO ] Deduced a trap composed of 296 places in 306 ms of which 1 ms to minimize.
[2023-03-15 08:19:44] [INFO ] Deduced a trap composed of 294 places in 338 ms of which 0 ms to minimize.
[2023-03-15 08:19:44] [INFO ] Deduced a trap composed of 302 places in 311 ms of which 0 ms to minimize.
[2023-03-15 08:19:45] [INFO ] Deduced a trap composed of 304 places in 343 ms of which 1 ms to minimize.
[2023-03-15 08:19:45] [INFO ] Deduced a trap composed of 302 places in 334 ms of which 0 ms to minimize.
[2023-03-15 08:19:45] [INFO ] Deduced a trap composed of 302 places in 338 ms of which 0 ms to minimize.
[2023-03-15 08:19:46] [INFO ] Deduced a trap composed of 310 places in 336 ms of which 0 ms to minimize.
[2023-03-15 08:19:46] [INFO ] Deduced a trap composed of 304 places in 303 ms of which 1 ms to minimize.
[2023-03-15 08:19:47] [INFO ] Deduced a trap composed of 302 places in 330 ms of which 0 ms to minimize.
[2023-03-15 08:19:47] [INFO ] Deduced a trap composed of 298 places in 331 ms of which 0 ms to minimize.
[2023-03-15 08:19:47] [INFO ] Deduced a trap composed of 296 places in 341 ms of which 1 ms to minimize.
[2023-03-15 08:19:48] [INFO ] Deduced a trap composed of 298 places in 344 ms of which 0 ms to minimize.
[2023-03-15 08:19:48] [INFO ] Deduced a trap composed of 300 places in 335 ms of which 1 ms to minimize.
[2023-03-15 08:19:49] [INFO ] Deduced a trap composed of 306 places in 331 ms of which 1 ms to minimize.
[2023-03-15 08:19:49] [INFO ] Deduced a trap composed of 298 places in 329 ms of which 0 ms to minimize.
[2023-03-15 08:19:49] [INFO ] Deduced a trap composed of 296 places in 301 ms of which 1 ms to minimize.
[2023-03-15 08:19:50] [INFO ] Deduced a trap composed of 300 places in 338 ms of which 1 ms to minimize.
[2023-03-15 08:19:50] [INFO ] Deduced a trap composed of 296 places in 339 ms of which 1 ms to minimize.
[2023-03-15 08:19:51] [INFO ] Deduced a trap composed of 298 places in 312 ms of which 1 ms to minimize.
[2023-03-15 08:19:51] [INFO ] Deduced a trap composed of 298 places in 333 ms of which 0 ms to minimize.
[2023-03-15 08:19:52] [INFO ] Deduced a trap composed of 298 places in 332 ms of which 0 ms to minimize.
[2023-03-15 08:19:52] [INFO ] Deduced a trap composed of 290 places in 332 ms of which 1 ms to minimize.
[2023-03-15 08:19:53] [INFO ] Deduced a trap composed of 302 places in 335 ms of which 1 ms to minimize.
[2023-03-15 08:19:53] [INFO ] Deduced a trap composed of 304 places in 329 ms of which 0 ms to minimize.
[2023-03-15 08:19:54] [INFO ] Deduced a trap composed of 302 places in 337 ms of which 1 ms to minimize.
[2023-03-15 08:19:54] [INFO ] Deduced a trap composed of 306 places in 333 ms of which 1 ms to minimize.
[2023-03-15 08:19:54] [INFO ] Deduced a trap composed of 296 places in 338 ms of which 0 ms to minimize.
[2023-03-15 08:19:55] [INFO ] Deduced a trap composed of 298 places in 329 ms of which 1 ms to minimize.
[2023-03-15 08:19:55] [INFO ] Deduced a trap composed of 296 places in 327 ms of which 0 ms to minimize.
[2023-03-15 08:19:56] [INFO ] Deduced a trap composed of 296 places in 304 ms of which 0 ms to minimize.
[2023-03-15 08:19:56] [INFO ] Deduced a trap composed of 302 places in 330 ms of which 0 ms to minimize.
[2023-03-15 08:19:56] [INFO ] Deduced a trap composed of 298 places in 331 ms of which 1 ms to minimize.
[2023-03-15 08:19:57] [INFO ] Deduced a trap composed of 296 places in 325 ms of which 1 ms to minimize.
[2023-03-15 08:19:57] [INFO ] Deduced a trap composed of 302 places in 330 ms of which 0 ms to minimize.
[2023-03-15 08:19:57] [INFO ] Deduced a trap composed of 308 places in 329 ms of which 1 ms to minimize.
[2023-03-15 08:19:58] [INFO ] Deduced a trap composed of 298 places in 347 ms of which 0 ms to minimize.
[2023-03-15 08:19:58] [INFO ] Deduced a trap composed of 294 places in 332 ms of which 0 ms to minimize.
[2023-03-15 08:19:59] [INFO ] Deduced a trap composed of 298 places in 336 ms of which 1 ms to minimize.
[2023-03-15 08:19:59] [INFO ] Deduced a trap composed of 308 places in 343 ms of which 1 ms to minimize.
[2023-03-15 08:20:02] [INFO ] Deduced a trap composed of 308 places in 343 ms of which 1 ms to minimize.
[2023-03-15 08:20:03] [INFO ] Deduced a trap composed of 306 places in 335 ms of which 0 ms to minimize.
[2023-03-15 08:20:03] [INFO ] Deduced a trap composed of 302 places in 336 ms of which 1 ms to minimize.
[2023-03-15 08:20:04] [INFO ] Deduced a trap composed of 302 places in 344 ms of which 1 ms to minimize.
[2023-03-15 08:20:04] [INFO ] Deduced a trap composed of 304 places in 352 ms of which 1 ms to minimize.
[2023-03-15 08:20:05] [INFO ] Deduced a trap composed of 298 places in 344 ms of which 0 ms to minimize.
[2023-03-15 08:20:06] [INFO ] Deduced a trap composed of 304 places in 339 ms of which 0 ms to minimize.
[2023-03-15 08:20:06] [INFO ] Deduced a trap composed of 296 places in 339 ms of which 1 ms to minimize.
[2023-03-15 08:20:09] [INFO ] Deduced a trap composed of 298 places in 343 ms of which 2 ms to minimize.
[2023-03-15 08:20:09] [INFO ] Deduced a trap composed of 308 places in 338 ms of which 0 ms to minimize.
[2023-03-15 08:20:14] [INFO ] Deduced a trap composed of 302 places in 340 ms of which 0 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :414068 after 830831
[2023-03-15 08:20:23] [INFO ] Trap strengthening (SAT) tested/added 53/53 trap constraints in 41606 ms
[2023-03-15 08:20:24] [INFO ] After 41820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:20:24] [INFO ] After 42349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72621 resets, run finished after 10230 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8197 resets, run finished after 1880 ms. (steps per millisecond=531 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4597458 steps, run timeout after 36001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 4597458 steps, saw 784887 distinct states, run finished after 36003 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:21:12] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 08:21:12] [INFO ] Invariant cache hit.
[2023-03-15 08:21:12] [INFO ] [Real]Absence check using 95 positive place invariants in 20 ms returned sat
[2023-03-15 08:21:12] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 08:21:12] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:21:12] [INFO ] [Nat]Absence check using 95 positive place invariants in 20 ms returned sat
[2023-03-15 08:21:12] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-15 08:21:12] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:21:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:21:13] [INFO ] After 294ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:21:13] [INFO ] Deduced a trap composed of 129 places in 344 ms of which 0 ms to minimize.
[2023-03-15 08:21:14] [INFO ] Deduced a trap composed of 311 places in 361 ms of which 1 ms to minimize.
[2023-03-15 08:21:14] [INFO ] Deduced a trap composed of 305 places in 331 ms of which 0 ms to minimize.
[2023-03-15 08:21:14] [INFO ] Deduced a trap composed of 290 places in 316 ms of which 1 ms to minimize.
[2023-03-15 08:21:15] [INFO ] Deduced a trap composed of 305 places in 342 ms of which 0 ms to minimize.
[2023-03-15 08:21:15] [INFO ] Deduced a trap composed of 300 places in 349 ms of which 1 ms to minimize.
[2023-03-15 08:21:15] [INFO ] Deduced a trap composed of 307 places in 317 ms of which 1 ms to minimize.
[2023-03-15 08:21:16] [INFO ] Deduced a trap composed of 292 places in 346 ms of which 1 ms to minimize.
[2023-03-15 08:21:16] [INFO ] Deduced a trap composed of 307 places in 326 ms of which 0 ms to minimize.
[2023-03-15 08:21:17] [INFO ] Deduced a trap composed of 303 places in 313 ms of which 0 ms to minimize.
[2023-03-15 08:21:17] [INFO ] Deduced a trap composed of 294 places in 327 ms of which 1 ms to minimize.
[2023-03-15 08:21:17] [INFO ] Deduced a trap composed of 319 places in 335 ms of which 1 ms to minimize.
[2023-03-15 08:21:18] [INFO ] Deduced a trap composed of 309 places in 330 ms of which 1 ms to minimize.
[2023-03-15 08:21:18] [INFO ] Deduced a trap composed of 302 places in 325 ms of which 0 ms to minimize.
[2023-03-15 08:21:19] [INFO ] Deduced a trap composed of 316 places in 334 ms of which 2 ms to minimize.
[2023-03-15 08:21:19] [INFO ] Deduced a trap composed of 300 places in 338 ms of which 1 ms to minimize.
[2023-03-15 08:21:19] [INFO ] Deduced a trap composed of 305 places in 328 ms of which 0 ms to minimize.
[2023-03-15 08:21:20] [INFO ] Deduced a trap composed of 304 places in 326 ms of which 0 ms to minimize.
[2023-03-15 08:21:20] [INFO ] Deduced a trap composed of 302 places in 348 ms of which 1 ms to minimize.
[2023-03-15 08:21:20] [INFO ] Deduced a trap composed of 309 places in 346 ms of which 0 ms to minimize.
[2023-03-15 08:21:22] [INFO ] Deduced a trap composed of 306 places in 331 ms of which 1 ms to minimize.
[2023-03-15 08:21:23] [INFO ] Deduced a trap composed of 294 places in 342 ms of which 2 ms to minimize.
[2023-03-15 08:21:23] [INFO ] Deduced a trap composed of 300 places in 340 ms of which 1 ms to minimize.
[2023-03-15 08:21:24] [INFO ] Deduced a trap composed of 317 places in 339 ms of which 1 ms to minimize.
[2023-03-15 08:21:24] [INFO ] Deduced a trap composed of 296 places in 326 ms of which 0 ms to minimize.
[2023-03-15 08:21:24] [INFO ] Deduced a trap composed of 294 places in 334 ms of which 0 ms to minimize.
[2023-03-15 08:21:25] [INFO ] Deduced a trap composed of 317 places in 334 ms of which 0 ms to minimize.
[2023-03-15 08:21:26] [INFO ] Deduced a trap composed of 300 places in 316 ms of which 1 ms to minimize.
[2023-03-15 08:21:26] [INFO ] Deduced a trap composed of 292 places in 325 ms of which 1 ms to minimize.
[2023-03-15 08:21:26] [INFO ] Deduced a trap composed of 308 places in 326 ms of which 0 ms to minimize.
[2023-03-15 08:21:27] [INFO ] Deduced a trap composed of 294 places in 327 ms of which 1 ms to minimize.
[2023-03-15 08:21:27] [INFO ] Deduced a trap composed of 302 places in 339 ms of which 1 ms to minimize.
[2023-03-15 08:21:27] [INFO ] Deduced a trap composed of 300 places in 335 ms of which 1 ms to minimize.
[2023-03-15 08:21:28] [INFO ] Deduced a trap composed of 300 places in 317 ms of which 1 ms to minimize.
[2023-03-15 08:21:28] [INFO ] Deduced a trap composed of 304 places in 346 ms of which 0 ms to minimize.
[2023-03-15 08:21:29] [INFO ] Deduced a trap composed of 296 places in 323 ms of which 0 ms to minimize.
[2023-03-15 08:21:29] [INFO ] Deduced a trap composed of 298 places in 325 ms of which 0 ms to minimize.
[2023-03-15 08:21:30] [INFO ] Deduced a trap composed of 298 places in 344 ms of which 1 ms to minimize.
[2023-03-15 08:21:30] [INFO ] Deduced a trap composed of 296 places in 329 ms of which 1 ms to minimize.
[2023-03-15 08:21:31] [INFO ] Deduced a trap composed of 306 places in 318 ms of which 1 ms to minimize.
[2023-03-15 08:21:31] [INFO ] Deduced a trap composed of 300 places in 316 ms of which 1 ms to minimize.
[2023-03-15 08:21:32] [INFO ] Deduced a trap composed of 300 places in 329 ms of which 1 ms to minimize.
[2023-03-15 08:21:32] [INFO ] Deduced a trap composed of 298 places in 322 ms of which 1 ms to minimize.
[2023-03-15 08:21:33] [INFO ] Deduced a trap composed of 300 places in 328 ms of which 1 ms to minimize.
[2023-03-15 08:21:33] [INFO ] Deduced a trap composed of 300 places in 322 ms of which 1 ms to minimize.
[2023-03-15 08:21:34] [INFO ] Deduced a trap composed of 300 places in 325 ms of which 0 ms to minimize.
[2023-03-15 08:21:34] [INFO ] Deduced a trap composed of 304 places in 341 ms of which 1 ms to minimize.
[2023-03-15 08:21:35] [INFO ] Deduced a trap composed of 294 places in 344 ms of which 1 ms to minimize.
[2023-03-15 08:21:35] [INFO ] Deduced a trap composed of 298 places in 332 ms of which 1 ms to minimize.
[2023-03-15 08:21:36] [INFO ] Deduced a trap composed of 306 places in 336 ms of which 0 ms to minimize.
[2023-03-15 08:21:36] [INFO ] Deduced a trap composed of 296 places in 332 ms of which 1 ms to minimize.
[2023-03-15 08:21:36] [INFO ] Deduced a trap composed of 296 places in 339 ms of which 1 ms to minimize.
[2023-03-15 08:21:37] [INFO ] Deduced a trap composed of 294 places in 341 ms of which 1 ms to minimize.
[2023-03-15 08:21:37] [INFO ] Deduced a trap composed of 296 places in 362 ms of which 1 ms to minimize.
[2023-03-15 08:21:40] [INFO ] Deduced a trap composed of 300 places in 333 ms of which 1 ms to minimize.
[2023-03-15 08:21:41] [INFO ] Deduced a trap composed of 290 places in 339 ms of which 0 ms to minimize.
[2023-03-15 08:21:41] [INFO ] Deduced a trap composed of 298 places in 331 ms of which 1 ms to minimize.
[2023-03-15 08:21:42] [INFO ] Deduced a trap composed of 298 places in 338 ms of which 1 ms to minimize.
[2023-03-15 08:21:42] [INFO ] Deduced a trap composed of 294 places in 332 ms of which 0 ms to minimize.
[2023-03-15 08:21:43] [INFO ] Deduced a trap composed of 292 places in 341 ms of which 1 ms to minimize.
[2023-03-15 08:21:43] [INFO ] Deduced a trap composed of 306 places in 349 ms of which 1 ms to minimize.
[2023-03-15 08:21:44] [INFO ] Deduced a trap composed of 298 places in 345 ms of which 1 ms to minimize.
[2023-03-15 08:21:44] [INFO ] Deduced a trap composed of 304 places in 328 ms of which 1 ms to minimize.
[2023-03-15 08:21:46] [INFO ] Deduced a trap composed of 302 places in 330 ms of which 0 ms to minimize.
[2023-03-15 08:21:46] [INFO ] Deduced a trap composed of 294 places in 329 ms of which 0 ms to minimize.
[2023-03-15 08:21:46] [INFO ] Deduced a trap composed of 298 places in 337 ms of which 1 ms to minimize.
[2023-03-15 08:21:47] [INFO ] Deduced a trap composed of 304 places in 330 ms of which 0 ms to minimize.
[2023-03-15 08:21:47] [INFO ] Deduced a trap composed of 302 places in 326 ms of which 1 ms to minimize.
[2023-03-15 08:21:48] [INFO ] Deduced a trap composed of 302 places in 328 ms of which 1 ms to minimize.
[2023-03-15 08:21:49] [INFO ] Deduced a trap composed of 304 places in 334 ms of which 0 ms to minimize.
[2023-03-15 08:21:51] [INFO ] Deduced a trap composed of 292 places in 346 ms of which 1 ms to minimize.
[2023-03-15 08:21:52] [INFO ] Deduced a trap composed of 298 places in 327 ms of which 1 ms to minimize.
[2023-03-15 08:21:52] [INFO ] Deduced a trap composed of 306 places in 337 ms of which 1 ms to minimize.
[2023-03-15 08:21:53] [INFO ] Deduced a trap composed of 298 places in 337 ms of which 1 ms to minimize.
[2023-03-15 08:21:53] [INFO ] Deduced a trap composed of 300 places in 334 ms of which 1 ms to minimize.
[2023-03-15 08:21:54] [INFO ] Deduced a trap composed of 298 places in 333 ms of which 1 ms to minimize.
[2023-03-15 08:21:54] [INFO ] Deduced a trap composed of 304 places in 335 ms of which 1 ms to minimize.
[2023-03-15 08:21:55] [INFO ] Deduced a trap composed of 304 places in 328 ms of which 0 ms to minimize.
[2023-03-15 08:21:55] [INFO ] Deduced a trap composed of 298 places in 354 ms of which 1 ms to minimize.
[2023-03-15 08:21:57] [INFO ] Deduced a trap composed of 300 places in 330 ms of which 0 ms to minimize.
[2023-03-15 08:21:58] [INFO ] Deduced a trap composed of 302 places in 328 ms of which 1 ms to minimize.
[2023-03-15 08:22:07] [INFO ] Trap strengthening (SAT) tested/added 81/81 trap constraints in 53845 ms
[2023-03-15 08:22:07] [INFO ] After 54184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:22:07] [INFO ] After 54741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 36 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 35 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-15 08:22:07] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 08:22:07] [INFO ] Invariant cache hit.
[2023-03-15 08:22:07] [INFO ] Implicit Places using invariants in 560 ms returned []
[2023-03-15 08:22:07] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 08:22:07] [INFO ] Invariant cache hit.
[2023-03-15 08:22:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:22:10] [INFO ] Implicit Places using invariants and state equation in 3001 ms returned []
Implicit Place search using SMT with State Equation took 3574 ms to find 0 implicit places.
[2023-03-15 08:22:10] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-15 08:22:10] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 08:22:10] [INFO ] Invariant cache hit.
[2023-03-15 08:22:12] [INFO ] Dead Transitions using invariants and state equation in 1372 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5028 ms. Remains : 750/750 places, 1521/1521 transitions.
Incomplete random walk after 100000 steps, including 7233 resets, run finished after 1229 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:22:13] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 08:22:13] [INFO ] Invariant cache hit.
[2023-03-15 08:22:13] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2023-03-15 08:22:13] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 08:22:13] [INFO ] After 365ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 08:22:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:22:13] [INFO ] After 81ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 08:22:14] [INFO ] After 157ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:22:14] [INFO ] After 666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:22:14] [INFO ] [Nat]Absence check using 95 positive place invariants in 21 ms returned sat
[2023-03-15 08:22:14] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-15 08:22:14] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:22:14] [INFO ] After 153ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:22:15] [INFO ] Deduced a trap composed of 296 places in 317 ms of which 0 ms to minimize.
[2023-03-15 08:22:15] [INFO ] Deduced a trap composed of 300 places in 320 ms of which 1 ms to minimize.
[2023-03-15 08:22:15] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 1 ms to minimize.
[2023-03-15 08:22:16] [INFO ] Deduced a trap composed of 296 places in 302 ms of which 0 ms to minimize.
[2023-03-15 08:22:16] [INFO ] Deduced a trap composed of 294 places in 317 ms of which 1 ms to minimize.
[2023-03-15 08:22:16] [INFO ] Deduced a trap composed of 302 places in 320 ms of which 1 ms to minimize.
[2023-03-15 08:22:17] [INFO ] Deduced a trap composed of 304 places in 321 ms of which 0 ms to minimize.
[2023-03-15 08:22:17] [INFO ] Deduced a trap composed of 302 places in 315 ms of which 0 ms to minimize.
[2023-03-15 08:22:18] [INFO ] Deduced a trap composed of 302 places in 322 ms of which 1 ms to minimize.
[2023-03-15 08:22:18] [INFO ] Deduced a trap composed of 310 places in 310 ms of which 1 ms to minimize.
[2023-03-15 08:22:18] [INFO ] Deduced a trap composed of 304 places in 306 ms of which 0 ms to minimize.
[2023-03-15 08:22:19] [INFO ] Deduced a trap composed of 302 places in 305 ms of which 0 ms to minimize.
[2023-03-15 08:22:19] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 1 ms to minimize.
[2023-03-15 08:22:19] [INFO ] Deduced a trap composed of 296 places in 304 ms of which 1 ms to minimize.
[2023-03-15 08:22:20] [INFO ] Deduced a trap composed of 298 places in 311 ms of which 0 ms to minimize.
[2023-03-15 08:22:20] [INFO ] Deduced a trap composed of 300 places in 302 ms of which 1 ms to minimize.
[2023-03-15 08:22:21] [INFO ] Deduced a trap composed of 306 places in 302 ms of which 1 ms to minimize.
[2023-03-15 08:22:21] [INFO ] Deduced a trap composed of 298 places in 310 ms of which 1 ms to minimize.
[2023-03-15 08:22:21] [INFO ] Deduced a trap composed of 296 places in 311 ms of which 1 ms to minimize.
[2023-03-15 08:22:22] [INFO ] Deduced a trap composed of 300 places in 292 ms of which 1 ms to minimize.
[2023-03-15 08:22:22] [INFO ] Deduced a trap composed of 296 places in 299 ms of which 0 ms to minimize.
[2023-03-15 08:22:23] [INFO ] Deduced a trap composed of 298 places in 299 ms of which 1 ms to minimize.
[2023-03-15 08:22:23] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 0 ms to minimize.
[2023-03-15 08:22:24] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 1 ms to minimize.
[2023-03-15 08:22:24] [INFO ] Deduced a trap composed of 290 places in 306 ms of which 1 ms to minimize.
[2023-03-15 08:22:25] [INFO ] Deduced a trap composed of 302 places in 309 ms of which 0 ms to minimize.
[2023-03-15 08:22:25] [INFO ] Deduced a trap composed of 304 places in 295 ms of which 0 ms to minimize.
[2023-03-15 08:22:25] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2023-03-15 08:22:26] [INFO ] Deduced a trap composed of 306 places in 304 ms of which 0 ms to minimize.
[2023-03-15 08:22:26] [INFO ] Deduced a trap composed of 296 places in 302 ms of which 0 ms to minimize.
[2023-03-15 08:22:26] [INFO ] Deduced a trap composed of 298 places in 300 ms of which 0 ms to minimize.
[2023-03-15 08:22:27] [INFO ] Deduced a trap composed of 296 places in 302 ms of which 1 ms to minimize.
[2023-03-15 08:22:27] [INFO ] Deduced a trap composed of 296 places in 292 ms of which 1 ms to minimize.
[2023-03-15 08:22:28] [INFO ] Deduced a trap composed of 302 places in 294 ms of which 1 ms to minimize.
[2023-03-15 08:22:28] [INFO ] Deduced a trap composed of 298 places in 300 ms of which 1 ms to minimize.
[2023-03-15 08:22:28] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 0 ms to minimize.
[2023-03-15 08:22:29] [INFO ] Deduced a trap composed of 302 places in 300 ms of which 0 ms to minimize.
[2023-03-15 08:22:29] [INFO ] Deduced a trap composed of 308 places in 300 ms of which 1 ms to minimize.
[2023-03-15 08:22:29] [INFO ] Deduced a trap composed of 298 places in 300 ms of which 1 ms to minimize.
[2023-03-15 08:22:30] [INFO ] Deduced a trap composed of 294 places in 306 ms of which 1 ms to minimize.
[2023-03-15 08:22:30] [INFO ] Deduced a trap composed of 298 places in 302 ms of which 1 ms to minimize.
[2023-03-15 08:22:31] [INFO ] Deduced a trap composed of 308 places in 329 ms of which 0 ms to minimize.
[2023-03-15 08:22:34] [INFO ] Deduced a trap composed of 308 places in 354 ms of which 1 ms to minimize.
[2023-03-15 08:22:34] [INFO ] Deduced a trap composed of 306 places in 309 ms of which 1 ms to minimize.
[2023-03-15 08:22:35] [INFO ] Deduced a trap composed of 302 places in 320 ms of which 0 ms to minimize.
[2023-03-15 08:22:35] [INFO ] Deduced a trap composed of 302 places in 316 ms of which 1 ms to minimize.
[2023-03-15 08:22:36] [INFO ] Deduced a trap composed of 304 places in 304 ms of which 1 ms to minimize.
[2023-03-15 08:22:37] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 1 ms to minimize.
[2023-03-15 08:22:38] [INFO ] Deduced a trap composed of 304 places in 314 ms of which 1 ms to minimize.
[2023-03-15 08:22:38] [INFO ] Deduced a trap composed of 296 places in 305 ms of which 0 ms to minimize.
[2023-03-15 08:22:40] [INFO ] Deduced a trap composed of 298 places in 321 ms of which 0 ms to minimize.
[2023-03-15 08:22:41] [INFO ] Deduced a trap composed of 308 places in 304 ms of which 1 ms to minimize.
[2023-03-15 08:22:46] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2023-03-15 08:22:55] [INFO ] Trap strengthening (SAT) tested/added 53/53 trap constraints in 40722 ms
[2023-03-15 08:22:55] [INFO ] After 40923ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:22:55] [INFO ] After 41470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 719 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 370721 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 370721 steps, saw 59827 distinct states, run finished after 3002 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:22:58] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 08:22:58] [INFO ] Invariant cache hit.
[2023-03-15 08:22:58] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2023-03-15 08:22:58] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 08:22:58] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:22:58] [INFO ] [Nat]Absence check using 95 positive place invariants in 21 ms returned sat
[2023-03-15 08:22:58] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-15 08:22:59] [INFO ] After 478ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:22:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:22:59] [INFO ] After 314ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:23:00] [INFO ] Deduced a trap composed of 129 places in 335 ms of which 1 ms to minimize.
[2023-03-15 08:23:00] [INFO ] Deduced a trap composed of 299 places in 317 ms of which 0 ms to minimize.
[2023-03-15 08:23:01] [INFO ] Deduced a trap composed of 311 places in 316 ms of which 0 ms to minimize.
[2023-03-15 08:23:01] [INFO ] Deduced a trap composed of 309 places in 316 ms of which 0 ms to minimize.
[2023-03-15 08:23:01] [INFO ] Deduced a trap composed of 292 places in 308 ms of which 0 ms to minimize.
[2023-03-15 08:23:02] [INFO ] Deduced a trap composed of 306 places in 334 ms of which 0 ms to minimize.
[2023-03-15 08:23:02] [INFO ] Deduced a trap composed of 288 places in 334 ms of which 0 ms to minimize.
[2023-03-15 08:23:03] [INFO ] Deduced a trap composed of 292 places in 336 ms of which 1 ms to minimize.
[2023-03-15 08:23:03] [INFO ] Deduced a trap composed of 298 places in 337 ms of which 1 ms to minimize.
[2023-03-15 08:23:04] [INFO ] Deduced a trap composed of 290 places in 327 ms of which 1 ms to minimize.
[2023-03-15 08:23:04] [INFO ] Deduced a trap composed of 302 places in 330 ms of which 1 ms to minimize.
[2023-03-15 08:23:04] [INFO ] Deduced a trap composed of 302 places in 330 ms of which 0 ms to minimize.
[2023-03-15 08:23:05] [INFO ] Deduced a trap composed of 302 places in 335 ms of which 0 ms to minimize.
[2023-03-15 08:23:05] [INFO ] Deduced a trap composed of 298 places in 329 ms of which 0 ms to minimize.
[2023-03-15 08:23:05] [INFO ] Deduced a trap composed of 304 places in 324 ms of which 1 ms to minimize.
[2023-03-15 08:23:06] [INFO ] Deduced a trap composed of 290 places in 331 ms of which 0 ms to minimize.
[2023-03-15 08:23:06] [INFO ] Deduced a trap composed of 304 places in 327 ms of which 1 ms to minimize.
[2023-03-15 08:23:07] [INFO ] Deduced a trap composed of 298 places in 335 ms of which 0 ms to minimize.
[2023-03-15 08:23:07] [INFO ] Deduced a trap composed of 300 places in 332 ms of which 0 ms to minimize.
[2023-03-15 08:23:08] [INFO ] Deduced a trap composed of 300 places in 333 ms of which 0 ms to minimize.
[2023-03-15 08:23:08] [INFO ] Deduced a trap composed of 302 places in 324 ms of which 1 ms to minimize.
[2023-03-15 08:23:08] [INFO ] Deduced a trap composed of 302 places in 327 ms of which 1 ms to minimize.
[2023-03-15 08:23:09] [INFO ] Deduced a trap composed of 302 places in 326 ms of which 1 ms to minimize.
[2023-03-15 08:23:09] [INFO ] Deduced a trap composed of 304 places in 333 ms of which 1 ms to minimize.
[2023-03-15 08:23:10] [INFO ] Deduced a trap composed of 298 places in 353 ms of which 1 ms to minimize.
[2023-03-15 08:23:10] [INFO ] Deduced a trap composed of 296 places in 335 ms of which 1 ms to minimize.
[2023-03-15 08:23:10] [INFO ] Deduced a trap composed of 296 places in 328 ms of which 0 ms to minimize.
[2023-03-15 08:23:11] [INFO ] Deduced a trap composed of 298 places in 333 ms of which 0 ms to minimize.
[2023-03-15 08:23:11] [INFO ] Deduced a trap composed of 300 places in 338 ms of which 1 ms to minimize.
[2023-03-15 08:23:12] [INFO ] Deduced a trap composed of 296 places in 336 ms of which 0 ms to minimize.
[2023-03-15 08:23:12] [INFO ] Deduced a trap composed of 302 places in 334 ms of which 1 ms to minimize.
[2023-03-15 08:23:13] [INFO ] Deduced a trap composed of 304 places in 340 ms of which 1 ms to minimize.
[2023-03-15 08:23:13] [INFO ] Deduced a trap composed of 300 places in 360 ms of which 1 ms to minimize.
[2023-03-15 08:23:13] [INFO ] Deduced a trap composed of 298 places in 333 ms of which 0 ms to minimize.
[2023-03-15 08:23:14] [INFO ] Deduced a trap composed of 306 places in 335 ms of which 1 ms to minimize.
[2023-03-15 08:23:14] [INFO ] Deduced a trap composed of 296 places in 337 ms of which 1 ms to minimize.
[2023-03-15 08:23:15] [INFO ] Deduced a trap composed of 300 places in 337 ms of which 0 ms to minimize.
[2023-03-15 08:23:15] [INFO ] Deduced a trap composed of 302 places in 342 ms of which 1 ms to minimize.
[2023-03-15 08:23:16] [INFO ] Deduced a trap composed of 302 places in 333 ms of which 0 ms to minimize.
[2023-03-15 08:23:16] [INFO ] Deduced a trap composed of 296 places in 331 ms of which 1 ms to minimize.
[2023-03-15 08:23:16] [INFO ] Deduced a trap composed of 300 places in 349 ms of which 1 ms to minimize.
[2023-03-15 08:23:17] [INFO ] Deduced a trap composed of 300 places in 334 ms of which 1 ms to minimize.
[2023-03-15 08:23:17] [INFO ] Deduced a trap composed of 294 places in 341 ms of which 0 ms to minimize.
[2023-03-15 08:23:18] [INFO ] Deduced a trap composed of 306 places in 346 ms of which 0 ms to minimize.
[2023-03-15 08:23:18] [INFO ] Deduced a trap composed of 307 places in 345 ms of which 1 ms to minimize.
[2023-03-15 08:23:21] [INFO ] Deduced a trap composed of 302 places in 319 ms of which 1 ms to minimize.
[2023-03-15 08:23:23] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 24065 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 08:23:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 08:23:23] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 32 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-15 08:23:23] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 08:23:23] [INFO ] Invariant cache hit.
[2023-03-15 08:23:24] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 746 ms. Remains : 750/750 places, 1521/1521 transitions.
Incomplete random walk after 10000 steps, including 693 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 349386 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 349386 steps, saw 56567 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 08:23:27] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 08:23:27] [INFO ] Invariant cache hit.
[2023-03-15 08:23:27] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2023-03-15 08:23:27] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-15 08:23:27] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:23:28] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2023-03-15 08:23:28] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-15 08:23:28] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:23:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:23:28] [INFO ] After 295ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 08:23:29] [INFO ] Deduced a trap composed of 129 places in 366 ms of which 1 ms to minimize.
[2023-03-15 08:23:29] [INFO ] Deduced a trap composed of 299 places in 355 ms of which 0 ms to minimize.
[2023-03-15 08:23:30] [INFO ] Deduced a trap composed of 311 places in 350 ms of which 0 ms to minimize.
[2023-03-15 08:23:30] [INFO ] Deduced a trap composed of 309 places in 350 ms of which 0 ms to minimize.
[2023-03-15 08:23:31] [INFO ] Deduced a trap composed of 292 places in 351 ms of which 1 ms to minimize.
[2023-03-15 08:23:31] [INFO ] Deduced a trap composed of 306 places in 337 ms of which 1 ms to minimize.
[2023-03-15 08:23:31] [INFO ] Deduced a trap composed of 288 places in 339 ms of which 1 ms to minimize.
[2023-03-15 08:23:32] [INFO ] Deduced a trap composed of 292 places in 338 ms of which 1 ms to minimize.
[2023-03-15 08:23:32] [INFO ] Deduced a trap composed of 298 places in 336 ms of which 1 ms to minimize.
[2023-03-15 08:23:33] [INFO ] Deduced a trap composed of 290 places in 339 ms of which 1 ms to minimize.
[2023-03-15 08:23:33] [INFO ] Deduced a trap composed of 302 places in 341 ms of which 0 ms to minimize.
[2023-03-15 08:23:34] [INFO ] Deduced a trap composed of 302 places in 335 ms of which 1 ms to minimize.
[2023-03-15 08:23:34] [INFO ] Deduced a trap composed of 302 places in 349 ms of which 1 ms to minimize.
[2023-03-15 08:23:34] [INFO ] Deduced a trap composed of 298 places in 335 ms of which 1 ms to minimize.
[2023-03-15 08:23:35] [INFO ] Deduced a trap composed of 304 places in 335 ms of which 1 ms to minimize.
[2023-03-15 08:23:35] [INFO ] Deduced a trap composed of 290 places in 336 ms of which 0 ms to minimize.
[2023-03-15 08:23:36] [INFO ] Deduced a trap composed of 304 places in 337 ms of which 1 ms to minimize.
[2023-03-15 08:23:36] [INFO ] Deduced a trap composed of 298 places in 343 ms of which 1 ms to minimize.
[2023-03-15 08:23:36] [INFO ] Deduced a trap composed of 300 places in 340 ms of which 0 ms to minimize.
[2023-03-15 08:23:37] [INFO ] Deduced a trap composed of 300 places in 338 ms of which 0 ms to minimize.
[2023-03-15 08:23:37] [INFO ] Deduced a trap composed of 302 places in 345 ms of which 1 ms to minimize.
[2023-03-15 08:23:38] [INFO ] Deduced a trap composed of 302 places in 334 ms of which 1 ms to minimize.
[2023-03-15 08:23:38] [INFO ] Deduced a trap composed of 302 places in 329 ms of which 1 ms to minimize.
[2023-03-15 08:23:38] [INFO ] Deduced a trap composed of 304 places in 335 ms of which 1 ms to minimize.
[2023-03-15 08:23:41] [INFO ] Deduced a trap composed of 298 places in 2242 ms of which 1 ms to minimize.
[2023-03-15 08:23:41] [INFO ] Deduced a trap composed of 296 places in 337 ms of which 1 ms to minimize.
[2023-03-15 08:23:42] [INFO ] Deduced a trap composed of 296 places in 337 ms of which 1 ms to minimize.
[2023-03-15 08:23:42] [INFO ] Deduced a trap composed of 298 places in 339 ms of which 1 ms to minimize.
[2023-03-15 08:23:43] [INFO ] Deduced a trap composed of 300 places in 342 ms of which 1 ms to minimize.
[2023-03-15 08:23:43] [INFO ] Deduced a trap composed of 296 places in 351 ms of which 0 ms to minimize.
[2023-03-15 08:23:43] [INFO ] Deduced a trap composed of 302 places in 335 ms of which 0 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 524288
[2023-03-15 08:23:44] [INFO ] Deduced a trap composed of 304 places in 356 ms of which 1 ms to minimize.
[2023-03-15 08:23:44] [INFO ] Deduced a trap composed of 300 places in 338 ms of which 1 ms to minimize.
[2023-03-15 08:23:45] [INFO ] Deduced a trap composed of 298 places in 344 ms of which 1 ms to minimize.
[2023-03-15 08:23:45] [INFO ] Deduced a trap composed of 306 places in 347 ms of which 0 ms to minimize.
[2023-03-15 08:23:46] [INFO ] Deduced a trap composed of 296 places in 327 ms of which 1 ms to minimize.
SDD size :830831 after 1.72238e+06
[2023-03-15 08:23:46] [INFO ] Deduced a trap composed of 300 places in 330 ms of which 0 ms to minimize.
[2023-03-15 08:23:46] [INFO ] Deduced a trap composed of 302 places in 342 ms of which 0 ms to minimize.
[2023-03-15 08:23:47] [INFO ] Deduced a trap composed of 302 places in 334 ms of which 0 ms to minimize.
[2023-03-15 08:23:47] [INFO ] Deduced a trap composed of 296 places in 338 ms of which 1 ms to minimize.
[2023-03-15 08:23:48] [INFO ] Deduced a trap composed of 300 places in 333 ms of which 1 ms to minimize.
[2023-03-15 08:23:48] [INFO ] Deduced a trap composed of 300 places in 336 ms of which 1 ms to minimize.
[2023-03-15 08:23:48] [INFO ] Deduced a trap composed of 294 places in 338 ms of which 0 ms to minimize.
[2023-03-15 08:23:49] [INFO ] Deduced a trap composed of 306 places in 346 ms of which 1 ms to minimize.
[2023-03-15 08:23:49] [INFO ] Deduced a trap composed of 307 places in 337 ms of which 1 ms to minimize.
[2023-03-15 08:23:52] [INFO ] Deduced a trap composed of 302 places in 361 ms of which 1 ms to minimize.
[2023-03-15 08:23:52] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 24110 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 08:23:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 08:23:52] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 34 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 34 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-15 08:23:52] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 08:23:52] [INFO ] Invariant cache hit.
[2023-03-15 08:23:53] [INFO ] Implicit Places using invariants in 572 ms returned []
[2023-03-15 08:23:53] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 08:23:53] [INFO ] Invariant cache hit.
[2023-03-15 08:23:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 08:23:57] [INFO ] Implicit Places using invariants and state equation in 3462 ms returned []
Implicit Place search using SMT with State Equation took 4040 ms to find 0 implicit places.
[2023-03-15 08:23:57] [INFO ] Redundant transitions in 98 ms returned []
[2023-03-15 08:23:57] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 08:23:57] [INFO ] Invariant cache hit.
[2023-03-15 08:23:57] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4890 ms. Remains : 750/750 places, 1521/1521 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 750 transition count 1512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 750 transition count 1511
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 749 transition count 1511
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 749 transition count 1510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 748 transition count 1510
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 748 transition count 1500
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 738 transition count 1500
Applied a total of 33 rules in 163 ms. Remains 738 /750 variables (removed 12) and now considering 1500/1521 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1500 rows 738 cols
[2023-03-15 08:23:58] [INFO ] Computed 102 place invariants in 21 ms
[2023-03-15 08:23:58] [INFO ] [Real]Absence check using 95 positive place invariants in 19 ms returned sat
[2023-03-15 08:23:58] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-15 08:23:58] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:23:58] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2023-03-15 08:23:58] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-15 08:23:58] [INFO ] After 404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:23:59] [INFO ] Deduced a trap composed of 292 places in 295 ms of which 0 ms to minimize.
[2023-03-15 08:23:59] [INFO ] Deduced a trap composed of 302 places in 301 ms of which 1 ms to minimize.
[2023-03-15 08:23:59] [INFO ] Deduced a trap composed of 298 places in 297 ms of which 0 ms to minimize.
[2023-03-15 08:24:00] [INFO ] Deduced a trap composed of 294 places in 299 ms of which 0 ms to minimize.
[2023-03-15 08:24:00] [INFO ] Deduced a trap composed of 288 places in 294 ms of which 1 ms to minimize.
[2023-03-15 08:24:00] [INFO ] Deduced a trap composed of 298 places in 318 ms of which 1 ms to minimize.
[2023-03-15 08:24:01] [INFO ] Deduced a trap composed of 292 places in 294 ms of which 1 ms to minimize.
[2023-03-15 08:24:01] [INFO ] Deduced a trap composed of 300 places in 298 ms of which 1 ms to minimize.
[2023-03-15 08:24:01] [INFO ] Deduced a trap composed of 308 places in 306 ms of which 1 ms to minimize.
[2023-03-15 08:24:02] [INFO ] Deduced a trap composed of 298 places in 302 ms of which 0 ms to minimize.
[2023-03-15 08:24:02] [INFO ] Deduced a trap composed of 296 places in 299 ms of which 1 ms to minimize.
[2023-03-15 08:24:02] [INFO ] Deduced a trap composed of 288 places in 292 ms of which 0 ms to minimize.
[2023-03-15 08:24:03] [INFO ] Deduced a trap composed of 300 places in 299 ms of which 1 ms to minimize.
[2023-03-15 08:24:03] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 0 ms to minimize.
[2023-03-15 08:24:03] [INFO ] Deduced a trap composed of 304 places in 301 ms of which 1 ms to minimize.
[2023-03-15 08:24:04] [INFO ] Deduced a trap composed of 296 places in 318 ms of which 0 ms to minimize.
[2023-03-15 08:24:04] [INFO ] Deduced a trap composed of 302 places in 298 ms of which 0 ms to minimize.
[2023-03-15 08:24:05] [INFO ] Deduced a trap composed of 296 places in 296 ms of which 1 ms to minimize.
[2023-03-15 08:24:05] [INFO ] Deduced a trap composed of 294 places in 305 ms of which 1 ms to minimize.
[2023-03-15 08:24:05] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2023-03-15 08:24:06] [INFO ] Deduced a trap composed of 294 places in 301 ms of which 0 ms to minimize.
[2023-03-15 08:24:06] [INFO ] Deduced a trap composed of 290 places in 304 ms of which 0 ms to minimize.
[2023-03-15 08:24:06] [INFO ] Deduced a trap composed of 288 places in 301 ms of which 1 ms to minimize.
[2023-03-15 08:24:07] [INFO ] Deduced a trap composed of 290 places in 298 ms of which 1 ms to minimize.
[2023-03-15 08:24:07] [INFO ] Deduced a trap composed of 306 places in 316 ms of which 0 ms to minimize.
[2023-03-15 08:24:07] [INFO ] Deduced a trap composed of 298 places in 299 ms of which 0 ms to minimize.
[2023-03-15 08:24:08] [INFO ] Deduced a trap composed of 296 places in 303 ms of which 1 ms to minimize.
[2023-03-15 08:24:08] [INFO ] Deduced a trap composed of 296 places in 296 ms of which 1 ms to minimize.
[2023-03-15 08:24:08] [INFO ] Deduced a trap composed of 298 places in 294 ms of which 0 ms to minimize.
[2023-03-15 08:24:09] [INFO ] Deduced a trap composed of 300 places in 296 ms of which 0 ms to minimize.
[2023-03-15 08:24:09] [INFO ] Deduced a trap composed of 302 places in 296 ms of which 1 ms to minimize.
[2023-03-15 08:24:09] [INFO ] Deduced a trap composed of 304 places in 295 ms of which 1 ms to minimize.
[2023-03-15 08:24:10] [INFO ] Deduced a trap composed of 298 places in 296 ms of which 1 ms to minimize.
[2023-03-15 08:24:10] [INFO ] Deduced a trap composed of 306 places in 323 ms of which 0 ms to minimize.
[2023-03-15 08:24:10] [INFO ] Deduced a trap composed of 302 places in 293 ms of which 1 ms to minimize.
[2023-03-15 08:24:11] [INFO ] Deduced a trap composed of 300 places in 299 ms of which 0 ms to minimize.
[2023-03-15 08:24:11] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 0 ms to minimize.
[2023-03-15 08:24:12] [INFO ] Deduced a trap composed of 306 places in 299 ms of which 1 ms to minimize.
[2023-03-15 08:24:12] [INFO ] Deduced a trap composed of 298 places in 301 ms of which 1 ms to minimize.
[2023-03-15 08:24:12] [INFO ] Deduced a trap composed of 296 places in 299 ms of which 1 ms to minimize.
[2023-03-15 08:24:13] [INFO ] Deduced a trap composed of 298 places in 298 ms of which 1 ms to minimize.
[2023-03-15 08:24:13] [INFO ] Deduced a trap composed of 300 places in 295 ms of which 0 ms to minimize.
[2023-03-15 08:24:13] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 1 ms to minimize.
[2023-03-15 08:24:14] [INFO ] Deduced a trap composed of 298 places in 314 ms of which 1 ms to minimize.
[2023-03-15 08:24:14] [INFO ] Deduced a trap composed of 292 places in 300 ms of which 1 ms to minimize.
[2023-03-15 08:24:14] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2023-03-15 08:24:15] [INFO ] Deduced a trap composed of 298 places in 298 ms of which 0 ms to minimize.
[2023-03-15 08:24:15] [INFO ] Deduced a trap composed of 296 places in 296 ms of which 1 ms to minimize.
[2023-03-15 08:24:15] [INFO ] Deduced a trap composed of 294 places in 301 ms of which 1 ms to minimize.
[2023-03-15 08:24:16] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 1 ms to minimize.
[2023-03-15 08:24:16] [INFO ] Deduced a trap composed of 298 places in 302 ms of which 1 ms to minimize.
[2023-03-15 08:24:16] [INFO ] Deduced a trap composed of 298 places in 314 ms of which 13 ms to minimize.
[2023-03-15 08:24:17] [INFO ] Deduced a trap composed of 296 places in 317 ms of which 1 ms to minimize.
[2023-03-15 08:24:17] [INFO ] Deduced a trap composed of 298 places in 306 ms of which 1 ms to minimize.
[2023-03-15 08:24:18] [INFO ] Deduced a trap composed of 296 places in 303 ms of which 1 ms to minimize.
[2023-03-15 08:24:18] [INFO ] Deduced a trap composed of 298 places in 303 ms of which 1 ms to minimize.
[2023-03-15 08:24:18] [INFO ] Deduced a trap composed of 292 places in 299 ms of which 1 ms to minimize.
[2023-03-15 08:24:19] [INFO ] Deduced a trap composed of 288 places in 297 ms of which 1 ms to minimize.
[2023-03-15 08:24:19] [INFO ] Deduced a trap composed of 296 places in 298 ms of which 1 ms to minimize.
[2023-03-15 08:24:19] [INFO ] Deduced a trap composed of 304 places in 295 ms of which 1 ms to minimize.
[2023-03-15 08:24:20] [INFO ] Deduced a trap composed of 304 places in 300 ms of which 1 ms to minimize.
[2023-03-15 08:24:20] [INFO ] Deduced a trap composed of 302 places in 318 ms of which 1 ms to minimize.
[2023-03-15 08:24:20] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2023-03-15 08:24:21] [INFO ] Deduced a trap composed of 304 places in 298 ms of which 0 ms to minimize.
[2023-03-15 08:24:21] [INFO ] Deduced a trap composed of 294 places in 298 ms of which 1 ms to minimize.
[2023-03-15 08:24:21] [INFO ] Deduced a trap composed of 300 places in 298 ms of which 0 ms to minimize.
[2023-03-15 08:24:22] [INFO ] Deduced a trap composed of 300 places in 307 ms of which 1 ms to minimize.
[2023-03-15 08:24:24] [INFO ] Deduced a trap composed of 292 places in 304 ms of which 1 ms to minimize.
[2023-03-15 08:24:24] [INFO ] Deduced a trap composed of 292 places in 295 ms of which 0 ms to minimize.
[2023-03-15 08:24:25] [INFO ] Deduced a trap composed of 290 places in 301 ms of which 0 ms to minimize.
[2023-03-15 08:24:25] [INFO ] Deduced a trap composed of 296 places in 313 ms of which 13 ms to minimize.
[2023-03-15 08:24:26] [INFO ] Deduced a trap composed of 298 places in 300 ms of which 1 ms to minimize.
[2023-03-15 08:24:26] [INFO ] Deduced a trap composed of 300 places in 296 ms of which 1 ms to minimize.
[2023-03-15 08:24:28] [INFO ] Deduced a trap composed of 304 places in 306 ms of which 0 ms to minimize.
[2023-03-15 08:24:28] [INFO ] Deduced a trap composed of 298 places in 303 ms of which 0 ms to minimize.
[2023-03-15 08:24:29] [INFO ] Deduced a trap composed of 302 places in 312 ms of which 0 ms to minimize.
[2023-03-15 08:24:29] [INFO ] Deduced a trap composed of 298 places in 307 ms of which 1 ms to minimize.
[2023-03-15 08:24:29] [INFO ] Deduced a trap composed of 298 places in 302 ms of which 1 ms to minimize.
[2023-03-15 08:24:30] [INFO ] Deduced a trap composed of 300 places in 305 ms of which 1 ms to minimize.
[2023-03-15 08:24:30] [INFO ] Deduced a trap composed of 298 places in 295 ms of which 0 ms to minimize.
[2023-03-15 08:24:31] [INFO ] Deduced a trap composed of 294 places in 316 ms of which 1 ms to minimize.
[2023-03-15 08:24:31] [INFO ] Deduced a trap composed of 298 places in 309 ms of which 0 ms to minimize.
[2023-03-15 08:24:31] [INFO ] Deduced a trap composed of 296 places in 299 ms of which 1 ms to minimize.
[2023-03-15 08:24:32] [INFO ] Deduced a trap composed of 294 places in 299 ms of which 1 ms to minimize.
[2023-03-15 08:24:32] [INFO ] Deduced a trap composed of 298 places in 308 ms of which 1 ms to minimize.
[2023-03-15 08:24:32] [INFO ] Deduced a trap composed of 300 places in 302 ms of which 0 ms to minimize.
[2023-03-15 08:24:33] [INFO ] Deduced a trap composed of 298 places in 301 ms of which 0 ms to minimize.
[2023-03-15 08:24:33] [INFO ] Deduced a trap composed of 312 places in 299 ms of which 0 ms to minimize.
[2023-03-15 08:24:33] [INFO ] Deduced a trap composed of 298 places in 298 ms of which 1 ms to minimize.
[2023-03-15 08:24:35] [INFO ] Deduced a trap composed of 292 places in 321 ms of which 1 ms to minimize.
[2023-03-15 08:24:35] [INFO ] Deduced a trap composed of 302 places in 315 ms of which 1 ms to minimize.
[2023-03-15 08:24:36] [INFO ] Deduced a trap composed of 298 places in 308 ms of which 1 ms to minimize.
[2023-03-15 08:24:36] [INFO ] Deduced a trap composed of 296 places in 304 ms of which 1 ms to minimize.
[2023-03-15 08:24:38] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 1 ms to minimize.
[2023-03-15 08:24:38] [INFO ] Deduced a trap composed of 294 places in 304 ms of which 0 ms to minimize.
[2023-03-15 08:24:38] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 0 ms to minimize.
[2023-03-15 08:24:39] [INFO ] Deduced a trap composed of 296 places in 301 ms of which 1 ms to minimize.
[2023-03-15 08:24:44] [INFO ] Deduced a trap composed of 290 places in 293 ms of which 1 ms to minimize.
[2023-03-15 08:24:45] [INFO ] Deduced a trap composed of 298 places in 318 ms of which 1 ms to minimize.
[2023-03-15 08:24:45] [INFO ] Deduced a trap composed of 300 places in 280 ms of which 1 ms to minimize.
[2023-03-15 08:24:46] [INFO ] Deduced a trap composed of 294 places in 286 ms of which 1 ms to minimize.
[2023-03-15 08:24:46] [INFO ] Deduced a trap composed of 296 places in 290 ms of which 1 ms to minimize.
[2023-03-15 08:24:46] [INFO ] Deduced a trap composed of 302 places in 289 ms of which 1 ms to minimize.
[2023-03-15 08:24:47] [INFO ] Deduced a trap composed of 304 places in 292 ms of which 0 ms to minimize.
[2023-03-15 08:24:47] [INFO ] Deduced a trap composed of 298 places in 293 ms of which 0 ms to minimize.
[2023-03-15 08:24:47] [INFO ] Deduced a trap composed of 296 places in 284 ms of which 0 ms to minimize.
[2023-03-15 08:24:48] [INFO ] Deduced a trap composed of 286 places in 274 ms of which 0 ms to minimize.
[2023-03-15 08:24:48] [INFO ] Deduced a trap composed of 302 places in 287 ms of which 1 ms to minimize.
[2023-03-15 08:24:50] [INFO ] Deduced a trap composed of 298 places in 278 ms of which 1 ms to minimize.
[2023-03-15 08:24:51] [INFO ] Deduced a trap composed of 300 places in 300 ms of which 1 ms to minimize.
[2023-03-15 08:24:51] [INFO ] Deduced a trap composed of 302 places in 287 ms of which 1 ms to minimize.
[2023-03-15 08:24:51] [INFO ] Deduced a trap composed of 292 places in 291 ms of which 1 ms to minimize.
[2023-03-15 08:24:52] [INFO ] Deduced a trap composed of 298 places in 297 ms of which 1 ms to minimize.
[2023-03-15 08:24:53] [INFO ] Deduced a trap composed of 304 places in 282 ms of which 0 ms to minimize.
[2023-03-15 08:24:54] [INFO ] Deduced a trap composed of 300 places in 293 ms of which 1 ms to minimize.
[2023-03-15 08:24:54] [INFO ] Deduced a trap composed of 302 places in 287 ms of which 1 ms to minimize.
[2023-03-15 08:24:55] [INFO ] Deduced a trap composed of 292 places in 293 ms of which 0 ms to minimize.
[2023-03-15 08:24:55] [INFO ] Deduced a trap composed of 296 places in 290 ms of which 0 ms to minimize.
[2023-03-15 08:24:55] [INFO ] Deduced a trap composed of 294 places in 286 ms of which 1 ms to minimize.
[2023-03-15 08:24:56] [INFO ] Deduced a trap composed of 292 places in 284 ms of which 1 ms to minimize.
[2023-03-15 08:24:56] [INFO ] Deduced a trap composed of 298 places in 296 ms of which 0 ms to minimize.
[2023-03-15 08:24:56] [INFO ] Deduced a trap composed of 304 places in 282 ms of which 1 ms to minimize.
[2023-03-15 08:24:57] [INFO ] Deduced a trap composed of 296 places in 293 ms of which 1 ms to minimize.
[2023-03-15 08:24:57] [INFO ] Deduced a trap composed of 300 places in 282 ms of which 1 ms to minimize.
[2023-03-15 08:24:57] [INFO ] Deduced a trap composed of 294 places in 278 ms of which 1 ms to minimize.
[2023-03-15 08:24:58] [INFO ] Deduced a trap composed of 296 places in 283 ms of which 1 ms to minimize.
[2023-03-15 08:24:58] [INFO ] Deduced a trap composed of 304 places in 296 ms of which 1 ms to minimize.
[2023-03-15 08:24:58] [INFO ] Deduced a trap composed of 298 places in 273 ms of which 1 ms to minimize.
[2023-03-15 08:24:59] [INFO ] Deduced a trap composed of 292 places in 300 ms of which 1 ms to minimize.
[2023-03-15 08:24:59] [INFO ] Deduced a trap composed of 294 places in 292 ms of which 1 ms to minimize.
[2023-03-15 08:24:59] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 0 ms to minimize.
[2023-03-15 08:25:00] [INFO ] Deduced a trap composed of 302 places in 289 ms of which 1 ms to minimize.
[2023-03-15 08:25:00] [INFO ] Deduced a trap composed of 288 places in 299 ms of which 1 ms to minimize.
[2023-03-15 08:25:00] [INFO ] Deduced a trap composed of 282 places in 288 ms of which 1 ms to minimize.
[2023-03-15 08:25:01] [INFO ] Deduced a trap composed of 298 places in 292 ms of which 0 ms to minimize.
[2023-03-15 08:25:01] [INFO ] Deduced a trap composed of 304 places in 289 ms of which 0 ms to minimize.
[2023-03-15 08:25:01] [INFO ] Deduced a trap composed of 300 places in 276 ms of which 1 ms to minimize.
[2023-03-15 08:25:02] [INFO ] Deduced a trap composed of 300 places in 296 ms of which 1 ms to minimize.
[2023-03-15 08:25:02] [INFO ] Deduced a trap composed of 302 places in 293 ms of which 0 ms to minimize.
[2023-03-15 08:25:02] [INFO ] Deduced a trap composed of 294 places in 299 ms of which 0 ms to minimize.
Detected timeout of ITS tools.
[2023-03-15 08:25:56] [INFO ] Flatten gal took : 295 ms
[2023-03-15 08:25:56] [INFO ] Applying decomposition
[2023-03-15 08:25:56] [INFO ] Flatten gal took : 250 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/graph10681926558919420452.txt' '-o' '/tmp/graph10681926558919420452.bin' '-w' '/tmp/graph10681926558919420452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10681926558919420452.bin' '-l' '-1' '-v' '-w' '/tmp/graph10681926558919420452.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:25:57] [INFO ] Decomposing Gal with order
[2023-03-15 08:25:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:25:58] [INFO ] Removed a total of 1841 redundant transitions.
[2023-03-15 08:25:58] [INFO ] Flatten gal took : 637 ms
[2023-03-15 08:25:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 500 labels/synchronizations in 100 ms.
[2023-03-15 08:25:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3104637309259946167.gal : 43 ms
[2023-03-15 08:25:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12920925936882726945.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/ReachabilityCardinality3104637309259946167.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12920925936882726945.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/ReachabilityCardinality12920925936882726945.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 44
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :356 after 357
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :357 after 360
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :360 after 363
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :363 after 778
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :778 after 782
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :782 after 792
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :792 after 804
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :804 after 1366
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3226 after 3239
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3239 after 176588
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :176588 after 487966
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :487966 after 529843
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :529843 after 641299
[2023-03-15 08:27:43] [INFO ] Trap strengthening (SAT) tested/added 140/140 trap constraints in 224452 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 08:27:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 08:27:43] [INFO ] After 225014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 750 transition count 1512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 750 transition count 1511
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 749 transition count 1511
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 749 transition count 1510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 748 transition count 1510
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 748 transition count 1500
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 738 transition count 1500
Applied a total of 33 rules in 148 ms. Remains 738 /750 variables (removed 12) and now considering 1500/1521 (removed 21) transitions.
Running SMT prover for 1 properties.
[2023-03-15 08:27:43] [INFO ] Invariant cache hit.
[2023-03-15 08:27:43] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2023-03-15 08:27:43] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 08:27:43] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 08:27:43] [INFO ] [Nat]Absence check using 95 positive place invariants in 20 ms returned sat
[2023-03-15 08:27:43] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-15 08:27:44] [INFO ] After 858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 08:27:45] [INFO ] Deduced a trap composed of 294 places in 286 ms of which 1 ms to minimize.
[2023-03-15 08:27:45] [INFO ] Deduced a trap composed of 300 places in 334 ms of which 1 ms to minimize.
[2023-03-15 08:27:45] [INFO ] Deduced a trap composed of 300 places in 307 ms of which 0 ms to minimize.
[2023-03-15 08:27:46] [INFO ] Deduced a trap composed of 296 places in 334 ms of which 1 ms to minimize.
[2023-03-15 08:27:46] [INFO ] Deduced a trap composed of 300 places in 291 ms of which 0 ms to minimize.
[2023-03-15 08:27:46] [INFO ] Deduced a trap composed of 302 places in 284 ms of which 0 ms to minimize.
[2023-03-15 08:27:47] [INFO ] Deduced a trap composed of 300 places in 290 ms of which 1 ms to minimize.
[2023-03-15 08:27:47] [INFO ] Deduced a trap composed of 298 places in 285 ms of which 0 ms to minimize.
[2023-03-15 08:27:47] [INFO ] Deduced a trap composed of 306 places in 289 ms of which 0 ms to minimize.
[2023-03-15 08:27:48] [INFO ] Deduced a trap composed of 294 places in 291 ms of which 1 ms to minimize.
[2023-03-15 08:27:48] [INFO ] Deduced a trap composed of 308 places in 289 ms of which 0 ms to minimize.
[2023-03-15 08:27:48] [INFO ] Deduced a trap composed of 298 places in 283 ms of which 0 ms to minimize.
[2023-03-15 08:27:49] [INFO ] Deduced a trap composed of 300 places in 311 ms of which 1 ms to minimize.
[2023-03-15 08:27:49] [INFO ] Deduced a trap composed of 300 places in 298 ms of which 0 ms to minimize.
[2023-03-15 08:27:49] [INFO ] Deduced a trap composed of 298 places in 286 ms of which 0 ms to minimize.
[2023-03-15 08:27:50] [INFO ] Deduced a trap composed of 306 places in 278 ms of which 3 ms to minimize.
[2023-03-15 08:27:50] [INFO ] Deduced a trap composed of 300 places in 281 ms of which 8 ms to minimize.
[2023-03-15 08:27:51] [INFO ] Deduced a trap composed of 292 places in 291 ms of which 1 ms to minimize.
[2023-03-15 08:27:51] [INFO ] Deduced a trap composed of 296 places in 284 ms of which 0 ms to minimize.
[2023-03-15 08:27:51] [INFO ] Deduced a trap composed of 298 places in 288 ms of which 0 ms to minimize.
[2023-03-15 08:27:52] [INFO ] Deduced a trap composed of 288 places in 293 ms of which 1 ms to minimize.
[2023-03-15 08:27:52] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 1 ms to minimize.
[2023-03-15 08:27:52] [INFO ] Deduced a trap composed of 296 places in 291 ms of which 10 ms to minimize.
[2023-03-15 08:27:53] [INFO ] Deduced a trap composed of 302 places in 300 ms of which 0 ms to minimize.
[2023-03-15 08:27:53] [INFO ] Deduced a trap composed of 300 places in 284 ms of which 1 ms to minimize.
[2023-03-15 08:27:53] [INFO ] Deduced a trap composed of 304 places in 291 ms of which 0 ms to minimize.
[2023-03-15 08:27:54] [INFO ] Deduced a trap composed of 302 places in 286 ms of which 1 ms to minimize.
[2023-03-15 08:27:54] [INFO ] Deduced a trap composed of 300 places in 287 ms of which 1 ms to minimize.
[2023-03-15 08:27:54] [INFO ] Deduced a trap composed of 298 places in 283 ms of which 1 ms to minimize.
[2023-03-15 08:27:55] [INFO ] Deduced a trap composed of 298 places in 302 ms of which 0 ms to minimize.
[2023-03-15 08:27:55] [INFO ] Deduced a trap composed of 306 places in 307 ms of which 1 ms to minimize.
[2023-03-15 08:27:55] [INFO ] Deduced a trap composed of 296 places in 279 ms of which 1 ms to minimize.
[2023-03-15 08:27:56] [INFO ] Deduced a trap composed of 300 places in 282 ms of which 2 ms to minimize.
[2023-03-15 08:27:56] [INFO ] Deduced a trap composed of 300 places in 275 ms of which 0 ms to minimize.
[2023-03-15 08:27:56] [INFO ] Deduced a trap composed of 306 places in 287 ms of which 1 ms to minimize.
[2023-03-15 08:27:57] [INFO ] Deduced a trap composed of 304 places in 287 ms of which 0 ms to minimize.
[2023-03-15 08:27:57] [INFO ] Deduced a trap composed of 302 places in 290 ms of which 0 ms to minimize.
[2023-03-15 08:27:57] [INFO ] Deduced a trap composed of 296 places in 293 ms of which 0 ms to minimize.
[2023-03-15 08:27:58] [INFO ] Deduced a trap composed of 294 places in 291 ms of which 0 ms to minimize.
[2023-03-15 08:27:58] [INFO ] Deduced a trap composed of 288 places in 307 ms of which 0 ms to minimize.
[2023-03-15 08:27:58] [INFO ] Deduced a trap composed of 292 places in 285 ms of which 1 ms to minimize.
[2023-03-15 08:27:59] [INFO ] Deduced a trap composed of 302 places in 290 ms of which 0 ms to minimize.
[2023-03-15 08:27:59] [INFO ] Deduced a trap composed of 296 places in 315 ms of which 1 ms to minimize.
[2023-03-15 08:27:59] [INFO ] Deduced a trap composed of 300 places in 289 ms of which 1 ms to minimize.
[2023-03-15 08:28:00] [INFO ] Deduced a trap composed of 300 places in 294 ms of which 0 ms to minimize.
[2023-03-15 08:28:00] [INFO ] Deduced a trap composed of 308 places in 289 ms of which 0 ms to minimize.
[2023-03-15 08:28:00] [INFO ] Deduced a trap composed of 308 places in 295 ms of which 0 ms to minimize.
[2023-03-15 08:28:01] [INFO ] Deduced a trap composed of 302 places in 295 ms of which 1 ms to minimize.
[2023-03-15 08:28:01] [INFO ] Deduced a trap composed of 294 places in 314 ms of which 0 ms to minimize.
[2023-03-15 08:28:01] [INFO ] Deduced a trap composed of 294 places in 299 ms of which 1 ms to minimize.
[2023-03-15 08:28:02] [INFO ] Deduced a trap composed of 296 places in 293 ms of which 1 ms to minimize.
[2023-03-15 08:28:02] [INFO ] Deduced a trap composed of 302 places in 281 ms of which 1 ms to minimize.
[2023-03-15 08:28:02] [INFO ] Deduced a trap composed of 290 places in 292 ms of which 0 ms to minimize.
[2023-03-15 08:28:03] [INFO ] Deduced a trap composed of 296 places in 294 ms of which 1 ms to minimize.
[2023-03-15 08:28:03] [INFO ] Deduced a trap composed of 294 places in 289 ms of which 1 ms to minimize.
[2023-03-15 08:28:03] [INFO ] Deduced a trap composed of 296 places in 296 ms of which 0 ms to minimize.
[2023-03-15 08:28:04] [INFO ] Deduced a trap composed of 306 places in 294 ms of which 0 ms to minimize.
[2023-03-15 08:28:04] [INFO ] Deduced a trap composed of 296 places in 303 ms of which 0 ms to minimize.
[2023-03-15 08:28:06] [INFO ] Deduced a trap composed of 298 places in 291 ms of which 1 ms to minimize.
[2023-03-15 08:28:06] [INFO ] Deduced a trap composed of 306 places in 298 ms of which 1 ms to minimize.
[2023-03-15 08:28:07] [INFO ] Deduced a trap composed of 300 places in 286 ms of which 0 ms to minimize.
[2023-03-15 08:28:07] [INFO ] Deduced a trap composed of 294 places in 297 ms of which 1 ms to minimize.
[2023-03-15 08:28:07] [INFO ] Deduced a trap composed of 290 places in 298 ms of which 1 ms to minimize.
[2023-03-15 08:28:08] [INFO ] Deduced a trap composed of 300 places in 274 ms of which 0 ms to minimize.
[2023-03-15 08:28:08] [INFO ] Deduced a trap composed of 306 places in 289 ms of which 0 ms to minimize.
[2023-03-15 08:28:08] [INFO ] Deduced a trap composed of 304 places in 292 ms of which 1 ms to minimize.
[2023-03-15 08:28:09] [INFO ] Deduced a trap composed of 294 places in 309 ms of which 1 ms to minimize.
[2023-03-15 08:28:09] [INFO ] Deduced a trap composed of 304 places in 280 ms of which 0 ms to minimize.
[2023-03-15 08:28:10] [INFO ] Deduced a trap composed of 294 places in 290 ms of which 1 ms to minimize.
[2023-03-15 08:28:10] [INFO ] Deduced a trap composed of 298 places in 286 ms of which 0 ms to minimize.
[2023-03-15 08:28:10] [INFO ] Deduced a trap composed of 302 places in 277 ms of which 0 ms to minimize.
[2023-03-15 08:28:10] [INFO ] Deduced a trap composed of 302 places in 286 ms of which 1 ms to minimize.
[2023-03-15 08:28:11] [INFO ] Deduced a trap composed of 298 places in 289 ms of which 0 ms to minimize.
[2023-03-15 08:28:11] [INFO ] Deduced a trap composed of 300 places in 297 ms of which 1 ms to minimize.
[2023-03-15 08:28:12] [INFO ] Deduced a trap composed of 306 places in 283 ms of which 1 ms to minimize.
[2023-03-15 08:28:13] [INFO ] Deduced a trap composed of 306 places in 314 ms of which 1 ms to minimize.
[2023-03-15 08:28:18] [INFO ] Deduced a trap composed of 296 places in 299 ms of which 1 ms to minimize.
[2023-03-15 08:28:18] [INFO ] Deduced a trap composed of 294 places in 295 ms of which 0 ms to minimize.
[2023-03-15 08:28:18] [INFO ] Deduced a trap composed of 302 places in 297 ms of which 0 ms to minimize.
[2023-03-15 08:28:19] [INFO ] Deduced a trap composed of 294 places in 294 ms of which 1 ms to minimize.
[2023-03-15 08:28:19] [INFO ] Deduced a trap composed of 298 places in 289 ms of which 0 ms to minimize.
[2023-03-15 08:28:19] [INFO ] Deduced a trap composed of 304 places in 287 ms of which 1 ms to minimize.
[2023-03-15 08:28:20] [INFO ] Deduced a trap composed of 296 places in 290 ms of which 1 ms to minimize.
[2023-03-15 08:28:20] [INFO ] Deduced a trap composed of 290 places in 288 ms of which 0 ms to minimize.
[2023-03-15 08:28:20] [INFO ] Deduced a trap composed of 298 places in 303 ms of which 1 ms to minimize.
[2023-03-15 08:28:21] [INFO ] Deduced a trap composed of 298 places in 275 ms of which 1 ms to minimize.
[2023-03-15 08:28:21] [INFO ] Deduced a trap composed of 296 places in 285 ms of which 1 ms to minimize.
[2023-03-15 08:28:21] [INFO ] Deduced a trap composed of 306 places in 293 ms of which 1 ms to minimize.
[2023-03-15 08:28:22] [INFO ] Deduced a trap composed of 298 places in 281 ms of which 1 ms to minimize.
[2023-03-15 08:28:22] [INFO ] Deduced a trap composed of 294 places in 285 ms of which 1 ms to minimize.
[2023-03-15 08:28:24] [INFO ] Deduced a trap composed of 298 places in 291 ms of which 1 ms to minimize.
[2023-03-15 08:28:26] [INFO ] Deduced a trap composed of 294 places in 321 ms of which 1 ms to minimize.
[2023-03-15 08:28:26] [INFO ] Deduced a trap composed of 296 places in 281 ms of which 1 ms to minimize.
[2023-03-15 08:28:26] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 1 ms to minimize.
[2023-03-15 08:28:27] [INFO ] Deduced a trap composed of 288 places in 296 ms of which 0 ms to minimize.
[2023-03-15 08:28:27] [INFO ] Deduced a trap composed of 304 places in 289 ms of which 1 ms to minimize.
[2023-03-15 08:28:28] [INFO ] Deduced a trap composed of 290 places in 291 ms of which 1 ms to minimize.
[2023-03-15 08:28:28] [INFO ] Deduced a trap composed of 296 places in 286 ms of which 0 ms to minimize.
[2023-03-15 08:28:28] [INFO ] Deduced a trap composed of 296 places in 284 ms of which 1 ms to minimize.
[2023-03-15 08:28:29] [INFO ] Deduced a trap composed of 298 places in 292 ms of which 13 ms to minimize.
[2023-03-15 08:28:29] [INFO ] Deduced a trap composed of 304 places in 300 ms of which 1 ms to minimize.
[2023-03-15 08:28:29] [INFO ] Deduced a trap composed of 294 places in 299 ms of which 1 ms to minimize.
[2023-03-15 08:28:30] [INFO ] Deduced a trap composed of 294 places in 353 ms of which 0 ms to minimize.
[2023-03-15 08:28:30] [INFO ] Deduced a trap composed of 288 places in 273 ms of which 1 ms to minimize.
[2023-03-15 08:28:31] [INFO ] Deduced a trap composed of 298 places in 310 ms of which 0 ms to minimize.
[2023-03-15 08:28:31] [INFO ] Deduced a trap composed of 302 places in 287 ms of which 0 ms to minimize.
[2023-03-15 08:28:31] [INFO ] Deduced a trap composed of 296 places in 293 ms of which 0 ms to minimize.
[2023-03-15 08:28:32] [INFO ] Deduced a trap composed of 300 places in 291 ms of which 0 ms to minimize.
[2023-03-15 08:28:32] [INFO ] Deduced a trap composed of 302 places in 272 ms of which 1 ms to minimize.
[2023-03-15 08:28:32] [INFO ] Deduced a trap composed of 300 places in 289 ms of which 0 ms to minimize.
[2023-03-15 08:28:33] [INFO ] Deduced a trap composed of 302 places in 281 ms of which 1 ms to minimize.
[2023-03-15 08:28:33] [INFO ] Deduced a trap composed of 304 places in 311 ms of which 0 ms to minimize.
[2023-03-15 08:28:33] [INFO ] Deduced a trap composed of 312 places in 291 ms of which 1 ms to minimize.
[2023-03-15 08:28:34] [INFO ] Deduced a trap composed of 298 places in 289 ms of which 1 ms to minimize.
[2023-03-15 08:28:34] [INFO ] Deduced a trap composed of 296 places in 294 ms of which 1 ms to minimize.
[2023-03-15 08:28:34] [INFO ] Deduced a trap composed of 306 places in 298 ms of which 0 ms to minimize.
[2023-03-15 08:28:35] [INFO ] Deduced a trap composed of 294 places in 300 ms of which 1 ms to minimize.
[2023-03-15 08:28:35] [INFO ] Deduced a trap composed of 300 places in 293 ms of which 0 ms to minimize.
[2023-03-15 08:28:35] [INFO ] Deduced a trap composed of 290 places in 284 ms of which 1 ms to minimize.
[2023-03-15 08:28:36] [INFO ] Deduced a trap composed of 300 places in 281 ms of which 0 ms to minimize.
[2023-03-15 08:28:36] [INFO ] Deduced a trap composed of 296 places in 307 ms of which 1 ms to minimize.
[2023-03-15 08:28:36] [INFO ] Deduced a trap composed of 304 places in 290 ms of which 0 ms to minimize.
[2023-03-15 08:28:37] [INFO ] Deduced a trap composed of 300 places in 291 ms of which 0 ms to minimize.
[2023-03-15 08:28:37] [INFO ] Deduced a trap composed of 300 places in 287 ms of which 0 ms to minimize.
[2023-03-15 08:28:37] [INFO ] Deduced a trap composed of 306 places in 291 ms of which 1 ms to minimize.
[2023-03-15 08:28:38] [INFO ] Deduced a trap composed of 296 places in 293 ms of which 1 ms to minimize.
[2023-03-15 08:28:38] [INFO ] Deduced a trap composed of 298 places in 290 ms of which 1 ms to minimize.
[2023-03-15 08:28:38] [INFO ] Deduced a trap composed of 298 places in 289 ms of which 0 ms to minimize.
[2023-03-15 08:28:39] [INFO ] Deduced a trap composed of 294 places in 279 ms of which 1 ms to minimize.
[2023-03-15 08:28:39] [INFO ] Deduced a trap composed of 304 places in 318 ms of which 1 ms to minimize.
[2023-03-15 08:28:39] [INFO ] Deduced a trap composed of 294 places in 298 ms of which 1 ms to minimize.
[2023-03-15 08:28:40] [INFO ] Deduced a trap composed of 300 places in 282 ms of which 1 ms to minimize.
[2023-03-15 08:28:40] [INFO ] Deduced a trap composed of 298 places in 297 ms of which 1 ms to minimize.
[2023-03-15 08:28:40] [INFO ] Deduced a trap composed of 298 places in 289 ms of which 1 ms to minimize.
[2023-03-15 08:28:41] [INFO ] Deduced a trap composed of 304 places in 289 ms of which 0 ms to minimize.
[2023-03-15 08:28:41] [INFO ] Deduced a trap composed of 292 places in 302 ms of which 0 ms to minimize.
[2023-03-15 08:28:41] [INFO ] Deduced a trap composed of 288 places in 295 ms of which 0 ms to minimize.
[2023-03-15 08:28:42] [INFO ] Deduced a trap composed of 296 places in 298 ms of which 1 ms to minimize.
[2023-03-15 08:28:42] [INFO ] Deduced a trap composed of 296 places in 289 ms of which 0 ms to minimize.
[2023-03-15 08:28:42] [INFO ] Deduced a trap composed of 300 places in 337 ms of which 1 ms to minimize.
[2023-03-15 08:28:43] [INFO ] Deduced a trap composed of 296 places in 316 ms of which 0 ms to minimize.
[2023-03-15 08:28:43] [INFO ] Deduced a trap composed of 298 places in 287 ms of which 1 ms to minimize.
[2023-03-15 08:28:43] [INFO ] Deduced a trap composed of 296 places in 299 ms of which 1 ms to minimize.
[2023-03-15 08:28:44] [INFO ] Deduced a trap composed of 298 places in 333 ms of which 1 ms to minimize.
[2023-03-15 08:28:44] [INFO ] Deduced a trap composed of 304 places in 292 ms of which 0 ms to minimize.
[2023-03-15 08:28:45] [INFO ] Deduced a trap composed of 292 places in 317 ms of which 1 ms to minimize.
[2023-03-15 08:28:45] [INFO ] Deduced a trap composed of 292 places in 313 ms of which 1 ms to minimize.
[2023-03-15 08:28:45] [INFO ] Deduced a trap composed of 300 places in 305 ms of which 1 ms to minimize.
[2023-03-15 08:28:46] [INFO ] Deduced a trap composed of 298 places in 327 ms of which 1 ms to minimize.
[2023-03-15 08:28:46] [INFO ] Deduced a trap composed of 302 places in 290 ms of which 0 ms to minimize.
[2023-03-15 08:28:46] [INFO ] Deduced a trap composed of 302 places in 274 ms of which 1 ms to minimize.
[2023-03-15 08:28:47] [INFO ] Deduced a trap composed of 300 places in 284 ms of which 1 ms to minimize.
[2023-03-15 08:28:47] [INFO ] Deduced a trap composed of 304 places in 286 ms of which 0 ms to minimize.
[2023-03-15 08:28:47] [INFO ] Deduced a trap composed of 296 places in 285 ms of which 0 ms to minimize.
[2023-03-15 08:28:48] [INFO ] Deduced a trap composed of 296 places in 294 ms of which 0 ms to minimize.
[2023-03-15 08:28:49] [INFO ] Deduced a trap composed of 294 places in 293 ms of which 1 ms to minimize.
[2023-03-15 08:28:50] [INFO ] Deduced a trap composed of 300 places in 295 ms of which 0 ms to minimize.
[2023-03-15 08:28:50] [INFO ] Deduced a trap composed of 296 places in 286 ms of which 1 ms to minimize.
[2023-03-15 08:28:51] [INFO ] Deduced a trap composed of 300 places in 289 ms of which 0 ms to minimize.
[2023-03-15 08:29:00] [INFO ] Trap strengthening (SAT) tested/added 159/159 trap constraints in 75654 ms
[2023-03-15 08:29:00] [INFO ] After 77101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:29:00] [INFO ] After 77315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-15 08:29:01] [INFO ] Flatten gal took : 94 ms
[2023-03-15 08:29:01] [INFO ] Flatten gal took : 94 ms
[2023-03-15 08:29:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4925719080473034696.gal : 11 ms
[2023-03-15 08:29:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6960984728683811597.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/ReachabilityCardinality4925719080473034696.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6960984728683811597.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/ReachabilityCardinality6960984728683811597.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :22 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 28
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :28 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 32
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :32 after 36
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :36 after 42
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :42 after 56
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :56 after 1827
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1827 after 1882
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1882 after 2271
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2271 after 2458
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2458 after 2971
Detected timeout of ITS tools.
[2023-03-15 08:29:16] [INFO ] Flatten gal took : 57 ms
[2023-03-15 08:29:16] [INFO ] Applying decomposition
[2023-03-15 08:29:16] [INFO ] Flatten gal took : 57 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/graph8072477463964438150.txt' '-o' '/tmp/graph8072477463964438150.bin' '-w' '/tmp/graph8072477463964438150.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8072477463964438150.bin' '-l' '-1' '-v' '-w' '/tmp/graph8072477463964438150.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:29:16] [INFO ] Decomposing Gal with order
[2023-03-15 08:29:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:29:17] [INFO ] Removed a total of 1713 redundant transitions.
[2023-03-15 08:29:17] [INFO ] Flatten gal took : 385 ms
[2023-03-15 08:29:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 717 labels/synchronizations in 130 ms.
[2023-03-15 08:29:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3129304253105288925.gal : 32 ms
[2023-03-15 08:29:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10886347859687310224.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/ReachabilityCardinality3129304253105288925.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10886347859687310224.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/ReachabilityCardinality10886347859687310224.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12176823813278049114
[2023-03-15 08:29:32] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12176823813278049114
Running compilation step : cd /tmp/ltsmin12176823813278049114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12176823813278049114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12176823813278049114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 08:29:35] [INFO ] Flatten gal took : 72 ms
[2023-03-15 08:29:35] [INFO ] Flatten gal took : 60 ms
[2023-03-15 08:29:35] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability242833715794427028.gal : 11 ms
[2023-03-15 08:29:35] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15105831321069550231.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/ReachabilityFireability242833715794427028.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15105831321069550231.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/ReachabilityFireability15105831321069550231.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 32
Detected timeout of ITS tools.
[2023-03-15 08:29:38] [INFO ] Flatten gal took : 57 ms
[2023-03-15 08:29:38] [INFO ] Applying decomposition
[2023-03-15 08:29:38] [INFO ] Flatten gal took : 54 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/graph1125180538948154769.txt' '-o' '/tmp/graph1125180538948154769.bin' '-w' '/tmp/graph1125180538948154769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1125180538948154769.bin' '-l' '-1' '-v' '-w' '/tmp/graph1125180538948154769.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:29:38] [INFO ] Decomposing Gal with order
[2023-03-15 08:29:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:29:39] [INFO ] Removed a total of 3402 redundant transitions.
[2023-03-15 08:29:39] [INFO ] Flatten gal took : 134 ms
[2023-03-15 08:29:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 423 labels/synchronizations in 103 ms.
[2023-03-15 08:29:39] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11729584901484909468.gal : 10 ms
[2023-03-15 08:29:39] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17654922915434931797.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/ReachabilityFireability11729584901484909468.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17654922915434931797.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 ...309
Loading property file /tmp/ReachabilityFireability17654922915434931797.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8204076733960479701
[2023-03-15 08:29:42] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8204076733960479701
Running compilation step : cd /tmp/ltsmin8204076733960479701;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8204076733960479701;'/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' killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8204076733960479701;'/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' killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 08:29:44] [INFO ] Flatten gal took : 94 ms
[2023-03-15 08:29:44] [INFO ] Flatten gal took : 57 ms
[2023-03-15 08:29:44] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15190074465794756669.gal : 10 ms
[2023-03-15 08:29:44] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1324584065752783785.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/ReachabilityFireability15190074465794756669.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1324584065752783785.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/ReachabilityFireability1324584065752783785.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 32
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :32 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 1149
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1149 after 1707
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1707 after 2025
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2025 after 7569
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7569 after 33332
Detected timeout of ITS tools.
[2023-03-15 08:30:14] [INFO ] Flatten gal took : 55 ms
[2023-03-15 08:30:14] [INFO ] Applying decomposition
[2023-03-15 08:30:14] [INFO ] Flatten gal took : 57 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/graph6730696914570102720.txt' '-o' '/tmp/graph6730696914570102720.bin' '-w' '/tmp/graph6730696914570102720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6730696914570102720.bin' '-l' '-1' '-v' '-w' '/tmp/graph6730696914570102720.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:30:14] [INFO ] Decomposing Gal with order
[2023-03-15 08:30:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:30:15] [INFO ] Removed a total of 3400 redundant transitions.
[2023-03-15 08:30:15] [INFO ] Flatten gal took : 201 ms
[2023-03-15 08:30:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 423 labels/synchronizations in 63 ms.
[2023-03-15 08:30:15] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability18333781867347431735.gal : 44 ms
[2023-03-15 08:30:15] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4402186504385963307.prop : 43 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/ReachabilityFireability18333781867347431735.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4402186504385963307.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/ReachabilityFireability4402186504385963307.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1238316982288609809
[2023-03-15 08:30:45] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1238316982288609809
Running compilation step : cd /tmp/ltsmin1238316982288609809;'/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 3172 ms.
Running link step : cd /tmp/ltsmin1238316982288609809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin1238316982288609809;'/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:31:15] [INFO ] Flatten gal took : 58 ms
[2023-03-15 08:31:15] [INFO ] Flatten gal took : 61 ms
[2023-03-15 08:31:15] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10772076762595223516.gal : 9 ms
[2023-03-15 08:31:15] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7205661296681107546.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/ReachabilityFireability10772076762595223516.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7205661296681107546.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/ReachabilityFireability7205661296681107546.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 32
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :32 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 1149
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1149 after 1707
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1707 after 2025
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2025 after 7569
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7569 after 33332
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :33332 after 95779
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :95779 after 197441
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :197441 after 514794
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :514794 after 1.08327e+06
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-15 08:36:16] [INFO ] Flatten gal took : 153 ms
[2023-03-15 08:36:16] [INFO ] Applying decomposition
[2023-03-15 08:36:16] [INFO ] Flatten gal took : 66 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/graph17474421910673615942.txt' '-o' '/tmp/graph17474421910673615942.bin' '-w' '/tmp/graph17474421910673615942.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17474421910673615942.bin' '-l' '-1' '-v' '-w' '/tmp/graph17474421910673615942.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:36:17] [INFO ] Decomposing Gal with order
[2023-03-15 08:36:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:36:17] [INFO ] Removed a total of 3400 redundant transitions.
[2023-03-15 08:36:17] [INFO ] Flatten gal took : 149 ms
[2023-03-15 08:36:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 419 labels/synchronizations in 38 ms.
[2023-03-15 08:36:17] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14828968054586416265.gal : 17 ms
[2023-03-15 08:36:17] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15258462073346589460.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/ReachabilityFireability14828968054586416265.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15258462073346589460.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 ...309
Loading property file /tmp/ReachabilityFireability15258462073346589460.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6029912803497006993
[2023-03-15 08:41:17] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6029912803497006993
Running compilation step : cd /tmp/ltsmin6029912803497006993;'/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 3276 ms.
Running link step : cd /tmp/ltsmin6029912803497006993;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin6029912803497006993;'/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'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.070: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.070: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.072: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.072: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.080: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.072: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.081: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.082: There are 1522 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.082: State length is 750, there are 1521 groups
pins2lts-mc-linux64( 0/ 8), 0.082: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.082: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.082: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.082: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.074: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 3.791: ~5 levels ~960 states ~7816 transitions
pins2lts-mc-linux64( 0/ 8), 3.876: ~6 levels ~1920 states ~13952 transitions
pins2lts-mc-linux64( 0/ 8), 4.138: ~7 levels ~3840 states ~49600 transitions
pins2lts-mc-linux64( 6/ 8), 4.405: ~8 levels ~7680 states ~59792 transitions
pins2lts-mc-linux64( 6/ 8), 4.860: ~8 levels ~15360 states ~123080 transitions
pins2lts-mc-linux64( 6/ 8), 5.670: ~9 levels ~30720 states ~240744 transitions
pins2lts-mc-linux64( 6/ 8), 7.039: ~9 levels ~61440 states ~468720 transitions
pins2lts-mc-linux64( 6/ 8), 9.560: ~10 levels ~122880 states ~876424 transitions
pins2lts-mc-linux64( 6/ 8), 14.345: ~11 levels ~245760 states ~1614560 transitions
pins2lts-mc-linux64( 6/ 8), 24.503: ~14 levels ~491520 states ~2773424 transitions
pins2lts-mc-linux64( 7/ 8), 45.922: ~5 levels ~983040 states ~11338304 transitions
pins2lts-mc-linux64( 1/ 8), 92.374: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 93.489:
pins2lts-mc-linux64( 0/ 8), 93.489: mean standard work distribution: 11.2% (states) 34.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 93.489:
pins2lts-mc-linux64( 0/ 8), 93.489: Explored 1625988 states 46549382 transitions, fanout: 28.628
pins2lts-mc-linux64( 0/ 8), 93.489: Total exploration time 93.410 sec (92.300 sec minimum, 92.835 sec on average)
pins2lts-mc-linux64( 0/ 8), 93.489: States per second: 17407, Transitions per second: 498334
pins2lts-mc-linux64( 0/ 8), 93.489:
pins2lts-mc-linux64( 0/ 8), 93.489: Queue width: 8B, total height: 16252048, memory: 123.99MB
pins2lts-mc-linux64( 0/ 8), 93.489: Tree memory: 392.4MB, 23.0 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 93.489: Tree fill ratio (roots/leafs): 13.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 93.489: Stored 1551 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 93.489: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 93.489: Est. total memory use: 516.4MB (~1148.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6029912803497006993;'/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'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6029912803497006993;'/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'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 08:42:55] [INFO ] Flatten gal took : 54 ms
[2023-03-15 08:42:55] [INFO ] Flatten gal took : 54 ms
[2023-03-15 08:42:55] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4394397466037200426.gal : 8 ms
[2023-03-15 08:42:55] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7041677380289629602.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/ReachabilityFireability4394397466037200426.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7041677380289629602.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/ReachabilityFireability7041677380289629602.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 32
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :32 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 1149
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1149 after 1707
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1707 after 2025
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2025 after 7569
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7569 after 33332
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :33332 after 95779
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :95779 after 197441
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :197441 after 514794
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 12478556 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16209864 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-S10J40"
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-S10J40, 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-167873961400432"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J40.tgz
mv PolyORBNT-COL-S10J40 execution
cd execution
if [ "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 ;