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

About the Execution of LTSMin+red for AutonomousCar-PT-09a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2047.876 3600000.00 14111527.00 69.20 [undef] Time out reached

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813598200658.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-09a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598200658
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 12:53 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 781K 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-09a-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-09a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678639938706

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-09a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:52:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:52:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:52:22] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2023-03-12 16:52:22] [INFO ] Transformed 89 places.
[2023-03-12 16:52:22] [INFO ] Transformed 1249 transitions.
[2023-03-12 16:52:22] [INFO ] Found NUPN structural information;
[2023-03-12 16:52:22] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 408 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Ensure Unique test removed 345 transitions
Reduce redundant transitions removed 345 transitions.
Support contains 60 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 904/904 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 87 transition count 893
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 893
Applied a total of 4 rules in 42 ms. Remains 87 /89 variables (removed 2) and now considering 893/904 (removed 11) transitions.
// Phase 1: matrix 893 rows 87 cols
[2023-03-12 16:52:22] [INFO ] Computed 13 place invariants in 28 ms
[2023-03-12 16:52:22] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-12 16:52:22] [INFO ] Invariant cache hit.
[2023-03-12 16:52:23] [INFO ] State equation strengthened by 318 read => feed constraints.
[2023-03-12 16:52:23] [INFO ] Implicit Places using invariants and state equation in 515 ms returned [83, 85]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 905 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/89 places, 893/904 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 956 ms. Remains : 85/89 places, 893/904 transitions.
Support contains 60 out of 85 places after structural reductions.
[2023-03-12 16:52:24] [INFO ] Flatten gal took : 434 ms
[2023-03-12 16:52:24] [INFO ] Flatten gal took : 190 ms
[2023-03-12 16:52:24] [INFO ] Input system was already deterministic with 893 transitions.
Incomplete random walk after 10000 steps, including 490 resets, run finished after 717 ms. (steps per millisecond=13 ) properties (out of 69) seen :21
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 48) 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 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 48) 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 48) 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 48) 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 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 47) 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 47) 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 47) 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 47) 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 47) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 46) 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 46) 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 46) 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 46) 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 46) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 45) 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 44) 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 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) seen :2
Running SMT prover for 42 properties.
// Phase 1: matrix 893 rows 85 cols
[2023-03-12 16:52:25] [INFO ] Computed 11 place invariants in 39 ms
[2023-03-12 16:52:27] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 16:52:27] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:42
[2023-03-12 16:52:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 16:52:32] [INFO ] After 5058ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :38
[2023-03-12 16:52:32] [INFO ] State equation strengthened by 318 read => feed constraints.
[2023-03-12 16:52:36] [INFO ] After 4280ms SMT Verify possible using 318 Read/Feed constraints in natural domain returned unsat :4 sat :38
[2023-03-12 16:52:42] [INFO ] After 9470ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :38
Attempting to minimize the solution found.
Minimization took 4250 ms.
[2023-03-12 16:52:46] [INFO ] After 19091ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :38
Fused 42 Parikh solutions to 38 different solutions.
Parikh walk visited 0 properties in 755 ms.
Support contains 45 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 893/893 transitions.
Graph (complete) has 1023 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 84 transition count 888
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 83 transition count 886
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 81 transition count 886
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 81 transition count 883
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 78 transition count 883
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 20 place count 74 transition count 852
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 74 transition count 852
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 26 place count 73 transition count 851
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 73 transition count 847
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 43 place count 69 transition count 838
Applied a total of 43 rules in 372 ms. Remains 69 /85 variables (removed 16) and now considering 838/893 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 69/85 places, 838/893 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 38) 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 38) 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 38) 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 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) 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 37) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 35) 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 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 35) 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 35) 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 35) 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 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) 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 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 33) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) 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 32) 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 32) seen :0
Running SMT prover for 32 properties.
// Phase 1: matrix 838 rows 69 cols
[2023-03-12 16:52:47] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-12 16:52:49] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-12 16:52:50] [INFO ] After 1451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-12 16:52:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 16:52:53] [INFO ] After 3320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-12 16:52:53] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-12 16:52:56] [INFO ] After 3212ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :32
[2023-03-12 16:53:01] [INFO ] After 7461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 3515 ms.
[2023-03-12 16:53:04] [INFO ] After 14587ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Parikh walk visited 2 properties in 347 ms.
Support contains 44 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 838/838 transitions.
Applied a total of 0 rules in 39 ms. Remains 69 /69 variables (removed 0) and now considering 838/838 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 69/69 places, 838/838 transitions.
Incomplete random walk after 10000 steps, including 539 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 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 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 4 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 4 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 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 5 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 4 ms. (steps per millisecond=250 ) properties (out of 27) 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 27) 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 26) 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 26) seen :0
Running SMT prover for 26 properties.
[2023-03-12 16:53:05] [INFO ] Invariant cache hit.
[2023-03-12 16:53:06] [INFO ] [Real]Absence check using 13 positive place invariants in 84 ms returned sat
[2023-03-12 16:53:07] [INFO ] After 1038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-12 16:53:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-12 16:53:10] [INFO ] After 3072ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-12 16:53:10] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-12 16:53:13] [INFO ] After 2633ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2023-03-12 16:53:16] [INFO ] After 5750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 2616 ms.
[2023-03-12 16:53:18] [INFO ] After 11672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 0 properties in 1412 ms.
Support contains 40 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 838/838 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 69 transition count 837
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 68 transition count 837
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 68 transition count 835
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 66 transition count 835
Applied a total of 6 rules in 85 ms. Remains 66 /69 variables (removed 3) and now considering 835/838 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 66/69 places, 835/838 transitions.
Incomplete random walk after 10000 steps, including 437 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 26) 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 25) 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 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
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 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 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 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 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 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 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 1000 steps, including 2 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 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 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 3 resets, run finished after 3 ms. (steps per millisecond=333 ) 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
Interrupted probabilistic random walk after 379557 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 379557 steps, saw 62659 distinct states, run finished after 3016 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 835 rows 66 cols
[2023-03-12 16:53:23] [INFO ] Computed 13 place invariants in 10 ms
[2023-03-12 16:53:24] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 16:53:25] [INFO ] After 838ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-12 16:53:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-03-12 16:53:27] [INFO ] After 2285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-12 16:53:27] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-12 16:53:29] [INFO ] After 2233ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-03-12 16:53:32] [INFO ] After 5129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 2518 ms.
[2023-03-12 16:53:35] [INFO ] After 10160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 618 ms.
Support contains 40 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 835/835 transitions.
Applied a total of 0 rules in 38 ms. Remains 66 /66 variables (removed 0) and now considering 835/835 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 66/66 places, 835/835 transitions.
Incomplete random walk after 10000 steps, including 367 resets, run finished after 452 ms. (steps per millisecond=22 ) 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 5 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 2 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 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 1001 steps, including 3 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 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 1001 steps, including 3 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 5 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 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) 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 23) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) seen :0
Interrupted probabilistic random walk after 339589 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 339589 steps, saw 56239 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 22 properties.
[2023-03-12 16:53:39] [INFO ] Invariant cache hit.
[2023-03-12 16:53:40] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 16:53:40] [INFO ] After 918ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-12 16:53:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 16:53:43] [INFO ] After 2521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2023-03-12 16:53:43] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-12 16:53:45] [INFO ] After 2285ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2023-03-12 16:53:48] [INFO ] After 4946ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 2268 ms.
[2023-03-12 16:53:50] [INFO ] After 10016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 0 properties in 594 ms.
Support contains 40 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 835/835 transitions.
Applied a total of 0 rules in 42 ms. Remains 66 /66 variables (removed 0) and now considering 835/835 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 66/66 places, 835/835 transitions.
Incomplete random walk after 10000 steps, including 284 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) 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 22) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Interrupted probabilistic random walk after 324437 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 324437 steps, saw 54220 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 21 properties.
[2023-03-12 16:53:54] [INFO ] Invariant cache hit.
[2023-03-12 16:53:55] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-12 16:53:55] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-12 16:53:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-03-12 16:53:57] [INFO ] After 2314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-12 16:53:57] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-12 16:53:59] [INFO ] After 2031ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-12 16:54:02] [INFO ] After 4927ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 2118 ms.
[2023-03-12 16:54:04] [INFO ] After 9610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Parikh walk visited 0 properties in 1294 ms.
Support contains 40 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 835/835 transitions.
Applied a total of 0 rules in 39 ms. Remains 66 /66 variables (removed 0) and now considering 835/835 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 66/66 places, 835/835 transitions.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2023-03-12 16:54:06] [INFO ] Flatten gal took : 95 ms
[2023-03-12 16:54:06] [INFO ] Flatten gal took : 105 ms
[2023-03-12 16:54:06] [INFO ] Input system was already deterministic with 893 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 893/893 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 77 transition count 813
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 77 transition count 813
Applied a total of 16 rules in 6 ms. Remains 77 /85 variables (removed 8) and now considering 813/893 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 77/85 places, 813/893 transitions.
[2023-03-12 16:54:06] [INFO ] Flatten gal took : 79 ms
[2023-03-12 16:54:06] [INFO ] Flatten gal took : 81 ms
[2023-03-12 16:54:07] [INFO ] Input system was already deterministic with 813 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 893/893 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 80 transition count 843
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 80 transition count 843
Applied a total of 10 rules in 5 ms. Remains 80 /85 variables (removed 5) and now considering 843/893 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 80/85 places, 843/893 transitions.
[2023-03-12 16:54:07] [INFO ] Flatten gal took : 78 ms
[2023-03-12 16:54:07] [INFO ] Flatten gal took : 76 ms
[2023-03-12 16:54:07] [INFO ] Input system was already deterministic with 843 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 893/893 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 77 transition count 813
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 77 transition count 813
Applied a total of 16 rules in 5 ms. Remains 77 /85 variables (removed 8) and now considering 813/893 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 77/85 places, 813/893 transitions.
[2023-03-12 16:54:07] [INFO ] Flatten gal took : 72 ms
[2023-03-12 16:54:07] [INFO ] Flatten gal took : 74 ms
[2023-03-12 16:54:07] [INFO ] Input system was already deterministic with 813 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 893/893 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 77 transition count 813
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 77 transition count 813
Applied a total of 16 rules in 12 ms. Remains 77 /85 variables (removed 8) and now considering 813/893 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 77/85 places, 813/893 transitions.
[2023-03-12 16:54:07] [INFO ] Flatten gal took : 72 ms
[2023-03-12 16:54:08] [INFO ] Flatten gal took : 71 ms
[2023-03-12 16:54:08] [INFO ] Input system was already deterministic with 813 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 893/893 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 85 transition count 884
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 76 transition count 883
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 75 transition count 883
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 75 transition count 882
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 74 transition count 882
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 30 place count 66 transition count 802
Iterating global reduction 3 with 8 rules applied. Total rules applied 38 place count 66 transition count 802
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 64 transition count 800
Applied a total of 42 rules in 140 ms. Remains 64 /85 variables (removed 21) and now considering 800/893 (removed 93) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 141 ms. Remains : 64/85 places, 800/893 transitions.
[2023-03-12 16:54:08] [INFO ] Flatten gal took : 101 ms
[2023-03-12 16:54:08] [INFO ] Flatten gal took : 84 ms
[2023-03-12 16:54:08] [INFO ] Input system was already deterministic with 800 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 893/893 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 79 transition count 833
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 79 transition count 833
Applied a total of 12 rules in 6 ms. Remains 79 /85 variables (removed 6) and now considering 833/893 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 79/85 places, 833/893 transitions.
[2023-03-12 16:54:08] [INFO ] Flatten gal took : 66 ms
[2023-03-12 16:54:08] [INFO ] Flatten gal took : 68 ms
[2023-03-12 16:54:08] [INFO ] Input system was already deterministic with 833 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 893/893 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 85 transition count 884
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 76 transition count 884
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 76 transition count 882
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 22 place count 74 transition count 882
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 67 transition count 812
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 67 transition count 812
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 38 place count 66 transition count 811
Applied a total of 38 rules in 77 ms. Remains 66 /85 variables (removed 19) and now considering 811/893 (removed 82) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77 ms. Remains : 66/85 places, 811/893 transitions.
[2023-03-12 16:54:09] [INFO ] Flatten gal took : 87 ms
[2023-03-12 16:54:09] [INFO ] Flatten gal took : 91 ms
[2023-03-12 16:54:09] [INFO ] Input system was already deterministic with 811 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 893/893 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 83 transition count 882
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 73 transition count 882
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 21 place count 73 transition count 881
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 23 place count 72 transition count 881
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 31 place count 64 transition count 801
Iterating global reduction 2 with 8 rules applied. Total rules applied 39 place count 64 transition count 801
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 62 transition count 799
Applied a total of 43 rules in 76 ms. Remains 62 /85 variables (removed 23) and now considering 799/893 (removed 94) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77 ms. Remains : 62/85 places, 799/893 transitions.
[2023-03-12 16:54:09] [INFO ] Flatten gal took : 83 ms
[2023-03-12 16:54:09] [INFO ] Flatten gal took : 86 ms
[2023-03-12 16:54:09] [INFO ] Input system was already deterministic with 799 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 893/893 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 823
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 823
Applied a total of 14 rules in 4 ms. Remains 78 /85 variables (removed 7) and now considering 823/893 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 78/85 places, 823/893 transitions.
[2023-03-12 16:54:09] [INFO ] Flatten gal took : 69 ms
[2023-03-12 16:54:09] [INFO ] Flatten gal took : 97 ms
[2023-03-12 16:54:10] [INFO ] Input system was already deterministic with 823 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 893/893 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 77 transition count 813
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 77 transition count 813
Applied a total of 16 rules in 5 ms. Remains 77 /85 variables (removed 8) and now considering 813/893 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 77/85 places, 813/893 transitions.
[2023-03-12 16:54:10] [INFO ] Flatten gal took : 65 ms
[2023-03-12 16:54:10] [INFO ] Flatten gal took : 69 ms
[2023-03-12 16:54:10] [INFO ] Input system was already deterministic with 813 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 893/893 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 85 transition count 885
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 77 transition count 884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 76 transition count 884
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 76 transition count 882
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 74 transition count 882
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 30 place count 66 transition count 802
Iterating global reduction 3 with 8 rules applied. Total rules applied 38 place count 66 transition count 802
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 65 transition count 801
Applied a total of 40 rules in 111 ms. Remains 65 /85 variables (removed 20) and now considering 801/893 (removed 92) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 111 ms. Remains : 65/85 places, 801/893 transitions.
[2023-03-12 16:54:10] [INFO ] Flatten gal took : 105 ms
[2023-03-12 16:54:10] [INFO ] Flatten gal took : 98 ms
[2023-03-12 16:54:10] [INFO ] Input system was already deterministic with 801 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 893/893 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 85 transition count 885
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 77 transition count 884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 76 transition count 884
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 76 transition count 882
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 74 transition count 882
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 28 place count 68 transition count 822
Iterating global reduction 3 with 6 rules applied. Total rules applied 34 place count 68 transition count 822
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 67 transition count 821
Applied a total of 36 rules in 69 ms. Remains 67 /85 variables (removed 18) and now considering 821/893 (removed 72) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 67/85 places, 821/893 transitions.
[2023-03-12 16:54:11] [INFO ] Flatten gal took : 88 ms
[2023-03-12 16:54:11] [INFO ] Flatten gal took : 88 ms
[2023-03-12 16:54:11] [INFO ] Input system was already deterministic with 821 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 893/893 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 77 transition count 813
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 77 transition count 813
Applied a total of 16 rules in 37 ms. Remains 77 /85 variables (removed 8) and now considering 813/893 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 77/85 places, 813/893 transitions.
[2023-03-12 16:54:11] [INFO ] Flatten gal took : 65 ms
[2023-03-12 16:54:11] [INFO ] Flatten gal took : 67 ms
[2023-03-12 16:54:11] [INFO ] Input system was already deterministic with 813 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 893/893 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 77 transition count 813
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 77 transition count 813
Applied a total of 16 rules in 5 ms. Remains 77 /85 variables (removed 8) and now considering 813/893 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 77/85 places, 813/893 transitions.
[2023-03-12 16:54:11] [INFO ] Flatten gal took : 66 ms
[2023-03-12 16:54:11] [INFO ] Flatten gal took : 71 ms
[2023-03-12 16:54:11] [INFO ] Input system was already deterministic with 813 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 893/893 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 85 transition count 885
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 77 transition count 884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 76 transition count 884
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 76 transition count 882
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 74 transition count 882
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 26 place count 70 transition count 842
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 70 transition count 842
Applied a total of 30 rules in 57 ms. Remains 70 /85 variables (removed 15) and now considering 842/893 (removed 51) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 70/85 places, 842/893 transitions.
[2023-03-12 16:54:12] [INFO ] Flatten gal took : 86 ms
[2023-03-12 16:54:12] [INFO ] Flatten gal took : 90 ms
[2023-03-12 16:54:12] [INFO ] Input system was already deterministic with 842 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 893/893 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 80 transition count 843
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 80 transition count 843
Applied a total of 10 rules in 5 ms. Remains 80 /85 variables (removed 5) and now considering 843/893 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 80/85 places, 843/893 transitions.
[2023-03-12 16:54:12] [INFO ] Flatten gal took : 77 ms
[2023-03-12 16:54:12] [INFO ] Flatten gal took : 85 ms
[2023-03-12 16:54:12] [INFO ] Input system was already deterministic with 843 transitions.
[2023-03-12 16:54:12] [INFO ] Flatten gal took : 81 ms
[2023-03-12 16:54:13] [INFO ] Flatten gal took : 88 ms
[2023-03-12 16:54:13] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2023-03-12 16:54:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 893 transitions and 12914 arcs took 20 ms.
Total runtime 111334 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/528/ctl_0_ --ctl=/tmp/528/ctl_1_ --ctl=/tmp/528/ctl_2_ --ctl=/tmp/528/ctl_3_ --ctl=/tmp/528/ctl_4_ --ctl=/tmp/528/ctl_5_ --ctl=/tmp/528/ctl_6_ --ctl=/tmp/528/ctl_7_ --ctl=/tmp/528/ctl_8_ --ctl=/tmp/528/ctl_9_ --ctl=/tmp/528/ctl_10_ --ctl=/tmp/528/ctl_11_ --ctl=/tmp/528/ctl_12_ --ctl=/tmp/528/ctl_13_ --ctl=/tmp/528/ctl_14_ --ctl=/tmp/528/ctl_15_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 15712516 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097340 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-09a"
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-09a, 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-167813598200658"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-09a.tgz
mv AutonomousCar-PT-09a 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 ;