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.r009-oct2-167813598200642.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 ltsminxred
Input is AutonomousCar-PT-08a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598200642
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.2K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 448K Mar 5 18:22 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 AutonomousCar-PT-08a-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-08a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678639091014

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:38:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:38:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:38:15] [INFO ] Load time of PNML (sax parser for PT used): 314 ms
[2023-03-12 16:38:15] [INFO ] Transformed 81 places.
[2023-03-12 16:38:15] [INFO ] Transformed 849 transitions.
[2023-03-12 16:38:15] [INFO ] Found NUPN structural information;
[2023-03-12 16:38:15] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 539 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
Support contains 59 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 574/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 80 transition count 573
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 573
Applied a total of 2 rules in 82 ms. Remains 80 /81 variables (removed 1) and now considering 573/574 (removed 1) transitions.
// Phase 1: matrix 573 rows 80 cols
[2023-03-12 16:38:15] [INFO ] Computed 12 place invariants in 16 ms
[2023-03-12 16:38:16] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-12 16:38:16] [INFO ] Invariant cache hit.
[2023-03-12 16:38:16] [INFO ] State equation strengthened by 259 read => feed constraints.
[2023-03-12 16:38:16] [INFO ] Implicit Places using invariants and state equation in 732 ms returned [76, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1286 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/81 places, 573/574 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1373 ms. Remains : 78/81 places, 573/574 transitions.
Support contains 59 out of 78 places after structural reductions.
[2023-03-12 16:38:17] [INFO ] Flatten gal took : 180 ms
[2023-03-12 16:38:17] [INFO ] Flatten gal took : 81 ms
[2023-03-12 16:38:18] [INFO ] Input system was already deterministic with 573 transitions.
Incomplete random walk after 10000 steps, including 517 resets, run finished after 758 ms. (steps per millisecond=13 ) properties (out of 89) seen :35
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 52) seen :3
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 49) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) 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 48) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 45) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) 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 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) 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 43) seen :3
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :1
Running SMT prover for 39 properties.
// Phase 1: matrix 573 rows 78 cols
[2023-03-12 16:38:19] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-12 16:38:20] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 16:38:20] [INFO ] After 1072ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:38
[2023-03-12 16:38:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-12 16:38:24] [INFO ] After 3092ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :32
[2023-03-12 16:38:24] [INFO ] State equation strengthened by 259 read => feed constraints.
[2023-03-12 16:38:27] [INFO ] After 2672ms SMT Verify possible using 259 Read/Feed constraints in natural domain returned unsat :7 sat :32
[2023-03-12 16:38:30] [INFO ] After 5588ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :32
Attempting to minimize the solution found.
Minimization took 2727 ms.
[2023-03-12 16:38:32] [INFO ] After 11811ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :32
Fused 39 Parikh solutions to 32 different solutions.
Parikh walk visited 1 properties in 716 ms.
Support contains 42 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 573/573 transitions.
Graph (complete) has 842 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 rules applied. Total rules applied 6 place count 77 transition count 567
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 75 transition count 566
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 74 transition count 566
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 74 transition count 563
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 71 transition count 563
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 18 place count 69 transition count 553
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 69 transition count 553
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 68 transition count 552
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 68 transition count 548
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 46 place count 64 transition count 532
Applied a total of 46 rules in 124 ms. Remains 64 /78 variables (removed 14) and now considering 532/573 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 64/78 places, 532/573 transitions.
Incomplete random walk after 10000 steps, including 272 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 31) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) 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 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 532 rows 64 cols
[2023-03-12 16:38:34] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-12 16:38:34] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 16:38:34] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-12 16:38:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 16:38:37] [INFO ] After 1849ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-12 16:38:37] [INFO ] State equation strengthened by 233 read => feed constraints.
[2023-03-12 16:38:39] [INFO ] After 2010ms SMT Verify possible using 233 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-03-12 16:38:41] [INFO ] After 4242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 1923 ms.
[2023-03-12 16:38:43] [INFO ] After 8415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 625 ms.
Support contains 40 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 532/532 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 63 transition count 531
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 63 transition count 530
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 12 place count 62 transition count 522
Applied a total of 12 rules in 57 ms. Remains 62 /64 variables (removed 2) and now considering 522/532 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 62/64 places, 522/532 transitions.
Incomplete random walk after 10000 steps, including 176 resets, run finished after 477 ms. (steps per millisecond=20 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :1
Interrupted probabilistic random walk after 305616 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{3=1, 17=1}
Probabilistic random walk after 305616 steps, saw 51319 distinct states, run finished after 3006 ms. (steps per millisecond=101 ) properties seen :2
Running SMT prover for 20 properties.
// Phase 1: matrix 522 rows 62 cols
[2023-03-12 16:38:47] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 16:38:47] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 16:38:48] [INFO ] After 627ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-12 16:38:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:38:50] [INFO ] After 1608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-12 16:38:50] [INFO ] State equation strengthened by 225 read => feed constraints.
[2023-03-12 16:38:51] [INFO ] After 1389ms SMT Verify possible using 225 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-03-12 16:38:53] [INFO ] After 3039ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 1335 ms.
[2023-03-12 16:38:54] [INFO ] After 6254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 1 properties in 532 ms.
Support contains 35 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 522/522 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 521
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 61 transition count 513
Applied a total of 10 rules in 40 ms. Remains 61 /62 variables (removed 1) and now considering 513/522 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 61/62 places, 513/522 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 335902 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 335902 steps, saw 52401 distinct states, run finished after 3008 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 513 rows 61 cols
[2023-03-12 16:38:58] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 16:38:59] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:38:59] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-12 16:38:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 12 ms returned sat
[2023-03-12 16:39:00] [INFO ] After 1130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-12 16:39:00] [INFO ] State equation strengthened by 217 read => feed constraints.
[2023-03-12 16:39:01] [INFO ] After 920ms SMT Verify possible using 217 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-03-12 16:39:03] [INFO ] After 2581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 1405 ms.
[2023-03-12 16:39:04] [INFO ] After 5383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 492 ms.
Support contains 31 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 513/513 transitions.
Applied a total of 0 rules in 47 ms. Remains 61 /61 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 61/61 places, 513/513 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) 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 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 400170 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 400170 steps, saw 61072 distinct states, run finished after 3005 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 17 properties.
[2023-03-12 16:39:08] [INFO ] Invariant cache hit.
[2023-03-12 16:39:08] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:39:08] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-12 16:39:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 16:39:10] [INFO ] After 1107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-12 16:39:10] [INFO ] State equation strengthened by 217 read => feed constraints.
[2023-03-12 16:39:11] [INFO ] After 975ms SMT Verify possible using 217 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-12 16:39:13] [INFO ] After 2990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 922 ms.
[2023-03-12 16:39:13] [INFO ] After 5210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 317 ms.
Support contains 22 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 513/513 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 59 transition count 511
Applied a total of 4 rules in 32 ms. Remains 59 /61 variables (removed 2) and now considering 511/513 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 59/61 places, 511/513 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 363952 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{0=1, 3=1, 4=1, 7=1, 8=1, 13=1}
Probabilistic random walk after 363952 steps, saw 55228 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :6
Running SMT prover for 10 properties.
// Phase 1: matrix 511 rows 59 cols
[2023-03-12 16:39:17] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 16:39:18] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 16:39:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 16:39:18] [INFO ] After 640ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 16:39:18] [INFO ] State equation strengthened by 217 read => feed constraints.
[2023-03-12 16:39:19] [INFO ] After 684ms SMT Verify possible using 217 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 16:39:20] [INFO ] After 1498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 613 ms.
[2023-03-12 16:39:20] [INFO ] After 2937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 166 ms.
Support contains 18 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 511/511 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 58 transition count 510
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 56 transition count 492
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 56 transition count 492
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 56 transition count 491
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 16 place count 55 transition count 483
Applied a total of 16 rules in 54 ms. Remains 55 /59 variables (removed 4) and now considering 483/511 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 55/59 places, 483/511 transitions.
Incomplete random walk after 10000 steps, including 81 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 483 rows 55 cols
[2023-03-12 16:39:21] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:39:21] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 16:39:21] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 16:39:22] [INFO ] After 452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 16:39:22] [INFO ] State equation strengthened by 193 read => feed constraints.
[2023-03-12 16:39:22] [INFO ] After 489ms SMT Verify possible using 193 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 16:39:23] [INFO ] After 993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 338 ms.
[2023-03-12 16:39:23] [INFO ] After 1904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 115 ms.
Support contains 15 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 483/483 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 54 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 474
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 54 transition count 472
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 14 place count 52 transition count 464
Applied a total of 14 rules in 44 ms. Remains 52 /55 variables (removed 3) and now considering 464/483 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 52/55 places, 464/483 transitions.
Incomplete random walk after 10000 steps, including 33 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 464 rows 52 cols
[2023-03-12 16:39:24] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:39:24] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 16:39:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 16:39:25] [INFO ] After 564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 16:39:25] [INFO ] State equation strengthened by 177 read => feed constraints.
[2023-03-12 16:39:25] [INFO ] After 352ms SMT Verify possible using 177 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 16:39:25] [INFO ] After 780ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 354 ms.
[2023-03-12 16:39:26] [INFO ] After 1791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 99 ms.
Support contains 15 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 464/464 transitions.
Applied a total of 0 rules in 20 ms. Remains 52 /52 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 52/52 places, 464/464 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 16:39:26] [INFO ] Invariant cache hit.
[2023-03-12 16:39:27] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 16:39:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 16:39:27] [INFO ] After 647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 16:39:27] [INFO ] State equation strengthened by 177 read => feed constraints.
[2023-03-12 16:39:28] [INFO ] After 269ms SMT Verify possible using 177 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 16:39:28] [INFO ] After 598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 228 ms.
[2023-03-12 16:39:28] [INFO ] After 1657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 101 ms.
Support contains 9 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 464/464 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 50 transition count 446
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 50 transition count 446
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 50 transition count 445
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 14 place count 49 transition count 437
Applied a total of 14 rules in 38 ms. Remains 49 /52 variables (removed 3) and now considering 437/464 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 49/52 places, 437/464 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 963433 steps, run timeout after 3003 ms. (steps per millisecond=320 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 963433 steps, saw 125680 distinct states, run finished after 3004 ms. (steps per millisecond=320 ) properties seen :3
Running SMT prover for 2 properties.
// Phase 1: matrix 437 rows 49 cols
[2023-03-12 16:39:32] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 16:39:32] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:39:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:39:32] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:39:32] [INFO ] State equation strengthened by 153 read => feed constraints.
[2023-03-12 16:39:32] [INFO ] After 224ms SMT Verify possible using 153 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:39:32] [INFO ] After 336ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-12 16:39:33] [INFO ] After 735ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 40 ms.
Support contains 5 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 437/437 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 48 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 428
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 48 transition count 427
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 12 place count 47 transition count 419
Applied a total of 12 rules in 84 ms. Remains 47 /49 variables (removed 2) and now considering 419/437 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 47/49 places, 419/437 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 928299 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :{}
Probabilistic random walk after 928299 steps, saw 118428 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 419 rows 47 cols
[2023-03-12 16:39:36] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:39:36] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:39:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-12 16:39:36] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:39:36] [INFO ] State equation strengthened by 137 read => feed constraints.
[2023-03-12 16:39:36] [INFO ] After 101ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:39:36] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 245 ms.
[2023-03-12 16:39:37] [INFO ] After 796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 30 ms.
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 419/419 transitions.
Applied a total of 0 rules in 34 ms. Remains 47 /47 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 47/47 places, 419/419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 419/419 transitions.
Applied a total of 0 rules in 19 ms. Remains 47 /47 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2023-03-12 16:39:37] [INFO ] Invariant cache hit.
[2023-03-12 16:39:37] [INFO ] Implicit Places using invariants in 408 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 411 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 46/47 places, 419/419 transitions.
Applied a total of 0 rules in 16 ms. Remains 46 /46 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 459 ms. Remains : 46/47 places, 419/419 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 981468 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 981468 steps, saw 125086 distinct states, run finished after 3002 ms. (steps per millisecond=326 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 419 rows 46 cols
[2023-03-12 16:39:41] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:39:41] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:39:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 16:39:41] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:39:41] [INFO ] State equation strengthened by 137 read => feed constraints.
[2023-03-12 16:39:41] [INFO ] After 126ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:39:41] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-12 16:39:42] [INFO ] After 869ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 36 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 419/419 transitions.
Applied a total of 0 rules in 26 ms. Remains 46 /46 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 46/46 places, 419/419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 419/419 transitions.
Applied a total of 0 rules in 20 ms. Remains 46 /46 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2023-03-12 16:39:42] [INFO ] Invariant cache hit.
[2023-03-12 16:39:42] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-12 16:39:42] [INFO ] Invariant cache hit.
[2023-03-12 16:39:42] [INFO ] State equation strengthened by 137 read => feed constraints.
[2023-03-12 16:39:42] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2023-03-12 16:39:42] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-12 16:39:42] [INFO ] Invariant cache hit.
[2023-03-12 16:39:43] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1249 ms. Remains : 46/46 places, 419/419 transitions.
Applied a total of 0 rules in 26 ms. Remains 46 /46 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-12 16:39:43] [INFO ] Invariant cache hit.
[2023-03-12 16:39:43] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:39:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 16:39:43] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:39:43] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-12 16:39:44] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA AutonomousCar-PT-08a-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 16:39:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-12 16:39:44] [INFO ] Flatten gal took : 65 ms
[2023-03-12 16:39:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutonomousCar-PT-08a-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 16:39:44] [INFO ] Flatten gal took : 87 ms
[2023-03-12 16:39:44] [INFO ] Input system was already deterministic with 573 transitions.
Support contains 54 out of 78 places (down from 58) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 71 transition count 510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 71 transition count 510
Applied a total of 14 rules in 7 ms. Remains 71 /78 variables (removed 7) and now considering 510/573 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 71/78 places, 510/573 transitions.
[2023-03-12 16:39:44] [INFO ] Flatten gal took : 47 ms
[2023-03-12 16:39:44] [INFO ] Flatten gal took : 62 ms
[2023-03-12 16:39:44] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 78 transition count 565
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 70 transition count 565
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 70 transition count 563
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 68 transition count 563
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 63 transition count 518
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 63 transition count 518
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 62 transition count 517
Applied a total of 32 rules in 71 ms. Remains 62 /78 variables (removed 16) and now considering 517/573 (removed 56) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 62/78 places, 517/573 transitions.
[2023-03-12 16:39:44] [INFO ] Flatten gal took : 59 ms
[2023-03-12 16:39:44] [INFO ] Flatten gal took : 59 ms
[2023-03-12 16:39:44] [INFO ] Input system was already deterministic with 517 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 70 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 70 transition count 501
Applied a total of 16 rules in 14 ms. Remains 70 /78 variables (removed 8) and now considering 501/573 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 70/78 places, 501/573 transitions.
[2023-03-12 16:39:45] [INFO ] Flatten gal took : 80 ms
[2023-03-12 16:39:45] [INFO ] Flatten gal took : 54 ms
[2023-03-12 16:39:45] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 73 transition count 528
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 73 transition count 528
Applied a total of 10 rules in 4 ms. Remains 73 /78 variables (removed 5) and now considering 528/573 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 73/78 places, 528/573 transitions.
[2023-03-12 16:39:45] [INFO ] Flatten gal took : 40 ms
[2023-03-12 16:39:45] [INFO ] Flatten gal took : 41 ms
[2023-03-12 16:39:45] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 73 transition count 528
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 73 transition count 528
Applied a total of 10 rules in 7 ms. Remains 73 /78 variables (removed 5) and now considering 528/573 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 73/78 places, 528/573 transitions.
[2023-03-12 16:39:45] [INFO ] Flatten gal took : 45 ms
[2023-03-12 16:39:45] [INFO ] Flatten gal took : 63 ms
[2023-03-12 16:39:45] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 71 transition count 510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 71 transition count 510
Applied a total of 14 rules in 4 ms. Remains 71 /78 variables (removed 7) and now considering 510/573 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 71/78 places, 510/573 transitions.
[2023-03-12 16:39:45] [INFO ] Flatten gal took : 49 ms
[2023-03-12 16:39:45] [INFO ] Flatten gal took : 39 ms
[2023-03-12 16:39:45] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 71 transition count 510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 71 transition count 510
Applied a total of 14 rules in 4 ms. Remains 71 /78 variables (removed 7) and now considering 510/573 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 71/78 places, 510/573 transitions.
[2023-03-12 16:39:45] [INFO ] Flatten gal took : 35 ms
[2023-03-12 16:39:45] [INFO ] Flatten gal took : 37 ms
[2023-03-12 16:39:46] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 70 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 70 transition count 501
Applied a total of 16 rules in 4 ms. Remains 70 /78 variables (removed 8) and now considering 501/573 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 70/78 places, 501/573 transitions.
[2023-03-12 16:39:46] [INFO ] Flatten gal took : 34 ms
[2023-03-12 16:39:46] [INFO ] Flatten gal took : 57 ms
[2023-03-12 16:39:46] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 71 transition count 510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 71 transition count 510
Applied a total of 14 rules in 4 ms. Remains 71 /78 variables (removed 7) and now considering 510/573 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 71/78 places, 510/573 transitions.
[2023-03-12 16:39:46] [INFO ] Flatten gal took : 36 ms
[2023-03-12 16:39:46] [INFO ] Flatten gal took : 38 ms
[2023-03-12 16:39:46] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 74 transition count 537
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 74 transition count 537
Applied a total of 8 rules in 3 ms. Remains 74 /78 variables (removed 4) and now considering 537/573 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 74/78 places, 537/573 transitions.
[2023-03-12 16:39:46] [INFO ] Flatten gal took : 36 ms
[2023-03-12 16:39:46] [INFO ] Flatten gal took : 39 ms
[2023-03-12 16:39:46] [INFO ] Input system was already deterministic with 537 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 74 transition count 537
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 74 transition count 537
Applied a total of 8 rules in 5 ms. Remains 74 /78 variables (removed 4) and now considering 537/573 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 74/78 places, 537/573 transitions.
[2023-03-12 16:39:46] [INFO ] Flatten gal took : 37 ms
[2023-03-12 16:39:46] [INFO ] Flatten gal took : 41 ms
[2023-03-12 16:39:46] [INFO ] Input system was already deterministic with 537 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 75 transition count 546
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 75 transition count 546
Applied a total of 6 rules in 4 ms. Remains 75 /78 variables (removed 3) and now considering 546/573 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 75/78 places, 546/573 transitions.
[2023-03-12 16:39:46] [INFO ] Flatten gal took : 37 ms
[2023-03-12 16:39:46] [INFO ] Flatten gal took : 38 ms
[2023-03-12 16:39:46] [INFO ] Input system was already deterministic with 546 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 76 transition count 555
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 76 transition count 555
Applied a total of 4 rules in 3 ms. Remains 76 /78 variables (removed 2) and now considering 555/573 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 76/78 places, 555/573 transitions.
[2023-03-12 16:39:47] [INFO ] Flatten gal took : 42 ms
[2023-03-12 16:39:47] [INFO ] Flatten gal took : 42 ms
[2023-03-12 16:39:47] [INFO ] Input system was already deterministic with 555 transitions.
[2023-03-12 16:39:47] [INFO ] Flatten gal took : 44 ms
[2023-03-12 16:39:47] [INFO ] Flatten gal took : 43 ms
[2023-03-12 16:39:47] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2023-03-12 16:39:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 78 places, 573 transitions and 6799 arcs took 8 ms.
Total runtime 92390 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/599/ctl_0_ --ctl=/tmp/599/ctl_1_ --ctl=/tmp/599/ctl_2_ --ctl=/tmp/599/ctl_3_ --ctl=/tmp/599/ctl_4_ --ctl=/tmp/599/ctl_5_ --ctl=/tmp/599/ctl_6_ --ctl=/tmp/599/ctl_7_ --ctl=/tmp/599/ctl_8_ --ctl=/tmp/599/ctl_9_ --ctl=/tmp/599/ctl_10_ --ctl=/tmp/599/ctl_11_ --ctl=/tmp/599/ctl_12_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 2155940 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096924 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023

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="AutonomousCar-PT-08a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutonomousCar-PT-08a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813598200642"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-08a.tgz
mv AutonomousCar-PT-08a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;