Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 16K Apr 13 02:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 13 02:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 400K Apr 13 02:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 13 02:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 144K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 406K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 13 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 13 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 227K Apr 13 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 886K Apr 13 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717219896945

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P10N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:31:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 05:31:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:31:38] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-06-01 05:31:38] [INFO ] Transformed 108 places.
[2024-06-01 05:31:38] [INFO ] Transformed 2228 transitions.
[2024-06-01 05:31:38] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 14
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 0, 20, 10, 0, 0, 0, 0, 0, 0, 0, 20] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 0, 0, 20, 10, 0, 0, 0, 0, 0, 0, 0, 20] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 05:31:38] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-06-01 05:31:38] [INFO ] Computed 7 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 20, 10, 0, 0, 0, 0, 0, 0, 0, 20] Max Struct:[2, 2, 2, 20, 10, 20, 10, 20, 1, 20, 1, 10, 20]
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (57 resets) in 205 ms. (48 steps per ms)
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50003 steps (106 resets) in 152 ms. (326 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 0, 6] Max Struct:[2, 2, 2, 1, 10]
[2024-06-01 05:31:39] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2024-06-01 05:31:39] [INFO ] Invariant cache hit.
[2024-06-01 05:31:39] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2024-06-01 05:31:39] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2024-06-01 05:31:39] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2024-06-01 05:31:39] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:31:39] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-01 05:31:39] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-01 05:31:39] [INFO ] [Real]Added 102 Read/Feed constraints in 36 ms returned sat
[2024-06-01 05:31:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:31:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:31:39] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-01 05:31:39] [INFO ] [Nat]Added 102 Read/Feed constraints in 37 ms returned sat
[2024-06-01 05:31:39] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 197 transitions) in 146 ms.
[2024-06-01 05:31:40] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 11 ms to minimize.
[2024-06-01 05:31:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2024-06-01 05:31:40] [INFO ] Added : 23 causal constraints over 6 iterations in 647 ms. Result :sat
Minimization took 145 ms.
[2024-06-01 05:31:40] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-01 05:31:40] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-06-01 05:31:40] [INFO ] [Real]Added 102 Read/Feed constraints in 18 ms returned sat
[2024-06-01 05:31:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:31:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:31:40] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-01 05:31:40] [INFO ] [Nat]Added 102 Read/Feed constraints in 18 ms returned sat
[2024-06-01 05:31:40] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 197 transitions) in 220 ms.
[2024-06-01 05:31:41] [INFO ] Added : 31 causal constraints over 7 iterations in 442 ms. Result :sat
Minimization took 149 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 0, 6] Max Struct:[1, 1, 1, 1, 10]
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 108 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place COMPTEUR_24) removed 42 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 2186/2186 transitions.
Graph (complete) has 874 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2144
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 104 transition count 2102
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 103 transition count 2060
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5 place count 102 transition count 2018
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6 place count 101 transition count 1976
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 7 place count 100 transition count 1934
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 8 place count 99 transition count 1892
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 9 place count 98 transition count 1850
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 10 place count 97 transition count 1808
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 11 place count 96 transition count 1766
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 12 place count 95 transition count 1724
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 13 place count 94 transition count 1682
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 14 place count 93 transition count 1640
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 15 place count 92 transition count 1598
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 16 place count 91 transition count 1556
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 17 place count 90 transition count 1514
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 18 place count 89 transition count 1472
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 19 place count 88 transition count 1430
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 20 place count 87 transition count 1388
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 21 place count 86 transition count 1346
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 22 place count 85 transition count 1304
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 23 place count 84 transition count 1262
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 24 place count 83 transition count 1220
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 25 place count 82 transition count 1178
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 26 place count 81 transition count 1136
Reduce places removed 1 places and 42 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 27 place count 80 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 28 place count 79 transition count 1093
Iterating global reduction 26 with 1 rules applied. Total rules applied 29 place count 79 transition count 1093
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 26 with 3 rules applied. Total rules applied 32 place count 77 transition count 1092
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 26 with 4 rules applied. Total rules applied 36 place count 75 transition count 1090
Applied a total of 36 rules in 282 ms. Remains 75 /108 variables (removed 33) and now considering 1090/2186 (removed 1096) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 75/108 places, 1090/2186 transitions.
[2024-06-01 05:31:43] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
// Phase 1: matrix 178 rows 75 cols
[2024-06-01 05:31:43] [INFO ] Computed 4 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (8022 resets) in 4277 ms. (233 steps per ms)
BEST_FIRST walk for 1000001 steps (3312 resets) in 1715 ms. (582 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 05:31:49] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
[2024-06-01 05:31:49] [INFO ] Invariant cache hit.
[2024-06-01 05:31:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:31:49] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-01 05:31:49] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 05:31:49] [INFO ] [Real]Added 48 Read/Feed constraints in 26 ms returned sat
[2024-06-01 05:31:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:31:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 05:31:49] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-06-01 05:31:49] [INFO ] [Nat]Added 48 Read/Feed constraints in 20 ms returned sat
[2024-06-01 05:31:49] [INFO ] Computed and/alt/rep : 63/124/63 causal constraints (skipped 112 transitions) in 31 ms.
[2024-06-01 05:31:49] [INFO ] Added : 23 causal constraints over 6 iterations in 110 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 1090/1090 transitions.
Applied a total of 0 rules in 72 ms. Remains 75 /75 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 75/75 places, 1090/1090 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 1090/1090 transitions.
Applied a total of 0 rules in 97 ms. Remains 75 /75 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
[2024-06-01 05:31:49] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
[2024-06-01 05:31:49] [INFO ] Invariant cache hit.
[2024-06-01 05:31:50] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 05:31:50] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
[2024-06-01 05:31:50] [INFO ] Invariant cache hit.
[2024-06-01 05:31:50] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 05:31:50] [INFO ] Implicit Places using invariants and state equation in 445 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 643 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 73/75 places, 1090/1090 transitions.
Applied a total of 0 rules in 74 ms. Remains 73 /73 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 817 ms. Remains : 73/75 places, 1090/1090 transitions.
[2024-06-01 05:31:50] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
// Phase 1: matrix 178 rows 73 cols
[2024-06-01 05:31:50] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (8021 resets) in 4069 ms. (245 steps per ms)
BEST_FIRST walk for 1000000 steps (3318 resets) in 1706 ms. (585 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 05:31:56] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
[2024-06-01 05:31:56] [INFO ] Invariant cache hit.
[2024-06-01 05:31:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 05:31:56] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-06-01 05:31:56] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 05:31:56] [INFO ] [Real]Added 48 Read/Feed constraints in 20 ms returned sat
[2024-06-01 05:31:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:31:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:31:56] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-01 05:31:56] [INFO ] [Nat]Added 48 Read/Feed constraints in 16 ms returned sat
[2024-06-01 05:31:56] [INFO ] Computed and/alt/rep : 63/124/63 causal constraints (skipped 112 transitions) in 32 ms.
[2024-06-01 05:31:56] [INFO ] Added : 21 causal constraints over 5 iterations in 106 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1090/1090 transitions.
Applied a total of 0 rules in 45 ms. Remains 73 /73 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 73/73 places, 1090/1090 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1090/1090 transitions.
Applied a total of 0 rules in 44 ms. Remains 73 /73 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
[2024-06-01 05:31:56] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
[2024-06-01 05:31:56] [INFO ] Invariant cache hit.
[2024-06-01 05:31:57] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 05:31:57] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
[2024-06-01 05:31:57] [INFO ] Invariant cache hit.
[2024-06-01 05:31:57] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 05:31:57] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2024-06-01 05:31:57] [INFO ] Redundant transitions in 55 ms returned []
Running 1087 sub problems to find dead transitions.
[2024-06-01 05:31:57] [INFO ] Flow matrix only has 178 transitions (discarded 912 similar events)
[2024-06-01 05:31:57] [INFO ] Invariant cache hit.
[2024-06-01 05:31:57] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1087 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1087 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1087 unsolved
[2024-06-01 05:32:09] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1066 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/5 constraints. Problems are: Problem set: 40 solved, 1047 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 40 solved, 1047 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 5 (OVERLAPS) 178/251 variables, 73/78 constraints. Problems are: Problem set: 42 solved, 1045 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 48/126 constraints. Problems are: Problem set: 42 solved, 1045 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/126 constraints. Problems are: Problem set: 42 solved, 1045 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 251/251 variables, and 126 constraints, problems are : Problem set: 42 solved, 1045 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1087/1087 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 42 solved, 1045 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 42 solved, 1045 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 42 solved, 1045 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 42 solved, 1045 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/5 constraints. Problems are: Problem set: 42 solved, 1045 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 42 solved, 1045 unsolved
At refinement iteration 5 (OVERLAPS) 178/251 variables, 73/78 constraints. Problems are: Problem set: 42 solved, 1045 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 48/126 constraints. Problems are: Problem set: 42 solved, 1045 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1045/1171 constraints. Problems are: Problem set: 42 solved, 1045 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 251/251 variables, and 1171 constraints, problems are : Problem set: 42 solved, 1045 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1045/1087 constraints, Known Traps: 1/1 constraints]
After SMT, in 64076ms problems are : Problem set: 42 solved, 1045 unsolved
Search for dead transitions found 42 dead transitions in 64103ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 73/73 places, 1048/1090 transitions.
Applied a total of 0 rules in 70 ms. Remains 73 /73 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2024-06-01 05:33:01] [INFO ] Redundant transitions in 24 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64923 ms. Remains : 73/73 places, 1048/1090 transitions.
[2024-06-01 05:33:01] [INFO ] Flow matrix only has 174 transitions (discarded 874 similar events)
// Phase 1: matrix 174 rows 73 cols
[2024-06-01 05:33:01] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (8020 resets) in 3509 ms. (284 steps per ms)
BEST_FIRST walk for 1000000 steps (3321 resets) in 1488 ms. (671 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 05:33:06] [INFO ] Flow matrix only has 174 transitions (discarded 874 similar events)
[2024-06-01 05:33:06] [INFO ] Invariant cache hit.
[2024-06-01 05:33:06] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:33:06] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-01 05:33:06] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 05:33:06] [INFO ] [Real]Added 46 Read/Feed constraints in 26 ms returned sat
[2024-06-01 05:33:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:33:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:33:06] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-06-01 05:33:06] [INFO ] [Nat]Added 46 Read/Feed constraints in 29 ms returned sat
[2024-06-01 05:33:07] [INFO ] Computed and/alt/rep : 61/122/61 causal constraints (skipped 110 transitions) in 35 ms.
[2024-06-01 05:33:07] [INFO ] Added : 20 causal constraints over 5 iterations in 129 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1048/1048 transitions.
Applied a total of 0 rules in 81 ms. Remains 73 /73 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 73/73 places, 1048/1048 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1048/1048 transitions.
Applied a total of 0 rules in 60 ms. Remains 73 /73 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2024-06-01 05:33:07] [INFO ] Flow matrix only has 174 transitions (discarded 874 similar events)
[2024-06-01 05:33:07] [INFO ] Invariant cache hit.
[2024-06-01 05:33:07] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 05:33:07] [INFO ] Flow matrix only has 174 transitions (discarded 874 similar events)
[2024-06-01 05:33:07] [INFO ] Invariant cache hit.
[2024-06-01 05:33:07] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 05:33:08] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2024-06-01 05:33:08] [INFO ] Redundant transitions in 20 ms returned []
Running 1045 sub problems to find dead transitions.
[2024-06-01 05:33:08] [INFO ] Flow matrix only has 174 transitions (discarded 874 similar events)
[2024-06-01 05:33:08] [INFO ] Invariant cache hit.
[2024-06-01 05:33:08] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
Problem TDEAD567 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
At refinement iteration 4 (OVERLAPS) 174/247 variables, 73/77 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 46/123 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/123 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 247/247 variables, and 123 constraints, problems are : Problem set: 6 solved, 1039 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1045/1045 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1039 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
At refinement iteration 4 (OVERLAPS) 174/247 variables, 73/77 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 46/123 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 1039/1162 constraints. Problems are: Problem set: 6 solved, 1039 unsolved
[2024-06-01 05:34:05] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 247/247 variables, and 1163 constraints, problems are : Problem set: 6 solved, 1039 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1039/1045 constraints, Known Traps: 1/1 constraints]
After SMT, in 63265ms problems are : Problem set: 6 solved, 1039 unsolved
Search for dead transitions found 6 dead transitions in 63280ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 73/73 places, 1042/1048 transitions.
Applied a total of 0 rules in 40 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2024-06-01 05:34:11] [INFO ] Redundant transitions in 10 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64104 ms. Remains : 73/73 places, 1042/1048 transitions.
[2024-06-01 05:34:11] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:34:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (8022 resets) in 3406 ms. (293 steps per ms)
BEST_FIRST walk for 1000000 steps (3323 resets) in 1467 ms. (681 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 05:34:16] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:34:16] [INFO ] Invariant cache hit.
[2024-06-01 05:34:16] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 05:34:16] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-01 05:34:16] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 05:34:16] [INFO ] [Real]Added 46 Read/Feed constraints in 20 ms returned sat
[2024-06-01 05:34:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:34:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:34:16] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-01 05:34:16] [INFO ] [Nat]Added 46 Read/Feed constraints in 18 ms returned sat
[2024-06-01 05:34:16] [INFO ] Computed and/alt/rep : 61/122/61 causal constraints (skipped 110 transitions) in 33 ms.
[2024-06-01 05:34:16] [INFO ] Added : 20 causal constraints over 5 iterations in 127 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1042/1042 transitions.
Applied a total of 0 rules in 50 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 73/73 places, 1042/1042 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1042/1042 transitions.
Applied a total of 0 rules in 49 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2024-06-01 05:34:17] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:34:17] [INFO ] Invariant cache hit.
[2024-06-01 05:34:17] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-01 05:34:17] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:34:17] [INFO ] Invariant cache hit.
[2024-06-01 05:34:17] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 05:34:17] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2024-06-01 05:34:17] [INFO ] Redundant transitions in 14 ms returned []
Running 1039 sub problems to find dead transitions.
[2024-06-01 05:34:17] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:34:17] [INFO ] Invariant cache hit.
[2024-06-01 05:34:17] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 4 (OVERLAPS) 174/247 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 247/247 variables, and 123 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1039/1039 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1039 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 4 (OVERLAPS) 174/247 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 1039/1162 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 247/247 variables, and 1162 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1039/1039 constraints, Known Traps: 0/0 constraints]
After SMT, in 63305ms problems are : Problem set: 0 solved, 1039 unsolved
Search for dead transitions found 0 dead transitions in 63317ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63927 ms. Remains : 73/73 places, 1042/1042 transitions.
RANDOM walk for 40000 steps (320 resets) in 810 ms. (49 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (130 resets) in 349 ms. (114 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (132 resets) in 320 ms. (124 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 476849 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 2
Probabilistic random walk after 476849 steps, saw 133217 distinct states, run finished after 3004 ms. (steps per millisecond=158 ) properties seen :0
[2024-06-01 05:35:24] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:35:24] [INFO ] Invariant cache hit.
[2024-06-01 05:35:24] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 94/119 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/163 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 82/245 variables, 42/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 46/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/247 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 94/119 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/163 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 82/245 variables, 42/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/247 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/247 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 327ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1042/1042 transitions.
Applied a total of 0 rules in 41 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 73/73 places, 1042/1042 transitions.
RANDOM walk for 40000 steps (320 resets) in 419 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (130 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (130 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 429329 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 2
Probabilistic random walk after 429329 steps, saw 120870 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
[2024-06-01 05:35:28] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:35:28] [INFO ] Invariant cache hit.
[2024-06-01 05:35:28] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 94/119 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/163 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 82/245 variables, 42/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 46/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/247 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 94/119 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/163 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 82/245 variables, 42/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/247 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/247 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 517ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1042/1042 transitions.
Applied a total of 0 rules in 50 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 73/73 places, 1042/1042 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1042/1042 transitions.
Applied a total of 0 rules in 50 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2024-06-01 05:35:28] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:35:28] [INFO ] Invariant cache hit.
[2024-06-01 05:35:28] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-01 05:35:28] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:35:28] [INFO ] Invariant cache hit.
[2024-06-01 05:35:28] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 05:35:29] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
[2024-06-01 05:35:29] [INFO ] Redundant transitions in 14 ms returned []
Running 1039 sub problems to find dead transitions.
[2024-06-01 05:35:29] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:35:29] [INFO ] Invariant cache hit.
[2024-06-01 05:35:29] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 4 (OVERLAPS) 174/247 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 247/247 variables, and 123 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1039/1039 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1039 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 4 (OVERLAPS) 174/247 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 1039/1162 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 247/247 variables, and 1162 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1039/1039 constraints, Known Traps: 0/0 constraints]
After SMT, in 63359ms problems are : Problem set: 0 solved, 1039 unsolved
Search for dead transitions found 0 dead transitions in 63373ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64048 ms. Remains : 73/73 places, 1042/1042 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 868 transitions
Reduce isomorphic transitions removed 868 transitions.
Iterating post reduction 0 with 868 rules applied. Total rules applied 868 place count 73 transition count 174
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 870 place count 73 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 872 place count 71 transition count 172
Applied a total of 872 rules in 15 ms. Remains 71 /73 variables (removed 2) and now considering 172/1042 (removed 870) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 172 rows 71 cols
[2024-06-01 05:36:32] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 05:36:32] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 05:36:32] [INFO ] After 61ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-01 05:36:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 05:36:32] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 05:36:32] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 05:36:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 05:36:32] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 05:36:32] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 05:36:32] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 05:36:32] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 275 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for BridgeAndVehicles-PT-V20P10N50-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-01 05:36:32] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
// Phase 1: matrix 174 rows 73 cols
[2024-06-01 05:36:32] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (80 resets) in 52 ms. (188 steps per ms)
BEST_FIRST walk for 10000 steps (33 resets) in 23 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 05:36:33] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:36:33] [INFO ] Invariant cache hit.
[2024-06-01 05:36:33] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 05:36:33] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-01 05:36:33] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 05:36:33] [INFO ] [Real]Added 46 Read/Feed constraints in 26 ms returned sat
[2024-06-01 05:36:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:36:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:36:33] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-01 05:36:33] [INFO ] [Nat]Added 46 Read/Feed constraints in 18 ms returned sat
[2024-06-01 05:36:33] [INFO ] Computed and/alt/rep : 61/122/61 causal constraints (skipped 110 transitions) in 29 ms.
[2024-06-01 05:36:33] [INFO ] Added : 20 causal constraints over 5 iterations in 114 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1042/1042 transitions.
Applied a total of 0 rules in 50 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 73/73 places, 1042/1042 transitions.
[2024-06-01 05:36:33] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:36:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (8021 resets) in 3667 ms. (272 steps per ms)
BEST_FIRST walk for 1000000 steps (3325 resets) in 1497 ms. (667 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 05:36:38] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:36:38] [INFO ] Invariant cache hit.
[2024-06-01 05:36:38] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 05:36:38] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-01 05:36:38] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 05:36:38] [INFO ] [Real]Added 46 Read/Feed constraints in 23 ms returned sat
[2024-06-01 05:36:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:36:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 05:36:38] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 05:36:38] [INFO ] [Nat]Added 46 Read/Feed constraints in 14 ms returned sat
[2024-06-01 05:36:39] [INFO ] Computed and/alt/rep : 61/122/61 causal constraints (skipped 110 transitions) in 31 ms.
[2024-06-01 05:36:39] [INFO ] Added : 20 causal constraints over 5 iterations in 123 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1042/1042 transitions.
Applied a total of 0 rules in 50 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 73/73 places, 1042/1042 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1042/1042 transitions.
Applied a total of 0 rules in 49 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2024-06-01 05:36:39] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:36:39] [INFO ] Invariant cache hit.
[2024-06-01 05:36:39] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-06-01 05:36:39] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:36:39] [INFO ] Invariant cache hit.
[2024-06-01 05:36:39] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 05:36:40] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2024-06-01 05:36:40] [INFO ] Redundant transitions in 14 ms returned []
Running 1039 sub problems to find dead transitions.
[2024-06-01 05:36:40] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:36:40] [INFO ] Invariant cache hit.
[2024-06-01 05:36:40] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 4 (OVERLAPS) 174/247 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 247/247 variables, and 123 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1039/1039 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1039 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 4 (OVERLAPS) 174/247 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 1039/1162 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 247/247 variables, and 1162 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1039/1039 constraints, Known Traps: 0/0 constraints]
After SMT, in 63386ms problems are : Problem set: 0 solved, 1039 unsolved
Search for dead transitions found 0 dead transitions in 63403ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64074 ms. Remains : 73/73 places, 1042/1042 transitions.
RANDOM walk for 40000 steps (320 resets) in 270 ms. (147 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (131 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (130 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 448687 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 2
Probabilistic random walk after 448687 steps, saw 125836 distinct states, run finished after 3002 ms. (steps per millisecond=149 ) properties seen :0
[2024-06-01 05:37:46] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:37:46] [INFO ] Invariant cache hit.
[2024-06-01 05:37:46] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 94/119 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/163 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 82/245 variables, 42/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 46/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/247 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 94/119 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/163 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 82/245 variables, 42/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/247 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/247 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 415ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1042/1042 transitions.
Applied a total of 0 rules in 50 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 73/73 places, 1042/1042 transitions.
RANDOM walk for 40000 steps (320 resets) in 310 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (131 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (131 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 471712 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 2
Probabilistic random walk after 471712 steps, saw 131854 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
[2024-06-01 05:37:50] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:37:50] [INFO ] Invariant cache hit.
[2024-06-01 05:37:50] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 94/119 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/163 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 82/245 variables, 42/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 46/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/247 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 94/119 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/163 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 82/245 variables, 42/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/247 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/247 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 360ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1042/1042 transitions.
Applied a total of 0 rules in 37 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 73/73 places, 1042/1042 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1042/1042 transitions.
Applied a total of 0 rules in 38 ms. Remains 73 /73 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2024-06-01 05:37:50] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:37:50] [INFO ] Invariant cache hit.
[2024-06-01 05:37:50] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 05:37:50] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:37:50] [INFO ] Invariant cache hit.
[2024-06-01 05:37:51] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 05:37:51] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2024-06-01 05:37:51] [INFO ] Redundant transitions in 10 ms returned []
Running 1039 sub problems to find dead transitions.
[2024-06-01 05:37:51] [INFO ] Flow matrix only has 174 transitions (discarded 868 similar events)
[2024-06-01 05:37:51] [INFO ] Invariant cache hit.
[2024-06-01 05:37:51] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 4 (OVERLAPS) 174/247 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 247/247 variables, and 123 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1039/1039 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1039 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 4 (OVERLAPS) 174/247 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 1039/1162 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 247/247 variables, and 1162 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1039/1039 constraints, Known Traps: 0/0 constraints]
After SMT, in 62910ms problems are : Problem set: 0 solved, 1039 unsolved
Search for dead transitions found 0 dead transitions in 62920ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63514 ms. Remains : 73/73 places, 1042/1042 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 868 transitions
Reduce isomorphic transitions removed 868 transitions.
Iterating post reduction 0 with 868 rules applied. Total rules applied 868 place count 73 transition count 174
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 870 place count 73 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 872 place count 71 transition count 172
Applied a total of 872 rules in 5 ms. Remains 71 /73 variables (removed 2) and now considering 172/1042 (removed 870) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 172 rows 71 cols
[2024-06-01 05:38:54] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 05:38:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 05:38:54] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-01 05:38:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 05:38:54] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 05:38:54] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 05:38:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-01 05:38:54] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 05:38:54] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 05:38:54] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 05:38:54] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 209 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for BridgeAndVehicles-PT-V20P10N50-UpperBounds-13 in 141516 ms.
[2024-06-01 05:38:54] [INFO ] Flatten gal took : 93 ms
[2024-06-01 05:38:54] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-01 05:38:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 73 places, 1042 transitions and 7784 arcs took 9 ms.
Total runtime 436478 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-UpperBounds-13

BK_STOP 1717220334948

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name BridgeAndVehicles-PT-V20P10N50-UpperBounds-13
ub formula formula --maxsum=/tmp/781/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="UpperBounds"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-PT-V20P10N50, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399000197"
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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;