Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694400194.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BridgeAndVehicles-PT-V20P10N50, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694400194
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 19K Feb 25 12:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 25 12:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 347K Feb 25 12:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 12:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 211K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 641K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 728K Feb 25 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.8M Feb 25 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 BridgeAndVehicles-PT-V20P10N50-CTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678613630550

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=BridgeAndVehicles-PT-V20P10N50
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 09:33:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 09:33:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 09:33:52] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2023-03-12 09:33:52] [INFO ] Transformed 108 places.
[2023-03-12 09:33:52] [INFO ] Transformed 2228 transitions.
[2023-03-12 09:33:52] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 51 ms.
Support contains 106 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2228
Applied a total of 2 rules in 34 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:33:53] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 09:33:53] [INFO ] Computed 5 place invariants in 16 ms
[2023-03-12 09:33:54] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
[2023-03-12 09:33:54] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:33:54] [INFO ] Invariant cache hit.
[2023-03-12 09:33:54] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-12 09:33:54] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:33:54] [INFO ] Invariant cache hit.
[2023-03-12 09:33:54] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:33:54] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-12 09:33:54] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:33:54] [INFO ] Invariant cache hit.
[2023-03-12 09:33:54] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 2228/2228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1771 ms. Remains : 106/108 places, 2228/2228 transitions.
Support contains 106 out of 106 places after structural reductions.
[2023-03-12 09:33:55] [INFO ] Flatten gal took : 330 ms
[2023-03-12 09:33:57] [INFO ] Flatten gal took : 357 ms
[2023-03-12 09:34:00] [INFO ] Input system was already deterministic with 2228 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 1319 ms. (steps per millisecond=7 ) properties (out of 67) seen :29
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=9 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 38) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 37) seen :0
Running SMT prover for 37 properties.
[2023-03-12 09:34:02] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:34:02] [INFO ] Invariant cache hit.
[2023-03-12 09:34:04] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:34:04] [INFO ] After 396ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:36
[2023-03-12 09:34:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:34:05] [INFO ] After 1375ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :33
[2023-03-12 09:34:06] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:34:08] [INFO ] After 2352ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :4 sat :33
[2023-03-12 09:34:12] [INFO ] After 6221ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :33
Attempting to minimize the solution found.
Minimization took 3680 ms.
[2023-03-12 09:34:15] [INFO ] After 11532ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :33
Fused 37 Parikh solutions to 33 different solutions.
Parikh walk visited 0 properties in 2038 ms.
Support contains 66 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2226
Applied a total of 5 rules in 418 ms. Remains 103 /106 variables (removed 3) and now considering 2226/2228 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 419 ms. Remains : 103/106 places, 2226/2228 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 33) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Interrupted probabilistic random walk after 126235 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{11=1, 19=1, 20=1, 24=1, 31=1}
Probabilistic random walk after 126235 steps, saw 37321 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :5
Running SMT prover for 27 properties.
[2023-03-12 09:34:22] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2023-03-12 09:34:22] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-12 09:34:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:34:23] [INFO ] After 756ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-12 09:34:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:34:24] [INFO ] After 1082ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-12 09:34:24] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:34:26] [INFO ] After 1647ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2023-03-12 09:34:32] [INFO ] After 7369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 2750 ms.
[2023-03-12 09:34:34] [INFO ] After 11403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Parikh walk visited 0 properties in 1210 ms.
Support contains 59 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 241 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 103/103 places, 2226/2226 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Interrupted probabilistic random walk after 143997 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 143997 steps, saw 42592 distinct states, run finished after 3003 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 27 properties.
[2023-03-12 09:34:40] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 09:34:40] [INFO ] Invariant cache hit.
[2023-03-12 09:34:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:34:41] [INFO ] After 720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-12 09:34:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:34:42] [INFO ] After 998ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-12 09:34:42] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:34:44] [INFO ] After 1599ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2023-03-12 09:34:46] [INFO ] After 4273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 2005 ms.
[2023-03-12 09:34:48] [INFO ] After 7419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Parikh walk visited 0 properties in 755 ms.
Support contains 59 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 300 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 103/103 places, 2226/2226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 205 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2023-03-12 09:34:50] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 09:34:50] [INFO ] Invariant cache hit.
[2023-03-12 09:34:50] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-12 09:34:50] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 09:34:50] [INFO ] Invariant cache hit.
[2023-03-12 09:34:50] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:34:51] [INFO ] Implicit Places using invariants and state equation in 894 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1055 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 188 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1450 ms. Remains : 101/103 places, 2226/2226 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 640 ms. (steps per millisecond=15 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Interrupted probabilistic random walk after 109767 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109767 steps, saw 32834 distinct states, run finished after 3009 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 27 properties.
[2023-03-12 09:34:55] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2023-03-12 09:34:55] [INFO ] Computed 4 place invariants in 10 ms
[2023-03-12 09:34:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:34:56] [INFO ] After 932ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-12 09:34:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 09:34:57] [INFO ] After 1178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-12 09:34:58] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:35:00] [INFO ] After 1999ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2023-03-12 09:35:01] [INFO ] Deduced a trap composed of 55 places in 452 ms of which 3 ms to minimize.
[2023-03-12 09:35:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 467 ms
[2023-03-12 09:35:04] [INFO ] After 6533ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :26
Attempting to minimize the solution found.
Minimization took 3729 ms.
[2023-03-12 09:35:08] [INFO ] After 11681ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :26
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 1077 ms.
Support contains 58 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 223 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 101/101 places, 2226/2226 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 83189 steps, run timeout after 3002 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83189 steps, saw 25507 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 26 properties.
[2023-03-12 09:35:13] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 09:35:13] [INFO ] Invariant cache hit.
[2023-03-12 09:35:14] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:35:14] [INFO ] After 629ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-12 09:35:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:35:15] [INFO ] After 849ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-12 09:35:15] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:35:17] [INFO ] After 1665ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2023-03-12 09:35:19] [INFO ] After 4171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 3548 ms.
[2023-03-12 09:35:23] [INFO ] After 8708ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 0 properties in 1138 ms.
Support contains 58 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 189 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 101/101 places, 2226/2226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 193 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2023-03-12 09:35:24] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 09:35:24] [INFO ] Invariant cache hit.
[2023-03-12 09:35:25] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-12 09:35:25] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 09:35:25] [INFO ] Invariant cache hit.
[2023-03-12 09:35:25] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:35:25] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
[2023-03-12 09:35:26] [INFO ] Redundant transitions in 162 ms returned []
[2023-03-12 09:35:26] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 09:35:26] [INFO ] Invariant cache hit.
[2023-03-12 09:35:26] [INFO ] Dead Transitions using invariants and state equation in 946 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2199 ms. Remains : 101/101 places, 2226/2226 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 101 transition count 288
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1939 place count 101 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1940 place count 100 transition count 287
Applied a total of 1940 rules in 12 ms. Remains 100 /101 variables (removed 1) and now considering 287/2226 (removed 1939) transitions.
Running SMT prover for 26 properties.
// Phase 1: matrix 287 rows 100 cols
[2023-03-12 09:35:27] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-12 09:35:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:35:27] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-12 09:35:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:35:28] [INFO ] After 690ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-12 09:35:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:35:28] [INFO ] After 616ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2023-03-12 09:35:29] [INFO ] After 1203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 478 ms.
[2023-03-12 09:35:29] [INFO ] After 2517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 09:35:30] [INFO ] Flatten gal took : 258 ms
[2023-03-12 09:35:33] [INFO ] Flatten gal took : 308 ms
[2023-03-12 09:35:35] [INFO ] Input system was already deterministic with 2228 transitions.
Computed a total of 49 stabilizing places and 84 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 19 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:35:36] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 09:35:36] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:35:36] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 657 ms. Remains : 106/106 places, 2228/2228 transitions.
[2023-03-12 09:35:36] [INFO ] Flatten gal took : 75 ms
[2023-03-12 09:35:36] [INFO ] Flatten gal took : 101 ms
[2023-03-12 09:35:37] [INFO ] Input system was already deterministic with 2228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 18 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:35:37] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:35:37] [INFO ] Invariant cache hit.
[2023-03-12 09:35:37] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 739 ms. Remains : 106/106 places, 2228/2228 transitions.
[2023-03-12 09:35:38] [INFO ] Flatten gal took : 88 ms
[2023-03-12 09:35:38] [INFO ] Flatten gal took : 123 ms
[2023-03-12 09:35:38] [INFO ] Input system was already deterministic with 2228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:35:38] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:35:38] [INFO ] Invariant cache hit.
[2023-03-12 09:35:39] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 718 ms. Remains : 106/106 places, 2228/2228 transitions.
[2023-03-12 09:35:39] [INFO ] Flatten gal took : 94 ms
[2023-03-12 09:35:39] [INFO ] Flatten gal took : 146 ms
[2023-03-12 09:35:39] [INFO ] Input system was already deterministic with 2228 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 627 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:35:40] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:35:40] [INFO ] Invariant cache hit.
[2023-03-12 09:35:41] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1425 ms. Remains : 106/106 places, 2228/2228 transitions.
[2023-03-12 09:35:41] [INFO ] Flatten gal took : 55 ms
[2023-03-12 09:35:41] [INFO ] Flatten gal took : 60 ms
[2023-03-12 09:35:41] [INFO ] Input system was already deterministic with 2228 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2226
Applied a total of 5 rules in 597 ms. Remains 103 /106 variables (removed 3) and now considering 2226/2228 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 597 ms. Remains : 103/106 places, 2226/2228 transitions.
[2023-03-12 09:35:42] [INFO ] Flatten gal took : 53 ms
[2023-03-12 09:35:42] [INFO ] Flatten gal took : 61 ms
[2023-03-12 09:35:42] [INFO ] Input system was already deterministic with 2226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:35:42] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:35:42] [INFO ] Invariant cache hit.
[2023-03-12 09:35:43] [INFO ] Dead Transitions using invariants and state equation in 735 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 742 ms. Remains : 106/106 places, 2228/2228 transitions.
[2023-03-12 09:35:43] [INFO ] Flatten gal took : 65 ms
[2023-03-12 09:35:43] [INFO ] Flatten gal took : 87 ms
[2023-03-12 09:35:43] [INFO ] Input system was already deterministic with 2228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:35:43] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:35:43] [INFO ] Invariant cache hit.
[2023-03-12 09:35:44] [INFO ] Dead Transitions using invariants and state equation in 1101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1109 ms. Remains : 106/106 places, 2228/2228 transitions.
[2023-03-12 09:35:44] [INFO ] Flatten gal took : 101 ms
[2023-03-12 09:35:45] [INFO ] Flatten gal took : 146 ms
[2023-03-12 09:35:45] [INFO ] Input system was already deterministic with 2228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 13 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 09:35:45] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 09:35:45] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 09:35:46] [INFO ] Dead Transitions using invariants and state equation in 1070 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1097 ms. Remains : 105/106 places, 2227/2228 transitions.
[2023-03-12 09:35:46] [INFO ] Flatten gal took : 50 ms
[2023-03-12 09:35:46] [INFO ] Flatten gal took : 59 ms
[2023-03-12 09:35:46] [INFO ] Input system was already deterministic with 2227 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 101 transition count 2224
Applied a total of 9 rules in 270 ms. Remains 101 /106 variables (removed 5) and now considering 2224/2228 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 272 ms. Remains : 101/106 places, 2224/2228 transitions.
[2023-03-12 09:35:47] [INFO ] Flatten gal took : 46 ms
[2023-03-12 09:35:47] [INFO ] Flatten gal took : 53 ms
[2023-03-12 09:35:47] [INFO ] Input system was already deterministic with 2224 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 12 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 09:35:47] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:35:47] [INFO ] Invariant cache hit.
[2023-03-12 09:35:48] [INFO ] Dead Transitions using invariants and state equation in 1238 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1252 ms. Remains : 105/106 places, 2227/2228 transitions.
[2023-03-12 09:35:48] [INFO ] Flatten gal took : 50 ms
[2023-03-12 09:35:48] [INFO ] Flatten gal took : 59 ms
[2023-03-12 09:35:48] [INFO ] Input system was already deterministic with 2227 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 101 transition count 2224
Applied a total of 9 rules in 261 ms. Remains 101 /106 variables (removed 5) and now considering 2224/2228 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 262 ms. Remains : 101/106 places, 2224/2228 transitions.
[2023-03-12 09:35:49] [INFO ] Flatten gal took : 51 ms
[2023-03-12 09:35:49] [INFO ] Flatten gal took : 62 ms
[2023-03-12 09:35:49] [INFO ] Input system was already deterministic with 2224 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 284520 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 284520 steps, saw 80932 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:35:52] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 101 cols
[2023-03-12 09:35:52] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-12 09:35:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:35:52] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:35:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:35:53] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:35:53] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:35:53] [INFO ] After 117ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:35:53] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-12 09:35:53] [INFO ] After 564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 86 ms.
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2224/2224 transitions.
Applied a total of 0 rules in 198 ms. Remains 101 /101 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 101/101 places, 2224/2224 transitions.
Incomplete random walk after 1000000 steps, including 8021 resets, run finished after 8249 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3326 resets, run finished after 3457 ms. (steps per millisecond=289 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3263411 steps, run timeout after 33001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 3263411 steps, saw 873661 distinct states, run finished after 33001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:36:38] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:36:38] [INFO ] Invariant cache hit.
[2023-03-12 09:36:38] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:36:38] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:36:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:36:38] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:36:38] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:36:39] [INFO ] After 118ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:36:39] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-12 09:36:39] [INFO ] After 475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 124 ms.
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2224/2224 transitions.
Applied a total of 0 rules in 235 ms. Remains 101 /101 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 101/101 places, 2224/2224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2224/2224 transitions.
Applied a total of 0 rules in 199 ms. Remains 101 /101 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2023-03-12 09:36:39] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:36:39] [INFO ] Invariant cache hit.
[2023-03-12 09:36:40] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-12 09:36:40] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:36:40] [INFO ] Invariant cache hit.
[2023-03-12 09:36:40] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:36:41] [INFO ] Implicit Places using invariants and state equation in 978 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1319 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/101 places, 2224/2224 transitions.
Applied a total of 0 rules in 198 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1717 ms. Remains : 99/101 places, 2224/2224 transitions.
Incomplete random walk after 1000000 steps, including 8023 resets, run finished after 7779 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3327 resets, run finished after 3372 ms. (steps per millisecond=296 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3542092 steps, run timeout after 33001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 3542092 steps, saw 946337 distinct states, run finished after 33001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:37:25] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2023-03-12 09:37:25] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-12 09:37:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:37:25] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:37:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:37:25] [INFO ] After 258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:37:26] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:37:26] [INFO ] After 120ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:37:26] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-12 09:37:26] [INFO ] After 585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 501 ms.
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 199 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 99/99 places, 2224/2224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 177 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2023-03-12 09:37:27] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:37:27] [INFO ] Invariant cache hit.
[2023-03-12 09:37:27] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-12 09:37:27] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:37:27] [INFO ] Invariant cache hit.
[2023-03-12 09:37:27] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2023-03-12 09:37:27] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-12 09:37:27] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:37:27] [INFO ] Invariant cache hit.
[2023-03-12 09:37:28] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1687 ms. Remains : 99/99 places, 2224/2224 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 99 transition count 286
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1940 place count 99 transition count 284
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1942 place count 97 transition count 284
Applied a total of 1942 rules in 9 ms. Remains 97 /99 variables (removed 2) and now considering 284/2224 (removed 1940) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 284 rows 97 cols
[2023-03-12 09:37:28] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-12 09:37:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:37:28] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:37:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:37:28] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:37:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 09:37:28] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:37:28] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-12 09:37:29] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 22 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 09:37:29] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 09:37:29] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 09:37:30] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1020 ms. Remains : 105/106 places, 2227/2228 transitions.
[2023-03-12 09:37:30] [INFO ] Flatten gal took : 51 ms
[2023-03-12 09:37:30] [INFO ] Flatten gal took : 54 ms
[2023-03-12 09:37:30] [INFO ] Input system was already deterministic with 2227 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 13 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 09:37:30] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:37:30] [INFO ] Invariant cache hit.
[2023-03-12 09:37:31] [INFO ] Dead Transitions using invariants and state equation in 1133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1148 ms. Remains : 105/106 places, 2227/2228 transitions.
[2023-03-12 09:37:31] [INFO ] Flatten gal took : 70 ms
[2023-03-12 09:37:31] [INFO ] Flatten gal took : 62 ms
[2023-03-12 09:37:31] [INFO ] Input system was already deterministic with 2227 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 13 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 09:37:31] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:37:31] [INFO ] Invariant cache hit.
[2023-03-12 09:37:32] [INFO ] Dead Transitions using invariants and state equation in 850 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 878 ms. Remains : 105/106 places, 2227/2228 transitions.
[2023-03-12 09:37:32] [INFO ] Flatten gal took : 55 ms
[2023-03-12 09:37:32] [INFO ] Flatten gal took : 62 ms
[2023-03-12 09:37:32] [INFO ] Input system was already deterministic with 2227 transitions.
[2023-03-12 09:37:33] [INFO ] Flatten gal took : 275 ms
[2023-03-12 09:37:35] [INFO ] Flatten gal took : 375 ms
[2023-03-12 09:37:37] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 78 ms.
[2023-03-12 09:37:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 2228 transitions and 17188 arcs took 13 ms.
Total runtime 225497 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/666/ctl_0_ --ctl=/tmp/666/ctl_1_ --ctl=/tmp/666/ctl_2_ --ctl=/tmp/666/ctl_3_ --ctl=/tmp/666/ctl_4_ --ctl=/tmp/666/ctl_5_ --ctl=/tmp/666/ctl_6_ --ctl=/tmp/666/ctl_7_ --ctl=/tmp/666/ctl_8_ --ctl=/tmp/666/ctl_9_ --ctl=/tmp/666/ctl_10_ --ctl=/tmp/666/ctl_11_ --ctl=/tmp/666/ctl_12_ --ctl=/tmp/666/ctl_13_ --mu-par --mu-opt
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678615073836

--------------------
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
ctl formula name BridgeAndVehicles-PT-V20P10N50-CTLFireability-00
ctl formula formula --ctl=/tmp/666/ctl_0_
ctl formula name BridgeAndVehicles-PT-V20P10N50-CTLFireability-01
ctl formula formula --ctl=/tmp/666/ctl_1_
ctl formula name BridgeAndVehicles-PT-V20P10N50-CTLFireability-03
ctl formula formula --ctl=/tmp/666/ctl_2_
ctl formula name BridgeAndVehicles-PT-V20P10N50-CTLFireability-04
ctl formula formula --ctl=/tmp/666/ctl_3_
ctl formula name BridgeAndVehicles-PT-V20P10N50-CTLFireability-05
ctl formula formula --ctl=/tmp/666/ctl_4_
ctl formula name BridgeAndVehicles-PT-V20P10N50-CTLFireability-06
ctl formula formula --ctl=/tmp/666/ctl_5_
ctl formula name BridgeAndVehicles-PT-V20P10N50-CTLFireability-07
ctl formula formula --ctl=/tmp/666/ctl_6_
ctl formula name BridgeAndVehicles-PT-V20P10N50-CTLFireability-08
ctl formula formula --ctl=/tmp/666/ctl_7_
ctl formula name BridgeAndVehicles-PT-V20P10N50-CTLFireability-09
ctl formula formula --ctl=/tmp/666/ctl_8_
ctl formula name BridgeAndVehicles-PT-V20P10N50-CTLFireability-10
ctl formula formula --ctl=/tmp/666/ctl_9_
ctl formula name BridgeAndVehicles-PT-V20P10N50-CTLFireability-11
ctl formula formula --ctl=/tmp/666/ctl_10_
ctl formula name BridgeAndVehicles-PT-V20P10N50-CTLFireability-12
ctl formula formula --ctl=/tmp/666/ctl_11_
ctl formula name BridgeAndVehicles-PT-V20P10N50-CTLFireability-14
ctl formula formula --ctl=/tmp/666/ctl_12_
ctl formula name BridgeAndVehicles-PT-V20P10N50-CTLFireability-15
ctl formula formula --ctl=/tmp/666/ctl_13_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 106 places, 2228 transitions and 17188 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.040 real 0.030 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 2228->2186 groups
pnml2lts-sym: Regrouping took 2.210 real 2.210 user 0.000 sys
pnml2lts-sym: state vector length is 106; there are 2186 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 25201069 group checks and 0 next state calls
pnml2lts-sym: reachability took 93.270 real 372.550 user 0.060 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.030 user 0.000 sys
pnml2lts-sym: state space has 9080862 states, 43503 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/666/ctl_13_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/666/ctl_12_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/666/ctl_11_ holds for the initial state
pnml2lts-sym: Formula /tmp/666/ctl_10_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/666/ctl_9_ holds for the initial state
pnml2lts-sym: Formula /tmp/666/ctl_8_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/666/ctl_0_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/666/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/666/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/666/ctl_4_ holds for the initial state
pnml2lts-sym: Formula /tmp/666/ctl_5_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/666/ctl_3_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/666/ctl_6_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/666/ctl_7_ does not hold for the initial state
pnml2lts-sym: group_next: 15500 nodes total
pnml2lts-sym: group_explored: 49391 nodes, 78332 short vectors total
pnml2lts-sym: max token count: 20

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="BridgeAndVehicles-PT-V20P10N50"
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 BridgeAndVehicles-PT-V20P10N50, 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 r041-tajo-167813694400194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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