MCC'2024- Execution of r047-tajo-171620397800221

About the Execution of GreatSPN+red for BridgeAndVehicles-PT-V20P20N50

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
14057.300	577161.00	699604.00	198.80	20 20 1 20 20 20 20 1 20 1 1 1 20 0 1 20	normal

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.r047-tajo-171620397800221.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 greatspnxred
Input is BridgeAndVehicles-PT-V20P20N50, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397800221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 9.6K Apr 13 02:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 13 02:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 435K Apr 13 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 13 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 256K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 787K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 13 04:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 213K Apr 13 04:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.3M Apr 13 03:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.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.9M 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-V20P20N50-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716286540132

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P20N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:15:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 10:15:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:15:42] [INFO ] Load time of PNML (sax parser for PT used): 272 ms
[2024-05-21 10:15:42] [INFO ] Transformed 108 places.
[2024-05-21 10:15:42] [INFO ] Transformed 2228 transitions.
[2024-05-21 10:15:42] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 436 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Reduction of identical properties reduced properties to check from 16 to 13
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 20, 0, 0, 0, 0, 20, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 20, 0, 0, 0, 0, 20, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-21 10:15:42] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-05-21 10:15:42] [INFO ] Computed 7 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 20, 0, 0, 0, 0, 20, 0, 0] Max Struct:[20, 20, 2, 20, 20, 20, 1, 1, 1, 20, 1, 1]
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (57 resets) in 232 ms. (42 steps per ms)
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-05 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-01 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30019 steps (56 resets) in 96 ms. (309 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0] Max Struct:[2, 1]
[2024-05-21 10:15:42] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2024-05-21 10:15:42] [INFO ] Invariant cache hit.
[2024-05-21 10:15:43] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2024-05-21 10:15:43] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-21 10:15:43] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-21 10:15:43] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 10:15:43] [INFO ] [Real]Added 102 Read/Feed constraints in 60 ms returned sat
[2024-05-21 10:15:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:15:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 10:15:43] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-21 10:15:43] [INFO ] [Nat]Added 102 Read/Feed constraints in 26 ms returned sat
[2024-05-21 10:15:44] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 197 transitions) in 275 ms.
[2024-05-21 10:15:44] [INFO ] Added : 25 causal constraints over 6 iterations in 647 ms. Result :sat
Minimization took 219 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_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_40) 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.19 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
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 12 place count 95 transition count 1765
Iterating global reduction 10 with 1 rules applied. Total rules applied 13 place count 95 transition count 1765
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 16 place count 93 transition count 1764
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 18 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 20 place count 91 transition count 1762
Applied a total of 20 rules in 816 ms. Remains 91 /108 variables (removed 17) and now considering 1762/2186 (removed 424) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 867 ms. Remains : 91/108 places, 1762/2186 transitions.
[2024-05-21 10:15:46] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
// Phase 1: matrix 242 rows 91 cols
[2024-05-21 10:15:46] [INFO ] Computed 4 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (8021 resets) in 7565 ms. (132 steps per ms)
BEST_FIRST walk for 1000001 steps (3315 resets) in 2968 ms. (336 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 10:15:56] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
[2024-05-21 10:15:56] [INFO ] Invariant cache hit.
[2024-05-21 10:15:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 10:15:56] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-21 10:15:57] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-21 10:15:57] [INFO ] [Real]Added 80 Read/Feed constraints in 43 ms returned sat
[2024-05-21 10:15:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:15:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2024-05-21 10:15:57] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-21 10:15:57] [INFO ] [Nat]Added 80 Read/Feed constraints in 18 ms returned sat
[2024-05-21 10:15:57] [INFO ] Computed and/alt/rep : 79/156/79 causal constraints (skipped 160 transitions) in 70 ms.
[2024-05-21 10:15:57] [INFO ] Added : 27 causal constraints over 7 iterations in 211 ms. Result :sat
Minimization took 113 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 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 1762/1762 transitions.
Applied a total of 0 rules in 175 ms. Remains 91 /91 variables (removed 0) and now considering 1762/1762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 91/91 places, 1762/1762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 1762/1762 transitions.
Applied a total of 0 rules in 202 ms. Remains 91 /91 variables (removed 0) and now considering 1762/1762 (removed 0) transitions.
[2024-05-21 10:15:58] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
[2024-05-21 10:15:58] [INFO ] Invariant cache hit.
[2024-05-21 10:15:59] [INFO ] Implicit Places using invariants in 986 ms returned []
[2024-05-21 10:15:59] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
[2024-05-21 10:15:59] [INFO ] Invariant cache hit.
[2024-05-21 10:15:59] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-21 10:15:59] [INFO ] Implicit Places using invariants and state equation in 790 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1795 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 89/91 places, 1762/1762 transitions.
Applied a total of 0 rules in 135 ms. Remains 89 /89 variables (removed 0) and now considering 1762/1762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2148 ms. Remains : 89/91 places, 1762/1762 transitions.
[2024-05-21 10:16:00] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
// Phase 1: matrix 242 rows 89 cols
[2024-05-21 10:16:00] [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 (8020 resets) in 5919 ms. (168 steps per ms)
BEST_FIRST walk for 1000000 steps (3314 resets) in 2684 ms. (372 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 10:16:08] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
[2024-05-21 10:16:08] [INFO ] Invariant cache hit.
[2024-05-21 10:16:08] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 10:16:08] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-21 10:16:08] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-21 10:16:08] [INFO ] [Real]Added 80 Read/Feed constraints in 34 ms returned sat
[2024-05-21 10:16:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:16:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 10:16:08] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-21 10:16:08] [INFO ] [Nat]Added 80 Read/Feed constraints in 24 ms returned sat
[2024-05-21 10:16:09] [INFO ] Computed and/alt/rep : 79/156/79 causal constraints (skipped 160 transitions) in 80 ms.
[2024-05-21 10:16:09] [INFO ] Added : 31 causal constraints over 7 iterations in 384 ms. Result :sat
Minimization took 141 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 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1762/1762 transitions.
Applied a total of 0 rules in 116 ms. Remains 89 /89 variables (removed 0) and now considering 1762/1762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 89/89 places, 1762/1762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1762/1762 transitions.
Applied a total of 0 rules in 114 ms. Remains 89 /89 variables (removed 0) and now considering 1762/1762 (removed 0) transitions.
[2024-05-21 10:16:09] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
[2024-05-21 10:16:09] [INFO ] Invariant cache hit.
[2024-05-21 10:16:10] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-21 10:16:10] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
[2024-05-21 10:16:10] [INFO ] Invariant cache hit.
[2024-05-21 10:16:10] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-21 10:16:11] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
[2024-05-21 10:16:11] [INFO ] Redundant transitions in 116 ms returned []
Running 1759 sub problems to find dead transitions.
[2024-05-21 10:16:11] [INFO ] Flow matrix only has 242 transitions (discarded 1520 similar events)
[2024-05-21 10:16:11] [INFO ] Invariant cache hit.
[2024-05-21 10:16:11] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1759 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1759 unsolved
[2024-05-21 10:16:40] [INFO ] Deduced a trap composed of 42 places in 188 ms of which 10 ms to minimize.
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1562 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 89/331 variables, and 5 constraints, problems are : Problem set: 36 solved, 1723 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/89 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 1759/1759 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 36 solved, 1723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 36 solved, 1723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 36 solved, 1723 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 36 solved, 1723 unsolved
Problem TDEAD1602 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1722 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/5 constraints. Problems are: Problem set: 40 solved, 1719 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 40 solved, 1719 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 5 (OVERLAPS) 242/331 variables, 89/94 constraints. Problems are: Problem set: 42 solved, 1717 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 80/174 constraints. Problems are: Problem set: 42 solved, 1717 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 331/331 variables, and 1891 constraints, problems are : Problem set: 42 solved, 1717 unsolved in 33283 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1717/1759 constraints, Known Traps: 1/1 constraints]
After SMT, in 74708ms problems are : Problem set: 42 solved, 1717 unsolved
Search for dead transitions found 42 dead transitions in 74751ms
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 : 89/89 places, 1720/1762 transitions.
Applied a total of 0 rules in 135 ms. Remains 89 /89 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
[2024-05-21 10:17:26] [INFO ] Redundant transitions in 101 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 76342 ms. Remains : 89/89 places, 1720/1762 transitions.
[2024-05-21 10:17:26] [INFO ] Flow matrix only has 238 transitions (discarded 1482 similar events)
// Phase 1: matrix 238 rows 89 cols
[2024-05-21 10:17:26] [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 6401 ms. (156 steps per ms)
BEST_FIRST walk for 1000000 steps (3320 resets) in 2601 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 10:17:35] [INFO ] Flow matrix only has 238 transitions (discarded 1482 similar events)
[2024-05-21 10:17:35] [INFO ] Invariant cache hit.
[2024-05-21 10:17:35] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 10:17:35] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-21 10:17:35] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 10:17:35] [INFO ] [Real]Added 78 Read/Feed constraints in 29 ms returned sat
[2024-05-21 10:17:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:17:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 10:17:35] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-21 10:17:35] [INFO ] [Nat]Added 78 Read/Feed constraints in 27 ms returned sat
[2024-05-21 10:17:35] [INFO ] Computed and/alt/rep : 77/154/77 causal constraints (skipped 158 transitions) in 66 ms.
[2024-05-21 10:17:35] [INFO ] Added : 32 causal constraints over 8 iterations in 395 ms. Result :sat
Minimization took 142 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 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1720/1720 transitions.
Applied a total of 0 rules in 166 ms. Remains 89 /89 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 89/89 places, 1720/1720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1720/1720 transitions.
Applied a total of 0 rules in 148 ms. Remains 89 /89 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
[2024-05-21 10:17:36] [INFO ] Flow matrix only has 238 transitions (discarded 1482 similar events)
[2024-05-21 10:17:36] [INFO ] Invariant cache hit.
[2024-05-21 10:17:36] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-21 10:17:36] [INFO ] Flow matrix only has 238 transitions (discarded 1482 similar events)
[2024-05-21 10:17:36] [INFO ] Invariant cache hit.
[2024-05-21 10:17:36] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 10:17:37] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2024-05-21 10:17:37] [INFO ] Redundant transitions in 39 ms returned []
Running 1717 sub problems to find dead transitions.
[2024-05-21 10:17:37] [INFO ] Flow matrix only has 238 transitions (discarded 1482 similar events)
[2024-05-21 10:17:37] [INFO ] Invariant cache hit.
[2024-05-21 10:17:37] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 89/327 variables, and 4 constraints, problems are : Problem set: 0 solved, 1717 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/89 constraints, ReadFeed: 0/78 constraints, PredecessorRefiner: 1717/1717 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1717 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1717 unsolved
Problem TDEAD599 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
At refinement iteration 4 (OVERLAPS) 238/327 variables, 89/93 constraints. Problems are: Problem set: 255 solved, 1462 unsolved
SMT process timed out in 70861ms, After SMT, problems are : Problem set: 255 solved, 1462 unsolved
Search for dead transitions found 255 dead transitions in 70887ms
Found 255 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 255 transitions
Dead transitions reduction (with SMT) removed 255 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 89/89 places, 1465/1720 transitions.
Applied a total of 0 rules in 74 ms. Remains 89 /89 variables (removed 0) and now considering 1465/1465 (removed 0) transitions.
[2024-05-21 10:18:48] [INFO ] Redundant transitions in 21 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 72152 ms. Remains : 89/89 places, 1465/1720 transitions.
[2024-05-21 10:18:48] [INFO ] Flow matrix only has 238 transitions (discarded 1227 similar events)
[2024-05-21 10:18:48] [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 5171 ms. (193 steps per ms)
BEST_FIRST walk for 1000001 steps (3322 resets) in 2280 ms. (438 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 10:18:56] [INFO ] Flow matrix only has 238 transitions (discarded 1227 similar events)
[2024-05-21 10:18:56] [INFO ] Invariant cache hit.
[2024-05-21 10:18:56] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 10:18:56] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-21 10:18:56] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 10:18:56] [INFO ] [Real]Added 78 Read/Feed constraints in 29 ms returned sat
[2024-05-21 10:18:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:18:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 10:18:56] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-21 10:18:56] [INFO ] [Nat]Added 78 Read/Feed constraints in 23 ms returned sat
[2024-05-21 10:18:56] [INFO ] Computed and/alt/rep : 77/154/77 causal constraints (skipped 158 transitions) in 48 ms.
[2024-05-21 10:18:56] [INFO ] Added : 32 causal constraints over 8 iterations in 193 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 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1465/1465 transitions.
Applied a total of 0 rules in 87 ms. Remains 89 /89 variables (removed 0) and now considering 1465/1465 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 89/89 places, 1465/1465 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1465/1465 transitions.
Applied a total of 0 rules in 87 ms. Remains 89 /89 variables (removed 0) and now considering 1465/1465 (removed 0) transitions.
[2024-05-21 10:18:56] [INFO ] Flow matrix only has 238 transitions (discarded 1227 similar events)
[2024-05-21 10:18:56] [INFO ] Invariant cache hit.
[2024-05-21 10:18:57] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-21 10:18:57] [INFO ] Flow matrix only has 238 transitions (discarded 1227 similar events)
[2024-05-21 10:18:57] [INFO ] Invariant cache hit.
[2024-05-21 10:18:57] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 10:18:58] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
[2024-05-21 10:18:58] [INFO ] Redundant transitions in 45 ms returned []
Running 1462 sub problems to find dead transitions.
[2024-05-21 10:18:58] [INFO ] Flow matrix only has 238 transitions (discarded 1227 similar events)
[2024-05-21 10:18:58] [INFO ] Invariant cache hit.
[2024-05-21 10:18:58] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1462 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1462 unsolved
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
At refinement iteration 4 (OVERLAPS) 238/327 variables, 89/93 constraints. Problems are: Problem set: 87 solved, 1375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 78/171 constraints. Problems are: Problem set: 87 solved, 1375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 327/327 variables, and 171 constraints, problems are : Problem set: 87 solved, 1375 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1462/1462 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 87 solved, 1375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 87 solved, 1375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 87 solved, 1375 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 87 solved, 1375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 87 solved, 1375 unsolved
At refinement iteration 4 (OVERLAPS) 238/327 variables, 89/93 constraints. Problems are: Problem set: 87 solved, 1375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 78/171 constraints. Problems are: Problem set: 87 solved, 1375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 1546 constraints, problems are : Problem set: 87 solved, 1375 unsolved in 30807 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1375/1462 constraints, Known Traps: 0/0 constraints]
After SMT, in 68391ms problems are : Problem set: 87 solved, 1375 unsolved
Search for dead transitions found 87 dead transitions in 68418ms
Found 87 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 87 transitions
Dead transitions reduction (with SMT) removed 87 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 89/89 places, 1378/1465 transitions.
Applied a total of 0 rules in 70 ms. Remains 89 /89 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
[2024-05-21 10:20:06] [INFO ] Redundant transitions in 18 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69816 ms. Remains : 89/89 places, 1378/1465 transitions.
[2024-05-21 10:20:06] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:20:06] [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 5000 ms. (199 steps per ms)
BEST_FIRST walk for 1000001 steps (3323 resets) in 2065 ms. (484 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 10:20:13] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:20:13] [INFO ] Invariant cache hit.
[2024-05-21 10:20:13] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 10:20:13] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-21 10:20:13] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 10:20:13] [INFO ] [Real]Added 78 Read/Feed constraints in 25 ms returned sat
[2024-05-21 10:20:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:20:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 10:20:13] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-21 10:20:14] [INFO ] [Nat]Added 78 Read/Feed constraints in 31 ms returned sat
[2024-05-21 10:20:14] [INFO ] Computed and/alt/rep : 77/154/77 causal constraints (skipped 158 transitions) in 43 ms.
[2024-05-21 10:20:14] [INFO ] Added : 32 causal constraints over 8 iterations in 211 ms. Result :sat
Minimization took 105 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 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1378/1378 transitions.
Applied a total of 0 rules in 65 ms. Remains 89 /89 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 89/89 places, 1378/1378 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1378/1378 transitions.
Applied a total of 0 rules in 65 ms. Remains 89 /89 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
[2024-05-21 10:20:14] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:20:14] [INFO ] Invariant cache hit.
[2024-05-21 10:20:14] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-21 10:20:14] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:20:14] [INFO ] Invariant cache hit.
[2024-05-21 10:20:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 10:20:15] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
[2024-05-21 10:20:15] [INFO ] Redundant transitions in 37 ms returned []
Running 1375 sub problems to find dead transitions.
[2024-05-21 10:20:15] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:20:15] [INFO ] Invariant cache hit.
[2024-05-21 10:20:15] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 4 (OVERLAPS) 238/327 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 327/327 variables, and 171 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1375/1375 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 4 (OVERLAPS) 238/327 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 1375/1546 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 1546 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1375/1375 constraints, Known Traps: 0/0 constraints]
After SMT, in 66635ms problems are : Problem set: 0 solved, 1375 unsolved
Search for dead transitions found 0 dead transitions in 66653ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67868 ms. Remains : 89/89 places, 1378/1378 transitions.
RANDOM walk for 40000 steps (320 resets) in 1067 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (132 resets) in 400 ms. (99 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (131 resets) in 354 ms. (112 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 324875 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 2
Probabilistic random walk after 324875 steps, saw 92090 distinct states, run finished after 3006 ms. (steps per millisecond=108 ) properties seen :0
[2024-05-21 10:21:26] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:21:26] [INFO ] Invariant cache hit.
[2024-05-21 10:21:26] [INFO ] State equation strengthened by 78 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 158/199 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/243 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 82/325 variables, 42/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/327 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/327 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 171 constraints, problems are : Problem set: 0 solved, 2 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 158/199 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/243 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 82/325 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/327 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/327 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 173 constraints, problems are : Problem set: 0 solved, 2 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 689ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 193 ms.
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1378/1378 transitions.
Applied a total of 0 rules in 90 ms. Remains 89 /89 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 89/89 places, 1378/1378 transitions.
RANDOM walk for 40000 steps (320 resets) in 468 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (131 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (129 resets) in 176 ms. (225 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 313816 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 2
Probabilistic random walk after 313816 steps, saw 89281 distinct states, run finished after 3003 ms. (steps per millisecond=104 ) properties seen :0
[2024-05-21 10:21:30] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:21:30] [INFO ] Invariant cache hit.
[2024-05-21 10:21:30] [INFO ] State equation strengthened by 78 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 158/199 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/243 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 82/325 variables, 42/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/327 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/327 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 171 constraints, problems are : Problem set: 0 solved, 2 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 158/199 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/243 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 82/325 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/327 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/327 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 173 constraints, problems are : Problem set: 0 solved, 2 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 539ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 141 ms.
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1378/1378 transitions.
Applied a total of 0 rules in 72 ms. Remains 89 /89 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 89/89 places, 1378/1378 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1378/1378 transitions.
Applied a total of 0 rules in 64 ms. Remains 89 /89 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
[2024-05-21 10:21:31] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:21:31] [INFO ] Invariant cache hit.
[2024-05-21 10:21:31] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-21 10:21:31] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:21:31] [INFO ] Invariant cache hit.
[2024-05-21 10:21:31] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 10:21:31] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2024-05-21 10:21:31] [INFO ] Redundant transitions in 18 ms returned []
Running 1375 sub problems to find dead transitions.
[2024-05-21 10:21:32] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:21:32] [INFO ] Invariant cache hit.
[2024-05-21 10:21:32] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 4 (OVERLAPS) 238/327 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 327/327 variables, and 171 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1375/1375 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 4 (OVERLAPS) 238/327 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 1375/1546 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 1546 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1375/1375 constraints, Known Traps: 0/0 constraints]
After SMT, in 66693ms problems are : Problem set: 0 solved, 1375 unsolved
Search for dead transitions found 0 dead transitions in 66709ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67580 ms. Remains : 89/89 places, 1378/1378 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1140 transitions
Reduce isomorphic transitions removed 1140 transitions.
Iterating post reduction 0 with 1140 rules applied. Total rules applied 1140 place count 89 transition count 238
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1142 place count 89 transition count 236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1144 place count 87 transition count 236
Applied a total of 1144 rules in 26 ms. Remains 87 /89 variables (removed 2) and now considering 236/1378 (removed 1142) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 236 rows 87 cols
[2024-05-21 10:22:38] [INFO ] Computed 4 invariants in 4 ms
[2024-05-21 10:22:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 10:22:38] [INFO ] After 84ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-21 10:22:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 10:22:38] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 10:22:38] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 10:22:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 10:22:38] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 10:22:39] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 10:22:39] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 10:22:39] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 345 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for BridgeAndVehicles-PT-V20P20N50-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-05-21 10:22:39] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
// Phase 1: matrix 238 rows 89 cols
[2024-05-21 10:22:39] [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 70 ms. (140 steps per ms)
BEST_FIRST walk for 10000 steps (32 resets) in 31 ms. (312 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 10:22:39] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:22:39] [INFO ] Invariant cache hit.
[2024-05-21 10:22:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 10:22:39] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-21 10:22:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 10:22:39] [INFO ] [Real]Added 78 Read/Feed constraints in 23 ms returned sat
[2024-05-21 10:22:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:22:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 10:22:39] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-21 10:22:39] [INFO ] [Nat]Added 78 Read/Feed constraints in 27 ms returned sat
[2024-05-21 10:22:39] [INFO ] Computed and/alt/rep : 77/154/77 causal constraints (skipped 158 transitions) in 54 ms.
[2024-05-21 10:22:39] [INFO ] Added : 32 causal constraints over 8 iterations in 199 ms. Result :sat
Minimization took 101 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 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1378/1378 transitions.
Applied a total of 0 rules in 87 ms. Remains 89 /89 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 89/89 places, 1378/1378 transitions.
[2024-05-21 10:22:40] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:22:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (8020 resets) in 5442 ms. (183 steps per ms)
BEST_FIRST walk for 1000001 steps (3322 resets) in 2098 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 10:22:47] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:22:47] [INFO ] Invariant cache hit.
[2024-05-21 10:22:47] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 10:22:47] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-21 10:22:47] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 10:22:47] [INFO ] [Real]Added 78 Read/Feed constraints in 26 ms returned sat
[2024-05-21 10:22:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:22:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 10:22:47] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-21 10:22:47] [INFO ] [Nat]Added 78 Read/Feed constraints in 27 ms returned sat
[2024-05-21 10:22:47] [INFO ] Computed and/alt/rep : 77/154/77 causal constraints (skipped 158 transitions) in 42 ms.
[2024-05-21 10:22:48] [INFO ] Added : 32 causal constraints over 8 iterations in 210 ms. Result :sat
Minimization took 108 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 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1378/1378 transitions.
Applied a total of 0 rules in 66 ms. Remains 89 /89 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 89/89 places, 1378/1378 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1378/1378 transitions.
Applied a total of 0 rules in 64 ms. Remains 89 /89 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
[2024-05-21 10:22:48] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:22:48] [INFO ] Invariant cache hit.
[2024-05-21 10:22:48] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-21 10:22:48] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:22:48] [INFO ] Invariant cache hit.
[2024-05-21 10:22:48] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 10:22:49] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
[2024-05-21 10:22:49] [INFO ] Redundant transitions in 38 ms returned []
Running 1375 sub problems to find dead transitions.
[2024-05-21 10:22:49] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:22:49] [INFO ] Invariant cache hit.
[2024-05-21 10:22:49] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 4 (OVERLAPS) 238/327 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 327/327 variables, and 171 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1375/1375 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 4 (OVERLAPS) 238/327 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 1546 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 30415 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1375/1375 constraints, Known Traps: 0/0 constraints]
After SMT, in 67475ms problems are : Problem set: 0 solved, 1375 unsolved
Search for dead transitions found 0 dead transitions in 67507ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68776 ms. Remains : 89/89 places, 1378/1378 transitions.
RANDOM walk for 40000 steps (320 resets) in 580 ms. (68 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (131 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (132 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 273811 steps, run timeout after 3002 ms. (steps per millisecond=91 ) properties seen :0 out of 2
Probabilistic random walk after 273811 steps, saw 78046 distinct states, run finished after 3004 ms. (steps per millisecond=91 ) properties seen :0
[2024-05-21 10:24:00] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:24:00] [INFO ] Invariant cache hit.
[2024-05-21 10:24:00] [INFO ] State equation strengthened by 78 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 158/199 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/243 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 82/325 variables, 42/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/327 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/327 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 171 constraints, problems are : Problem set: 0 solved, 2 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 158/199 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/243 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 82/325 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/327 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/327 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 173 constraints, problems are : Problem set: 0 solved, 2 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 513ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 145 ms.
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1378/1378 transitions.
Applied a total of 0 rules in 70 ms. Remains 89 /89 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 89/89 places, 1378/1378 transitions.
RANDOM walk for 40000 steps (320 resets) in 451 ms. (88 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (131 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (131 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 333214 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 2
Probabilistic random walk after 333214 steps, saw 94332 distinct states, run finished after 3002 ms. (steps per millisecond=110 ) properties seen :0
[2024-05-21 10:24:04] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:24:04] [INFO ] Invariant cache hit.
[2024-05-21 10:24:04] [INFO ] State equation strengthened by 78 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 158/199 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/243 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 82/325 variables, 42/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/327 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/327 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 171 constraints, problems are : Problem set: 0 solved, 2 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 158/199 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/243 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 82/325 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/327 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/327 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 173 constraints, problems are : Problem set: 0 solved, 2 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 548ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 135 ms.
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1378/1378 transitions.
Applied a total of 0 rules in 67 ms. Remains 89 /89 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 89/89 places, 1378/1378 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1378/1378 transitions.
Applied a total of 0 rules in 65 ms. Remains 89 /89 variables (removed 0) and now considering 1378/1378 (removed 0) transitions.
[2024-05-21 10:24:05] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:24:05] [INFO ] Invariant cache hit.
[2024-05-21 10:24:05] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-21 10:24:05] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:24:05] [INFO ] Invariant cache hit.
[2024-05-21 10:24:05] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 10:24:06] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
[2024-05-21 10:24:06] [INFO ] Redundant transitions in 17 ms returned []
Running 1375 sub problems to find dead transitions.
[2024-05-21 10:24:06] [INFO ] Flow matrix only has 238 transitions (discarded 1140 similar events)
[2024-05-21 10:24:06] [INFO ] Invariant cache hit.
[2024-05-21 10:24:06] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 4 (OVERLAPS) 238/327 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 327/327 variables, and 171 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1375/1375 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 4 (OVERLAPS) 238/327 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 1546 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 30152 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1375/1375 constraints, Known Traps: 0/0 constraints]
After SMT, in 68017ms problems are : Problem set: 0 solved, 1375 unsolved
Search for dead transitions found 0 dead transitions in 68030ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68944 ms. Remains : 89/89 places, 1378/1378 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1140 transitions
Reduce isomorphic transitions removed 1140 transitions.
Iterating post reduction 0 with 1140 rules applied. Total rules applied 1140 place count 89 transition count 238
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1142 place count 89 transition count 236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1144 place count 87 transition count 236
Applied a total of 1144 rules in 24 ms. Remains 87 /89 variables (removed 2) and now considering 236/1378 (removed 1142) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 236 rows 87 cols
[2024-05-21 10:25:14] [INFO ] Computed 4 invariants in 3 ms
[2024-05-21 10:25:14] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 10:25:14] [INFO ] After 87ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-21 10:25:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 10:25:14] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 10:25:14] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 10:25:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 10:25:14] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 10:25:14] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 10:25:14] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 10:25:14] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 378 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for BridgeAndVehicles-PT-V20P20N50-UpperBounds-13 in 155531 ms.
[2024-05-21 10:25:15] [INFO ] Flatten gal took : 166 ms
[2024-05-21 10:25:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-21 10:25:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 89 places, 1378 transitions and 10344 arcs took 15 ms.
Total runtime 573264 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V20P20N50

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 89
TRANSITIONS: 1378
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.058s, Sys 0.003s]

SAVING FILE /home/mcc/execution/417/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]

----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 830
MODEL NAME: /home/mcc/execution/417/model
89 places, 1378 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V20P20N50-UpperBounds-13 0 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716287117293

--------------------
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

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-V20P20N50"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BridgeAndVehicles-PT-V20P20N50, 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 r047-tajo-171620397800221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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