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-171620397500118.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-COL-V80P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397500118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.4K Apr 13 01:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 13 01:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 13 00:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 13 00:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 13 01:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 13 01:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 45K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716280491133

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P20N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 08:34:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 08:34:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:34:52] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 08:34:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 08:34:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 561 ms
[2024-05-21 08:34:53] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 08:34:53] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 13 ms.
[2024-05-21 08:34:53] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 40000 steps (8 resets) in 1613 ms. (24 steps per ms) remains 10/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 131 ms. (303 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 330 ms. (120 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 714 ms. (55 steps per ms) remains 9/9 properties
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 08:34:54] [INFO ] Computed 4 invariants in 6 ms
Problem BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-00 is UNSAT
Problem BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-01 is UNSAT
Problem BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-03 is UNSAT
Problem BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-04 is UNSAT
Problem BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-06 is UNSAT
Problem BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-07 is UNSAT
Problem BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-08 is UNSAT
Problem BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-12 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 8 solved, 1 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/15 variables, 9/12 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/21 variables, 2/14 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 1/15 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/15 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/22 variables, 1/16 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22 variables, 1/17 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/22 variables, 0/17 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 17 constraints, problems are : Problem set: 8 solved, 1 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 250ms problems are : Problem set: 8 solved, 1 unsolved
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=120 )
Parikh walk visited 1 properties in 6 ms.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-21 08:34:54] [INFO ] Flatten gal took : 12 ms
[2024-05-21 08:34:54] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-00 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-01 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-03 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-04 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-06 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-07 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-08 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-09 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-12 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-14 FALSE TECHNIQUES CPN_APPROX
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 08:34:55] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 86 ms.
[2024-05-21 08:34:55] [INFO ] Unfolded 16 HLPN properties in 1 ms.
RANDOM walk for 40000 steps (56 resets) in 1503 ms. (26 steps per ms) remains 1/6 properties
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (16 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
[2024-05-21 08:34:55] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-05-21 08:34:55] [INFO ] Computed 7 invariants in 35 ms
[2024-05-21 08:34:55] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 324/333 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/545 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 22/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/547 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/547 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/547 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/558 variables, 11/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/558 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/558 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/558 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 324/333 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/545 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 22/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/547 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/547 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/558 variables, 11/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/558 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/558 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/558 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 892ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 357 ms.
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 469 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
Running 2104 sub problems to find dead transitions.
[2024-05-21 08:34:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-21 08:34:57] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 08:34:57] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-21 08:35:23] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20095 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-21 08:35:51] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 2 ms to minimize.
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 7 constraints, problems are : Problem set: 80 solved, 2024 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 2/2 constraints]
After SMT, in 55140ms problems are : Problem set: 80 solved, 2024 unsolved
Search for dead transitions found 80 dead transitions in 55178ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 185/188 places, 2027/2108 transitions.
Applied a total of 0 rules in 155 ms. Remains 185 /185 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55830 ms. Remains : 185/188 places, 2027/2108 transitions.
RANDOM walk for 40000 steps (64 resets) in 515 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (17 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 337997 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 337997 steps, saw 101094 distinct states, run finished after 3005 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-21 08:35:55] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 185 cols
[2024-05-21 08:35:55] [INFO ] Computed 5 invariants in 7 ms
[2024-05-21 08:35:55] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 243/247 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 268/515 variables, 166/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 10/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/519 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/519 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/553 variables, 15/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/553 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 11/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 243/247 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 268/515 variables, 166/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 10/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/519 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/519 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 34/553 variables, 15/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 528 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 185/185 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 764ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 233 ms.
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2027/2027 transitions.
Applied a total of 0 rules in 166 ms. Remains 185 /185 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 185/185 places, 2027/2027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2027/2027 transitions.
Applied a total of 0 rules in 162 ms. Remains 185 /185 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-05-21 08:35:57] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:35:57] [INFO ] Invariant cache hit.
[2024-05-21 08:35:57] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-21 08:35:57] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:35:57] [INFO ] Invariant cache hit.
[2024-05-21 08:35:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 08:35:58] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1574 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/185 places, 2027/2027 transitions.
Applied a total of 0 rules in 181 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1920 ms. Remains : 183/185 places, 2027/2027 transitions.
RANDOM walk for 40000 steps (64 resets) in 397 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (16 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 354615 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 1
Probabilistic random walk after 354615 steps, saw 106328 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2024-05-21 08:36:02] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 183 cols
[2024-05-21 08:36:02] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 08:36:02] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 243/247 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 266/513 variables, 164/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 10/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/517 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/551 variables, 15/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/551 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/551 variables, 11/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/551 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 243/247 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 266/513 variables, 164/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 10/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/517 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/517 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 34/551 variables, 15/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/551 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 11/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/551 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/551 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 805ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 134 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 183/183 places, 2027/2027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2027/2027 transitions.
Applied a total of 0 rules in 122 ms. Remains 183 /183 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
[2024-05-21 08:36:03] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:36:03] [INFO ] Invariant cache hit.
[2024-05-21 08:36:03] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-21 08:36:03] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:36:03] [INFO ] Invariant cache hit.
[2024-05-21 08:36:03] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 08:36:04] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
[2024-05-21 08:36:04] [INFO ] Redundant transitions in 124 ms returned []
Running 2024 sub problems to find dead transitions.
[2024-05-21 08:36:04] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
[2024-05-21 08:36:04] [INFO ] Invariant cache hit.
[2024-05-21 08:36:04] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 08:36:28] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2024/2024 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/551 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 74014ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 74038ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75807 ms. Remains : 183/183 places, 2027/2027 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1659 transitions
Reduce isomorphic transitions removed 1659 transitions.
Iterating post reduction 0 with 1659 rules applied. Total rules applied 1659 place count 183 transition count 368
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1663 place count 181 transition count 366
Applied a total of 1663 rules in 31 ms. Remains 181 /183 variables (removed 2) and now considering 366/2027 (removed 1661) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 366 rows 181 cols
[2024-05-21 08:37:19] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 08:37:19] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 08:37:19] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 08:37:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 08:37:19] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 08:37:19] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 08:37:19] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 786 ms.
[2024-05-21 08:37:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-21 08:37:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 183 places, 2027 transitions and 14984 arcs took 24 ms.
[2024-05-21 08:37:20] [INFO ] Flatten gal took : 254 ms
Total runtime 147571 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-COL-V80P20N10

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: 183
TRANSITIONS: 2027
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.103s, Sys 0.008s]


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


----------------------------------------------------------------------
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: 646
MODEL NAME: /home/mcc/execution/417/model
183 places, 2027 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-COL-V80P20N10-ReachabilityCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716280648506

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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-COL-V80P20N10"
export BK_EXAMINATION="ReachabilityCardinality"
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-COL-V80P20N10, examination is ReachabilityCardinality"
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-171620397500118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P20N10.tgz
mv BridgeAndVehicles-COL-V80P20N10 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;