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.r394-oct2-167903718000505.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldPPPs-PT-050B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718000505
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 888K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-050B-CTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-050B-CTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-050B-CTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-050B-CTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-050B-CTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-050B-CTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-050B-CTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-050B-CTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-050B-CTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-050B-CTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-050B-CTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-050B-CTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-050B-CTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-050B-CTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-050B-CTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-050B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679520292773

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 21:24:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 21:24:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 21:24:55] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2023-03-22 21:24:55] [INFO ] Transformed 3403 places.
[2023-03-22 21:24:55] [INFO ] Transformed 3153 transitions.
[2023-03-22 21:24:55] [INFO ] Found NUPN structural information;
[2023-03-22 21:24:55] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 497 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
FORMULA ShieldPPPs-PT-050B-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 93 out of 3403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Discarding 331 places :
Symmetric choice reduction at 0 with 331 rule applications. Total rules 331 place count 3072 transition count 2822
Iterating global reduction 0 with 331 rules applied. Total rules applied 662 place count 3072 transition count 2822
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 663 place count 3071 transition count 2821
Iterating global reduction 0 with 1 rules applied. Total rules applied 664 place count 3071 transition count 2821
Applied a total of 664 rules in 1355 ms. Remains 3071 /3403 variables (removed 332) and now considering 2821/3153 (removed 332) transitions.
// Phase 1: matrix 2821 rows 3071 cols
[2023-03-22 21:24:57] [INFO ] Computed 551 place invariants in 52 ms
[2023-03-22 21:25:00] [INFO ] Implicit Places using invariants in 3276 ms returned []
[2023-03-22 21:25:00] [INFO ] Invariant cache hit.
[2023-03-22 21:25:06] [INFO ] Implicit Places using invariants and state equation in 6067 ms returned []
Implicit Place search using SMT with State Equation took 9428 ms to find 0 implicit places.
[2023-03-22 21:25:06] [INFO ] Invariant cache hit.
[2023-03-22 21:25:11] [INFO ] Dead Transitions using invariants and state equation in 4397 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3071/3403 places, 2821/3153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15200 ms. Remains : 3071/3403 places, 2821/3153 transitions.
Support contains 93 out of 3071 places after structural reductions.
[2023-03-22 21:25:11] [INFO ] Flatten gal took : 201 ms
[2023-03-22 21:25:11] [INFO ] Flatten gal took : 125 ms
[2023-03-22 21:25:12] [INFO ] Input system was already deterministic with 2821 transitions.
Support contains 81 out of 3071 places (down from 93) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 667 ms. (steps per millisecond=14 ) properties (out of 49) seen :32
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-22 21:25:12] [INFO ] Invariant cache hit.
[2023-03-22 21:25:14] [INFO ] [Real]Absence check using 551 positive place invariants in 389 ms returned sat
[2023-03-22 21:25:15] [INFO ] After 2100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-22 21:25:17] [INFO ] [Nat]Absence check using 551 positive place invariants in 461 ms returned sat
[2023-03-22 21:25:23] [INFO ] After 4601ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-22 21:25:24] [INFO ] Deduced a trap composed of 16 places in 1019 ms of which 7 ms to minimize.
[2023-03-22 21:25:25] [INFO ] Deduced a trap composed of 21 places in 1220 ms of which 4 ms to minimize.
[2023-03-22 21:25:26] [INFO ] Deduced a trap composed of 17 places in 1051 ms of which 2 ms to minimize.
[2023-03-22 21:25:28] [INFO ] Deduced a trap composed of 24 places in 1306 ms of which 15 ms to minimize.
[2023-03-22 21:25:29] [INFO ] Deduced a trap composed of 22 places in 1165 ms of which 15 ms to minimize.
[2023-03-22 21:25:30] [INFO ] Deduced a trap composed of 20 places in 910 ms of which 3 ms to minimize.
[2023-03-22 21:25:31] [INFO ] Deduced a trap composed of 22 places in 1029 ms of which 3 ms to minimize.
[2023-03-22 21:25:32] [INFO ] Deduced a trap composed of 25 places in 944 ms of which 2 ms to minimize.
[2023-03-22 21:25:33] [INFO ] Deduced a trap composed of 20 places in 998 ms of which 2 ms to minimize.
[2023-03-22 21:25:34] [INFO ] Deduced a trap composed of 26 places in 828 ms of which 1 ms to minimize.
[2023-03-22 21:25:35] [INFO ] Deduced a trap composed of 21 places in 1026 ms of which 1 ms to minimize.
[2023-03-22 21:25:37] [INFO ] Deduced a trap composed of 19 places in 1105 ms of which 2 ms to minimize.
[2023-03-22 21:25:38] [INFO ] Deduced a trap composed of 25 places in 1303 ms of which 3 ms to minimize.
[2023-03-22 21:25:40] [INFO ] Deduced a trap composed of 19 places in 1393 ms of which 23 ms to minimize.
[2023-03-22 21:25:40] [INFO ] Trap strengthening (SAT) tested/added 14/14 trap constraints in 17067 ms
[2023-03-22 21:25:40] [INFO ] After 21676ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-22 21:25:40] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 3080 ms.
Support contains 30 out of 3071 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3071/3071 places, 2821/2821 transitions.
Drop transitions removed 346 transitions
Trivial Post-agglo rules discarded 346 transitions
Performed 346 trivial Post agglomeration. Transition count delta: 346
Iterating post reduction 0 with 346 rules applied. Total rules applied 346 place count 3071 transition count 2475
Reduce places removed 346 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 347 rules applied. Total rules applied 693 place count 2725 transition count 2474
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 694 place count 2724 transition count 2474
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 694 place count 2724 transition count 2226
Deduced a syphon composed of 248 places in 7 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 1190 place count 2476 transition count 2226
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1203 place count 2463 transition count 2213
Iterating global reduction 3 with 13 rules applied. Total rules applied 1216 place count 2463 transition count 2213
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1216 place count 2463 transition count 2205
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1232 place count 2455 transition count 2205
Performed 876 Post agglomeration using F-continuation condition.Transition count delta: 876
Deduced a syphon composed of 876 places in 7 ms
Reduce places removed 876 places and 0 transitions.
Iterating global reduction 3 with 1752 rules applied. Total rules applied 2984 place count 1579 transition count 1329
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 436 times.
Drop transitions removed 436 transitions
Iterating global reduction 3 with 436 rules applied. Total rules applied 3420 place count 1579 transition count 1329
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3421 place count 1578 transition count 1328
Applied a total of 3421 rules in 895 ms. Remains 1578 /3071 variables (removed 1493) and now considering 1328/2821 (removed 1493) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 895 ms. Remains : 1578/3071 places, 1328/2821 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 17) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1328 rows 1578 cols
[2023-03-22 21:25:44] [INFO ] Computed 551 place invariants in 82 ms
[2023-03-22 21:25:45] [INFO ] [Real]Absence check using 520 positive place invariants in 219 ms returned sat
[2023-03-22 21:25:45] [INFO ] [Real]Absence check using 520 positive and 31 generalized place invariants in 8 ms returned sat
[2023-03-22 21:25:45] [INFO ] After 648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 21:25:46] [INFO ] [Nat]Absence check using 520 positive place invariants in 127 ms returned sat
[2023-03-22 21:25:46] [INFO ] [Nat]Absence check using 520 positive and 31 generalized place invariants in 8 ms returned sat
[2023-03-22 21:25:47] [INFO ] After 1180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 21:25:47] [INFO ] Deduced a trap composed of 5 places in 315 ms of which 1 ms to minimize.
[2023-03-22 21:25:48] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 0 ms to minimize.
[2023-03-22 21:25:48] [INFO ] Deduced a trap composed of 6 places in 343 ms of which 1 ms to minimize.
[2023-03-22 21:25:48] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 0 ms to minimize.
[2023-03-22 21:25:49] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 1 ms to minimize.
[2023-03-22 21:25:49] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 0 ms to minimize.
[2023-03-22 21:25:49] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 1 ms to minimize.
[2023-03-22 21:25:50] [INFO ] Deduced a trap composed of 5 places in 342 ms of which 0 ms to minimize.
[2023-03-22 21:25:50] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 16 ms to minimize.
[2023-03-22 21:25:50] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 0 ms to minimize.
[2023-03-22 21:25:51] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 1 ms to minimize.
[2023-03-22 21:25:51] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 1 ms to minimize.
[2023-03-22 21:25:52] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 1 ms to minimize.
[2023-03-22 21:25:52] [INFO ] Deduced a trap composed of 5 places in 554 ms of which 1 ms to minimize.
[2023-03-22 21:25:53] [INFO ] Deduced a trap composed of 9 places in 310 ms of which 1 ms to minimize.
[2023-03-22 21:25:53] [INFO ] Deduced a trap composed of 4 places in 543 ms of which 1 ms to minimize.
[2023-03-22 21:25:54] [INFO ] Deduced a trap composed of 8 places in 967 ms of which 1 ms to minimize.
[2023-03-22 21:25:55] [INFO ] Deduced a trap composed of 5 places in 560 ms of which 1 ms to minimize.
[2023-03-22 21:25:55] [INFO ] Deduced a trap composed of 3 places in 456 ms of which 0 ms to minimize.
[2023-03-22 21:25:56] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 1 ms to minimize.
[2023-03-22 21:25:56] [INFO ] Deduced a trap composed of 6 places in 454 ms of which 1 ms to minimize.
[2023-03-22 21:25:57] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 0 ms to minimize.
[2023-03-22 21:25:57] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 0 ms to minimize.
[2023-03-22 21:25:57] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 1 ms to minimize.
[2023-03-22 21:25:58] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 15 ms to minimize.
[2023-03-22 21:25:58] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 1 ms to minimize.
[2023-03-22 21:25:58] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 1 ms to minimize.
[2023-03-22 21:25:58] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 1 ms to minimize.
[2023-03-22 21:25:59] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 0 ms to minimize.
[2023-03-22 21:25:59] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 1 ms to minimize.
[2023-03-22 21:26:00] [INFO ] Deduced a trap composed of 6 places in 419 ms of which 0 ms to minimize.
[2023-03-22 21:26:00] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 1 ms to minimize.
[2023-03-22 21:26:00] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 1 ms to minimize.
[2023-03-22 21:26:01] [INFO ] Deduced a trap composed of 6 places in 405 ms of which 1 ms to minimize.
[2023-03-22 21:26:01] [INFO ] Deduced a trap composed of 6 places in 506 ms of which 1 ms to minimize.
[2023-03-22 21:26:02] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 1 ms to minimize.
[2023-03-22 21:26:02] [INFO ] Deduced a trap composed of 7 places in 256 ms of which 12 ms to minimize.
[2023-03-22 21:26:02] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 1 ms to minimize.
[2023-03-22 21:26:02] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 1 ms to minimize.
[2023-03-22 21:26:03] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 0 ms to minimize.
[2023-03-22 21:26:03] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 0 ms to minimize.
[2023-03-22 21:26:03] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 15 ms to minimize.
[2023-03-22 21:26:04] [INFO ] Deduced a trap composed of 6 places in 346 ms of which 1 ms to minimize.
[2023-03-22 21:26:04] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 0 ms to minimize.
[2023-03-22 21:26:04] [INFO ] Deduced a trap composed of 5 places in 327 ms of which 1 ms to minimize.
[2023-03-22 21:26:05] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 1 ms to minimize.
[2023-03-22 21:26:05] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 0 ms to minimize.
[2023-03-22 21:26:05] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 1 ms to minimize.
[2023-03-22 21:26:05] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 1 ms to minimize.
[2023-03-22 21:26:06] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 14 ms to minimize.
[2023-03-22 21:26:06] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 1 ms to minimize.
[2023-03-22 21:26:06] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 1 ms to minimize.
[2023-03-22 21:26:06] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 2 ms to minimize.
[2023-03-22 21:26:07] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 14 ms to minimize.
[2023-03-22 21:26:07] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 0 ms to minimize.
[2023-03-22 21:26:07] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 1 ms to minimize.
[2023-03-22 21:26:08] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 0 ms to minimize.
[2023-03-22 21:26:08] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 20799 ms
[2023-03-22 21:26:08] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 3 ms to minimize.
[2023-03-22 21:26:08] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 0 ms to minimize.
[2023-03-22 21:26:09] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 0 ms to minimize.
[2023-03-22 21:26:09] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 0 ms to minimize.
[2023-03-22 21:26:09] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2023-03-22 21:26:10] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 1 ms to minimize.
[2023-03-22 21:26:10] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
[2023-03-22 21:26:10] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 21:26:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 21:26:10] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 230 ms.
Support contains 11 out of 1578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1578/1578 places, 1328/1328 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1578 transition count 1326
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1576 transition count 1326
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 1576 transition count 1325
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1575 transition count 1325
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 30 place count 1563 transition count 1313
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 1560 transition count 1310
Applied a total of 33 rules in 159 ms. Remains 1560 /1578 variables (removed 18) and now considering 1310/1328 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 1560/1578 places, 1310/1328 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1310 rows 1560 cols
[2023-03-22 21:26:11] [INFO ] Computed 551 place invariants in 32 ms
[2023-03-22 21:26:12] [INFO ] [Real]Absence check using 526 positive place invariants in 153 ms returned sat
[2023-03-22 21:26:12] [INFO ] [Real]Absence check using 526 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-22 21:26:12] [INFO ] After 1315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 21:26:13] [INFO ] [Nat]Absence check using 526 positive place invariants in 256 ms returned sat
[2023-03-22 21:26:13] [INFO ] [Nat]Absence check using 526 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-22 21:26:15] [INFO ] After 1399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 21:26:15] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 1 ms to minimize.
[2023-03-22 21:26:15] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2023-03-22 21:26:15] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2023-03-22 21:26:15] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 0 ms to minimize.
[2023-03-22 21:26:16] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2023-03-22 21:26:16] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2023-03-22 21:26:16] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 1 ms to minimize.
[2023-03-22 21:26:16] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 0 ms to minimize.
[2023-03-22 21:26:16] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2023-03-22 21:26:17] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-22 21:26:17] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2023-03-22 21:26:17] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 0 ms to minimize.
[2023-03-22 21:26:17] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2023-03-22 21:26:18] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 0 ms to minimize.
[2023-03-22 21:26:18] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2023-03-22 21:26:18] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 0 ms to minimize.
[2023-03-22 21:26:19] [INFO ] Deduced a trap composed of 14 places in 305 ms of which 1 ms to minimize.
[2023-03-22 21:26:19] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2023-03-22 21:26:19] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2023-03-22 21:26:19] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2023-03-22 21:26:19] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 1 ms to minimize.
[2023-03-22 21:26:20] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 0 ms to minimize.
[2023-03-22 21:26:20] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 0 ms to minimize.
[2023-03-22 21:26:20] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 0 ms to minimize.
[2023-03-22 21:26:20] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5533 ms
[2023-03-22 21:26:20] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2023-03-22 21:26:21] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2023-03-22 21:26:21] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 0 ms to minimize.
[2023-03-22 21:26:21] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2023-03-22 21:26:21] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2023-03-22 21:26:22] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 0 ms to minimize.
[2023-03-22 21:26:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1447 ms
[2023-03-22 21:26:22] [INFO ] After 8704ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 322 ms.
[2023-03-22 21:26:22] [INFO ] After 9725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 199 ms.
Support contains 8 out of 1560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1560/1560 places, 1310/1310 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1560 transition count 1309
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1559 transition count 1309
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1558 transition count 1308
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1557 transition count 1307
Applied a total of 5 rules in 190 ms. Remains 1557 /1560 variables (removed 3) and now considering 1307/1310 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 1557/1560 places, 1307/1310 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1307 rows 1557 cols
[2023-03-22 21:26:23] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-22 21:26:23] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 21:26:24] [INFO ] [Nat]Absence check using 520 positive place invariants in 100 ms returned sat
[2023-03-22 21:26:24] [INFO ] [Nat]Absence check using 520 positive and 31 generalized place invariants in 6 ms returned sat
[2023-03-22 21:26:25] [INFO ] After 964ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 21:26:25] [INFO ] Deduced a trap composed of 5 places in 425 ms of which 1 ms to minimize.
[2023-03-22 21:26:26] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2023-03-22 21:26:26] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 1 ms to minimize.
[2023-03-22 21:26:26] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 1 ms to minimize.
[2023-03-22 21:26:26] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 0 ms to minimize.
[2023-03-22 21:26:27] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 1 ms to minimize.
[2023-03-22 21:26:27] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 1 ms to minimize.
[2023-03-22 21:26:28] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
[2023-03-22 21:26:28] [INFO ] Deduced a trap composed of 6 places in 538 ms of which 1 ms to minimize.
[2023-03-22 21:26:29] [INFO ] Deduced a trap composed of 6 places in 352 ms of which 0 ms to minimize.
[2023-03-22 21:26:29] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 1 ms to minimize.
[2023-03-22 21:26:29] [INFO ] Deduced a trap composed of 6 places in 321 ms of which 1 ms to minimize.
[2023-03-22 21:26:30] [INFO ] Deduced a trap composed of 6 places in 335 ms of which 14 ms to minimize.
[2023-03-22 21:26:30] [INFO ] Deduced a trap composed of 9 places in 330 ms of which 1 ms to minimize.
[2023-03-22 21:26:30] [INFO ] Deduced a trap composed of 6 places in 333 ms of which 1 ms to minimize.
[2023-03-22 21:26:31] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 1 ms to minimize.
[2023-03-22 21:26:31] [INFO ] Deduced a trap composed of 8 places in 310 ms of which 1 ms to minimize.
[2023-03-22 21:26:32] [INFO ] Deduced a trap composed of 6 places in 316 ms of which 1 ms to minimize.
[2023-03-22 21:26:32] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 0 ms to minimize.
[2023-03-22 21:26:32] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 1 ms to minimize.
[2023-03-22 21:26:32] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 0 ms to minimize.
[2023-03-22 21:26:33] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 0 ms to minimize.
[2023-03-22 21:26:33] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2023-03-22 21:26:33] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2023-03-22 21:26:33] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 1 ms to minimize.
[2023-03-22 21:26:34] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 1 ms to minimize.
[2023-03-22 21:26:34] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 1 ms to minimize.
[2023-03-22 21:26:34] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 0 ms to minimize.
[2023-03-22 21:26:34] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 1 ms to minimize.
[2023-03-22 21:26:35] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2023-03-22 21:26:35] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 1 ms to minimize.
[2023-03-22 21:26:35] [INFO ] Deduced a trap composed of 9 places in 349 ms of which 0 ms to minimize.
[2023-03-22 21:26:36] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 1 ms to minimize.
[2023-03-22 21:26:36] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 0 ms to minimize.
[2023-03-22 21:26:36] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2023-03-22 21:26:36] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 0 ms to minimize.
[2023-03-22 21:26:37] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 8 ms to minimize.
[2023-03-22 21:26:37] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2023-03-22 21:26:37] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 1 ms to minimize.
[2023-03-22 21:26:37] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 1 ms to minimize.
[2023-03-22 21:26:38] [INFO ] Deduced a trap composed of 6 places in 364 ms of which 2 ms to minimize.
[2023-03-22 21:26:38] [INFO ] Deduced a trap composed of 12 places in 341 ms of which 1 ms to minimize.
[2023-03-22 21:26:38] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 0 ms to minimize.
[2023-03-22 21:26:38] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 1 ms to minimize.
[2023-03-22 21:26:39] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 1 ms to minimize.
[2023-03-22 21:26:39] [INFO ] Deduced a trap composed of 15 places in 326 ms of which 0 ms to minimize.
[2023-03-22 21:26:40] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 1 ms to minimize.
[2023-03-22 21:26:40] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2023-03-22 21:26:40] [INFO ] Deduced a trap composed of 6 places in 392 ms of which 1 ms to minimize.
[2023-03-22 21:26:40] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2023-03-22 21:26:41] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2023-03-22 21:26:41] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 16124 ms
[2023-03-22 21:26:41] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 1 ms to minimize.
[2023-03-22 21:26:41] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 1 ms to minimize.
[2023-03-22 21:26:42] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2023-03-22 21:26:42] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 0 ms to minimize.
[2023-03-22 21:26:42] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2023-03-22 21:26:42] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 0 ms to minimize.
[2023-03-22 21:26:43] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 1 ms to minimize.
[2023-03-22 21:26:43] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2023-03-22 21:26:43] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 1 ms to minimize.
[2023-03-22 21:26:43] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2336 ms
[2023-03-22 21:26:43] [INFO ] After 19587ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-22 21:26:43] [INFO ] After 20235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 71 ms.
Support contains 6 out of 1557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1557/1557 places, 1307/1307 transitions.
Applied a total of 0 rules in 70 ms. Remains 1557 /1557 variables (removed 0) and now considering 1307/1307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 1557/1557 places, 1307/1307 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 127941 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{0=1}
Probabilistic random walk after 127941 steps, saw 118254 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-22 21:26:47] [INFO ] Invariant cache hit.
[2023-03-22 21:26:47] [INFO ] [Real]Absence check using 520 positive place invariants in 119 ms returned sat
[2023-03-22 21:26:47] [INFO ] [Real]Absence check using 520 positive and 31 generalized place invariants in 13 ms returned sat
[2023-03-22 21:26:48] [INFO ] After 730ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 21:26:49] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 1 ms to minimize.
[2023-03-22 21:26:49] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2023-03-22 21:26:49] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 0 ms to minimize.
[2023-03-22 21:26:49] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2023-03-22 21:26:50] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 1 ms to minimize.
[2023-03-22 21:26:50] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2023-03-22 21:26:50] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2023-03-22 21:26:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1852 ms
[2023-03-22 21:26:50] [INFO ] After 2658ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:26:50] [INFO ] After 3146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:26:51] [INFO ] [Nat]Absence check using 520 positive place invariants in 256 ms returned sat
[2023-03-22 21:26:51] [INFO ] [Nat]Absence check using 520 positive and 31 generalized place invariants in 8 ms returned sat
[2023-03-22 21:26:52] [INFO ] After 1158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:26:52] [INFO ] Deduced a trap composed of 6 places in 305 ms of which 1 ms to minimize.
[2023-03-22 21:26:53] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 0 ms to minimize.
[2023-03-22 21:26:53] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 0 ms to minimize.
[2023-03-22 21:26:53] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 0 ms to minimize.
[2023-03-22 21:26:54] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 0 ms to minimize.
[2023-03-22 21:26:54] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2023-03-22 21:26:54] [INFO ] Deduced a trap composed of 6 places in 441 ms of which 1 ms to minimize.
[2023-03-22 21:26:55] [INFO ] Deduced a trap composed of 6 places in 392 ms of which 0 ms to minimize.
[2023-03-22 21:26:55] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 1 ms to minimize.
[2023-03-22 21:26:55] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 1 ms to minimize.
[2023-03-22 21:26:55] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2023-03-22 21:26:56] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 0 ms to minimize.
[2023-03-22 21:26:56] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
[2023-03-22 21:26:56] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 0 ms to minimize.
[2023-03-22 21:26:56] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 0 ms to minimize.
[2023-03-22 21:26:57] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 0 ms to minimize.
[2023-03-22 21:26:57] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 1 ms to minimize.
[2023-03-22 21:26:57] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 0 ms to minimize.
[2023-03-22 21:26:57] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 0 ms to minimize.
[2023-03-22 21:26:58] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 1 ms to minimize.
[2023-03-22 21:26:58] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 1 ms to minimize.
[2023-03-22 21:26:58] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 0 ms to minimize.
[2023-03-22 21:26:58] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2023-03-22 21:26:58] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 0 ms to minimize.
[2023-03-22 21:26:59] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 1 ms to minimize.
[2023-03-22 21:26:59] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 0 ms to minimize.
[2023-03-22 21:26:59] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2023-03-22 21:26:59] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 1 ms to minimize.
[2023-03-22 21:27:00] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 0 ms to minimize.
[2023-03-22 21:27:00] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2023-03-22 21:27:00] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2023-03-22 21:27:00] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2023-03-22 21:27:01] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2023-03-22 21:27:01] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 0 ms to minimize.
[2023-03-22 21:27:01] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 0 ms to minimize.
[2023-03-22 21:27:01] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2023-03-22 21:27:01] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 9501 ms
[2023-03-22 21:27:02] [INFO ] After 10710ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-22 21:27:02] [INFO ] After 11501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 1557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1557/1557 places, 1307/1307 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 1557 transition count 1306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1556 transition count 1306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1556 transition count 1305
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1555 transition count 1305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 1552 transition count 1302
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 1552 transition count 1302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 1551 transition count 1301
Applied a total of 12 rules in 290 ms. Remains 1551 /1557 variables (removed 6) and now considering 1301/1307 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 1551/1557 places, 1301/1307 transitions.
[2023-03-22 21:27:02] [INFO ] Flatten gal took : 96 ms
[2023-03-22 21:27:02] [INFO ] Flatten gal took : 86 ms
[2023-03-22 21:27:02] [INFO ] Input system was already deterministic with 2821 transitions.
Computed a total of 612 stabilizing places and 612 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 3071/3071 places, 2821/2821 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 347 rules applied. Total rules applied 347 place count 3070 transition count 2473
Reduce places removed 347 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 348 rules applied. Total rules applied 695 place count 2723 transition count 2472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 696 place count 2722 transition count 2472
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 252 Pre rules applied. Total rules applied 696 place count 2722 transition count 2220
Deduced a syphon composed of 252 places in 7 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 3 with 504 rules applied. Total rules applied 1200 place count 2470 transition count 2220
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1216 place count 2454 transition count 2204
Iterating global reduction 3 with 16 rules applied. Total rules applied 1232 place count 2454 transition count 2204
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1232 place count 2454 transition count 2197
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1246 place count 2447 transition count 2197
Performed 884 Post agglomeration using F-continuation condition.Transition count delta: 884
Deduced a syphon composed of 884 places in 3 ms
Reduce places removed 884 places and 0 transitions.
Iterating global reduction 3 with 1768 rules applied. Total rules applied 3014 place count 1563 transition count 1313
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3016 place count 1561 transition count 1311
Applied a total of 3016 rules in 775 ms. Remains 1561 /3071 variables (removed 1510) and now considering 1311/2821 (removed 1510) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 776 ms. Remains : 1561/3071 places, 1311/2821 transitions.
[2023-03-22 21:27:03] [INFO ] Flatten gal took : 56 ms
[2023-03-22 21:27:03] [INFO ] Flatten gal took : 56 ms
[2023-03-22 21:27:03] [INFO ] Input system was already deterministic with 1311 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3071/3071 places, 2821/2821 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 345 transitions
Trivial Post-agglo rules discarded 345 transitions
Performed 345 trivial Post agglomeration. Transition count delta: 345
Iterating post reduction 0 with 345 rules applied. Total rules applied 345 place count 3070 transition count 2475
Reduce places removed 345 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 347 rules applied. Total rules applied 692 place count 2725 transition count 2473
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 694 place count 2723 transition count 2473
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 251 Pre rules applied. Total rules applied 694 place count 2723 transition count 2222
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 502 rules applied. Total rules applied 1196 place count 2472 transition count 2222
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1212 place count 2456 transition count 2206
Iterating global reduction 3 with 16 rules applied. Total rules applied 1228 place count 2456 transition count 2206
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1228 place count 2456 transition count 2198
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1244 place count 2448 transition count 2198
Performed 888 Post agglomeration using F-continuation condition.Transition count delta: 888
Deduced a syphon composed of 888 places in 2 ms
Reduce places removed 888 places and 0 transitions.
Iterating global reduction 3 with 1776 rules applied. Total rules applied 3020 place count 1560 transition count 1310
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3022 place count 1558 transition count 1308
Applied a total of 3022 rules in 684 ms. Remains 1558 /3071 variables (removed 1513) and now considering 1308/2821 (removed 1513) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 685 ms. Remains : 1558/3071 places, 1308/2821 transitions.
[2023-03-22 21:27:04] [INFO ] Flatten gal took : 59 ms
[2023-03-22 21:27:04] [INFO ] Flatten gal took : 51 ms
[2023-03-22 21:27:04] [INFO ] Input system was already deterministic with 1308 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3071/3071 places, 2821/2821 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 3052 transition count 2802
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 3052 transition count 2802
Applied a total of 38 rules in 445 ms. Remains 3052 /3071 variables (removed 19) and now considering 2802/2821 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 3052/3071 places, 2802/2821 transitions.
[2023-03-22 21:27:05] [INFO ] Flatten gal took : 81 ms
[2023-03-22 21:27:05] [INFO ] Flatten gal took : 83 ms
[2023-03-22 21:27:05] [INFO ] Input system was already deterministic with 2802 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3071/3071 places, 2821/2821 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 349 rules applied. Total rules applied 349 place count 3070 transition count 2471
Reduce places removed 349 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 350 rules applied. Total rules applied 699 place count 2721 transition count 2470
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 700 place count 2720 transition count 2470
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 251 Pre rules applied. Total rules applied 700 place count 2720 transition count 2219
Deduced a syphon composed of 251 places in 6 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 502 rules applied. Total rules applied 1202 place count 2469 transition count 2219
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1219 place count 2452 transition count 2202
Iterating global reduction 3 with 17 rules applied. Total rules applied 1236 place count 2452 transition count 2202
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1236 place count 2452 transition count 2194
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1252 place count 2444 transition count 2194
Performed 882 Post agglomeration using F-continuation condition.Transition count delta: 882
Deduced a syphon composed of 882 places in 2 ms
Reduce places removed 882 places and 0 transitions.
Iterating global reduction 3 with 1764 rules applied. Total rules applied 3016 place count 1562 transition count 1312
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3018 place count 1560 transition count 1310
Applied a total of 3018 rules in 640 ms. Remains 1560 /3071 variables (removed 1511) and now considering 1310/2821 (removed 1511) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 640 ms. Remains : 1560/3071 places, 1310/2821 transitions.
[2023-03-22 21:27:06] [INFO ] Flatten gal took : 42 ms
[2023-03-22 21:27:06] [INFO ] Flatten gal took : 44 ms
[2023-03-22 21:27:06] [INFO ] Input system was already deterministic with 1310 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3071/3071 places, 2821/2821 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3070 transition count 2469
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2719 transition count 2469
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 702 place count 2719 transition count 2218
Deduced a syphon composed of 251 places in 7 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1204 place count 2468 transition count 2218
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1222 place count 2450 transition count 2200
Iterating global reduction 2 with 18 rules applied. Total rules applied 1240 place count 2450 transition count 2200
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 1240 place count 2450 transition count 2190
Deduced a syphon composed of 10 places in 7 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 1260 place count 2440 transition count 2190
Performed 878 Post agglomeration using F-continuation condition.Transition count delta: 878
Deduced a syphon composed of 878 places in 2 ms
Reduce places removed 878 places and 0 transitions.
Iterating global reduction 2 with 1756 rules applied. Total rules applied 3016 place count 1562 transition count 1312
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3018 place count 1560 transition count 1310
Applied a total of 3018 rules in 850 ms. Remains 1560 /3071 variables (removed 1511) and now considering 1310/2821 (removed 1511) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 850 ms. Remains : 1560/3071 places, 1310/2821 transitions.
[2023-03-22 21:27:07] [INFO ] Flatten gal took : 37 ms
[2023-03-22 21:27:07] [INFO ] Flatten gal took : 53 ms
[2023-03-22 21:27:07] [INFO ] Input system was already deterministic with 1310 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3071/3071 places, 2821/2821 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3055 transition count 2805
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3055 transition count 2805
Applied a total of 32 rules in 532 ms. Remains 3055 /3071 variables (removed 16) and now considering 2805/2821 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 537 ms. Remains : 3055/3071 places, 2805/2821 transitions.
[2023-03-22 21:27:08] [INFO ] Flatten gal took : 69 ms
[2023-03-22 21:27:08] [INFO ] Flatten gal took : 78 ms
[2023-03-22 21:27:08] [INFO ] Input system was already deterministic with 2805 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3071/3071 places, 2821/2821 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 3070 transition count 2468
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 2718 transition count 2468
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 704 place count 2718 transition count 2218
Deduced a syphon composed of 250 places in 7 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1204 place count 2468 transition count 2218
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1223 place count 2449 transition count 2199
Iterating global reduction 2 with 19 rules applied. Total rules applied 1242 place count 2449 transition count 2199
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 1242 place count 2449 transition count 2189
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 1262 place count 2439 transition count 2189
Performed 885 Post agglomeration using F-continuation condition.Transition count delta: 885
Deduced a syphon composed of 885 places in 1 ms
Reduce places removed 885 places and 0 transitions.
Iterating global reduction 2 with 1770 rules applied. Total rules applied 3032 place count 1554 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3034 place count 1552 transition count 1302
Applied a total of 3034 rules in 666 ms. Remains 1552 /3071 variables (removed 1519) and now considering 1302/2821 (removed 1519) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 666 ms. Remains : 1552/3071 places, 1302/2821 transitions.
[2023-03-22 21:27:09] [INFO ] Flatten gal took : 34 ms
[2023-03-22 21:27:09] [INFO ] Flatten gal took : 37 ms
[2023-03-22 21:27:09] [INFO ] Input system was already deterministic with 1302 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3071/3071 places, 2821/2821 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3056 transition count 2806
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3056 transition count 2806
Applied a total of 30 rules in 440 ms. Remains 3056 /3071 variables (removed 15) and now considering 2806/2821 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 441 ms. Remains : 3056/3071 places, 2806/2821 transitions.
[2023-03-22 21:27:10] [INFO ] Flatten gal took : 133 ms
[2023-03-22 21:27:10] [INFO ] Flatten gal took : 63 ms
[2023-03-22 21:27:10] [INFO ] Input system was already deterministic with 2806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3071/3071 places, 2821/2821 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 3052 transition count 2802
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 3052 transition count 2802
Applied a total of 38 rules in 418 ms. Remains 3052 /3071 variables (removed 19) and now considering 2802/2821 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 419 ms. Remains : 3052/3071 places, 2802/2821 transitions.
[2023-03-22 21:27:10] [INFO ] Flatten gal took : 73 ms
[2023-03-22 21:27:10] [INFO ] Flatten gal took : 66 ms
[2023-03-22 21:27:10] [INFO ] Input system was already deterministic with 2802 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3071/3071 places, 2821/2821 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 3052 transition count 2802
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 3052 transition count 2802
Applied a total of 38 rules in 501 ms. Remains 3052 /3071 variables (removed 19) and now considering 2802/2821 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 501 ms. Remains : 3052/3071 places, 2802/2821 transitions.
[2023-03-22 21:27:11] [INFO ] Flatten gal took : 61 ms
[2023-03-22 21:27:11] [INFO ] Flatten gal took : 62 ms
[2023-03-22 21:27:11] [INFO ] Input system was already deterministic with 2802 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3071/3071 places, 2821/2821 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 3052 transition count 2802
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 3052 transition count 2802
Applied a total of 38 rules in 552 ms. Remains 3052 /3071 variables (removed 19) and now considering 2802/2821 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 3052/3071 places, 2802/2821 transitions.
[2023-03-22 21:27:12] [INFO ] Flatten gal took : 61 ms
[2023-03-22 21:27:12] [INFO ] Flatten gal took : 66 ms
[2023-03-22 21:27:12] [INFO ] Input system was already deterministic with 2802 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3071/3071 places, 2821/2821 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 3053 transition count 2803
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 3053 transition count 2803
Applied a total of 36 rules in 441 ms. Remains 3053 /3071 variables (removed 18) and now considering 2803/2821 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 441 ms. Remains : 3053/3071 places, 2803/2821 transitions.
[2023-03-22 21:27:13] [INFO ] Flatten gal took : 69 ms
[2023-03-22 21:27:13] [INFO ] Flatten gal took : 72 ms
[2023-03-22 21:27:13] [INFO ] Input system was already deterministic with 2803 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3071/3071 places, 2821/2821 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 3053 transition count 2803
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 3053 transition count 2803
Applied a total of 36 rules in 433 ms. Remains 3053 /3071 variables (removed 18) and now considering 2803/2821 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 3053/3071 places, 2803/2821 transitions.
[2023-03-22 21:27:13] [INFO ] Flatten gal took : 64 ms
[2023-03-22 21:27:14] [INFO ] Flatten gal took : 73 ms
[2023-03-22 21:27:14] [INFO ] Input system was already deterministic with 2803 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3071/3071 places, 2821/2821 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 3052 transition count 2802
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 3052 transition count 2802
Applied a total of 38 rules in 492 ms. Remains 3052 /3071 variables (removed 19) and now considering 2802/2821 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 493 ms. Remains : 3052/3071 places, 2802/2821 transitions.
[2023-03-22 21:27:14] [INFO ] Flatten gal took : 70 ms
[2023-03-22 21:27:14] [INFO ] Flatten gal took : 79 ms
[2023-03-22 21:27:14] [INFO ] Input system was already deterministic with 2802 transitions.
[2023-03-22 21:27:15] [INFO ] Flatten gal took : 66 ms
[2023-03-22 21:27:15] [INFO ] Flatten gal took : 67 ms
[2023-03-22 21:27:15] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 13 ms.
[2023-03-22 21:27:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3071 places, 2821 transitions and 8042 arcs took 24 ms.
Total runtime 139812 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 3071 NrTr: 2821 NrArc: 8042)

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

net check time: 0m 0.022sec

init dd package: 0m 3.091sec


before gc: list nodes free: 1120536

after gc: idd nodes used:49485919, unused:14514081; list nodes free:63007522

RS generation: 25m 6.745sec


-> last computed set: #nodes 49482850 (4.9e+07) #states 29,523,705,855,009 (13)


CANNOT_COMPUTE


BK_STOP 1679521976103

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

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


initing FirstDep: 0m 0.040sec

idd.cc:820: DD Exception: No free nodes

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ShieldPPPs-PT-050B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903718000505"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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