fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r047-tajo-171620397500113
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for BridgeAndVehicles-COL-V80P20N10

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16206.504 2252871.00 7171160.00 1085.40 ?FFTF???TF?F?FFT 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-171620397500113.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397500113
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716279999987

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
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:26:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 08:26:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:26:42] [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:26:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 08:26:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 841 ms
[2024-05-21 08:26:43] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 49 ms.
[2024-05-21 08:26:43] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 14 ms.
[2024-05-21 08:26:43] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.0 ms
RANDOM walk for 40000 steps (8 resets) in 4667 ms. (8 steps per ms) remains 21/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 207 ms. (19 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 100 ms. (39 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 08:26:45] [INFO ] Computed 4 invariants in 6 ms
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp41 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 16 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
At refinement iteration 2 (OVERLAPS) 2/12 variables, 2/4 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 19 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 19 solved, 2 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 3/3 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/15 variables, 9/12 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/21 variables, 2/14 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 2/16 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/16 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/22 variables, 1/17 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22 variables, 1/18 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 19 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 18 constraints, problems are : Problem set: 19 solved, 2 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 2/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 491ms problems are : Problem set: 19 solved, 2 unsolved
Finished Parikh walk after 93 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=93 )
Parikh walk visited 2 properties in 45 ms.
Successfully simplified 19 atomic propositions for a total of 14 simplifications.
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 08:26:45] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-21 08:26:45] [INFO ] Flatten gal took : 36 ms
[2024-05-21 08:26:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 08:26:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 08:26:45] [INFO ] Flatten gal took : 13 ms
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:26:46] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 241 ms.
[2024-05-21 08:26:46] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Support contains 15 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 100 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2024-05-21 08:26:46] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-05-21 08:26:46] [INFO ] Computed 7 invariants in 53 ms
[2024-05-21 08:26:46] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/558 variables, and 5 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20095 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 08:27:29] [INFO ] Deduced a trap composed of 5 places in 816 ms of which 36 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/558 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 1/1 constraints]
After SMT, in 57588ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 57688ms
[2024-05-21 08:27:44] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 08:27:44] [INFO ] Invariant cache hit.
[2024-05-21 08:27:44] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-05-21 08:27:44] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 08:27:44] [INFO ] Invariant cache hit.
[2024-05-21 08:27:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 08:27:47] [INFO ] Implicit Places using invariants and state equation in 3197 ms returned []
Implicit Place search using SMT with State Equation took 3776 ms to find 0 implicit places.
Running 2105 sub problems to find dead transitions.
[2024-05-21 08:27:47] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 08:27:47] [INFO ] Invariant cache hit.
[2024-05-21 08:27:47] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 08:28:16] [INFO ] Deduced a trap composed of 5 places in 388 ms of which 2 ms to minimize.
[2024-05-21 08:28:33] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 2 ms to minimize.
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
Problem TDEAD1227 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/558 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 80 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 2/7 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/558 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 2/2 constraints]
After SMT, in 76809ms problems are : Problem set: 80 solved, 2025 unsolved
Search for dead transitions found 80 dead transitions in 76859ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in LTL mode, iteration 1 : 188/188 places, 2028/2108 transitions.
Applied a total of 0 rules in 25 ms. Remains 188 /188 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138520 ms. Remains : 188/188 places, 2028/2108 transitions.
Support contains 15 out of 188 places after structural reductions.
[2024-05-21 08:29:04] [INFO ] Flatten gal took : 151 ms
[2024-05-21 08:29:05] [INFO ] Flatten gal took : 144 ms
[2024-05-21 08:29:05] [INFO ] Input system was already deterministic with 2028 transitions.
RANDOM walk for 40000 steps (56 resets) in 5011 ms. (7 steps per ms) remains 14/33 properties
BEST_FIRST walk for 40004 steps (16 resets) in 748 ms. (53 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (20 resets) in 406 ms. (98 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (24 resets) in 387 ms. (103 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (20 resets) in 350 ms. (113 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (24 resets) in 571 ms. (69 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (20 resets) in 493 ms. (80 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (20 resets) in 427 ms. (93 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (20 resets) in 485 ms. (82 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (24 resets) in 557 ms. (71 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (20 resets) in 371 ms. (107 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (16 resets) in 404 ms. (98 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (24 resets) in 484 ms. (82 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (20 resets) in 250 ms. (159 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (24 resets) in 417 ms. (95 steps per ms) remains 14/14 properties
[2024-05-21 08:29:09] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 188 cols
[2024-05-21 08:29:09] [INFO ] Computed 7 invariants in 10 ms
[2024-05-21 08:29:09] [INFO ] State equation strengthened by 21 read => feed constraints.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 10 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 2 (OVERLAPS) 2/15 variables, 2/4 constraints. Problems are: Problem set: 12 solved, 2 unsolved
[2024-05-21 08:29:10] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 1/5 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 369/384 variables, 15/20 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 21/41 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/41 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 173/557 variables, 173/214 constraints. Problems are: Problem set: 12 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 3/217 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 0/217 constraints. Problems are: Problem set: 12 solved, 2 unsolved
[2024-05-21 08:29:11] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/557 variables, 1/218 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/557 variables, 0/218 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/557 variables, 0/218 constraints. Problems are: Problem set: 12 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 218 constraints, problems are : Problem set: 12 solved, 2 unsolved in 2678 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 12 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 3/3 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 324/333 variables, 9/12 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/12 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 211/544 variables, 166/178 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 2/180 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 21/201 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 2/203 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/544 variables, 0/203 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/546 variables, 1/204 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/546 variables, 2/206 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/546 variables, 1/207 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/546 variables, 0/207 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 11/557 variables, 11/218 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/557 variables, 1/219 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/557 variables, 1/220 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/557 variables, 0/220 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/557 variables, 0/220 constraints. Problems are: Problem set: 12 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 220 constraints, problems are : Problem set: 12 solved, 2 unsolved in 1276 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/14 constraints, Known Traps: 2/2 constraints]
After SMT, in 4074ms problems are : Problem set: 12 solved, 2 unsolved
Parikh walk visited 0 properties in 352 ms.
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Graph (complete) has 1881 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 499 ms. Remains 186 /188 variables (removed 2) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-05-21 08:29:14] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 186 cols
[2024-05-21 08:29:14] [INFO ] Computed 5 invariants in 12 ms
[2024-05-21 08:29:14] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 08:29:45] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/555 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 57181ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 57228ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57732 ms. Remains : 186/188 places, 2028/2028 transitions.
RANDOM walk for 40000 steps (56 resets) in 772 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (20 resets) in 257 ms. (155 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (20 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 185187 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 185187 steps, saw 51657 distinct states, run finished after 3018 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-21 08:30:14] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:30:14] [INFO ] Invariant cache hit.
[2024-05-21 08:30:15] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 375/540 variables, 168/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 21/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/542 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/542 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 13/555 variables, 13/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/555 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/555 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 186/186 constraints, ReadFeed: 21/21 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 375/540 variables, 168/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 21/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/542 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/555 variables, 13/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/555 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/555 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2307 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 186/186 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2627ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 949 ms.
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Applied a total of 0 rules in 190 ms. Remains 186 /186 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 186/186 places, 2028/2028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Applied a total of 0 rules in 283 ms. Remains 186 /186 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-05-21 08:30:19] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:30:19] [INFO ] Invariant cache hit.
[2024-05-21 08:30:19] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-21 08:30:19] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:30:19] [INFO ] Invariant cache hit.
[2024-05-21 08:30:19] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 08:30:20] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1466 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/186 places, 2028/2028 transitions.
Applied a total of 0 rules in 155 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1904 ms. Remains : 184/186 places, 2028/2028 transitions.
RANDOM walk for 40000 steps (56 resets) in 655 ms. (60 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (20 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (20 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 266556 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 2
Probabilistic random walk after 266556 steps, saw 73466 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-21 08:30:24] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 184 cols
[2024-05-21 08:30:24] [INFO ] Computed 5 invariants in 9 ms
[2024-05-21 08:30:24] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 373/538 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/540 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 13/553 variables, 13/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/553 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 21/21 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 373/538 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/540 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/553 variables, 13/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/553 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1640 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1978ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 313 ms.
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 154 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 184/184 places, 2028/2028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2028/2028 transitions.
Applied a total of 0 rules in 140 ms. Remains 184 /184 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-05-21 08:30:26] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:30:26] [INFO ] Invariant cache hit.
[2024-05-21 08:30:27] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-21 08:30:27] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:30:27] [INFO ] Invariant cache hit.
[2024-05-21 08:30:27] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 08:30:27] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
[2024-05-21 08:30:27] [INFO ] Redundant transitions in 102 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-05-21 08:30:27] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:30:27] [INFO ] Invariant cache hit.
[2024-05-21 08:30:27] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 08:30:55] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 77949ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 77971ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79360 ms. Remains : 184/184 places, 2028/2028 transitions.
Successfully simplified 12 atomic propositions for a total of 9 simplifications.
[2024-05-21 08:31:46] [INFO ] Flatten gal took : 188 ms
[2024-05-21 08:31:46] [INFO ] Flatten gal took : 142 ms
[2024-05-21 08:31:46] [INFO ] Input system was already deterministic with 2028 transitions.
Support contains 14 out of 188 places (down from 15) after GAL structural reductions.
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 171 stabilizing places and 324 stable transitions
Graph (complete) has 4228 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.21 ms
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2028
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2027
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2027
Applied a total of 4 rules in 47 ms. Remains 185 /188 variables (removed 3) and now considering 2027/2028 (removed 1) transitions.
Running 2024 sub problems to find dead transitions.
[2024-05-21 08:31:46] [INFO ] Flow matrix only has 368 transitions (discarded 1659 similar events)
// Phase 1: matrix 368 rows 185 cols
[2024-05-21 08:31:46] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 08:31:46] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
[2024-05-21 08:32:14] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20070 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 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/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2024 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2024 constraints, Known Traps: 1/1 constraints]
After SMT, in 57851ms problems are : Problem set: 0 solved, 2024 unsolved
Search for dead transitions found 0 dead transitions in 57908ms
Finished structural reductions in LTL mode , in 1 iterations and 57976 ms. Remains : 185/188 places, 2027/2028 transitions.
[2024-05-21 08:32:44] [INFO ] Flatten gal took : 180 ms
[2024-05-21 08:32:45] [INFO ] Flatten gal took : 209 ms
[2024-05-21 08:32:45] [INFO ] Input system was already deterministic with 2027 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Graph (complete) has 4228 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2027
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 183 transition count 2026
Applied a total of 6 rules in 412 ms. Remains 183 /188 variables (removed 5) and now considering 2026/2028 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 413 ms. Remains : 183/188 places, 2026/2028 transitions.
[2024-05-21 08:32:45] [INFO ] Flatten gal took : 70 ms
[2024-05-21 08:32:46] [INFO ] Flatten gal took : 81 ms
[2024-05-21 08:32:46] [INFO ] Input system was already deterministic with 2026 transitions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2028
Applied a total of 1 rules in 23 ms. Remains 187 /188 variables (removed 1) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-05-21 08:32:46] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 187 cols
[2024-05-21 08:32:46] [INFO ] Computed 6 invariants in 5 ms
[2024-05-21 08:32:46] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 08:33:13] [INFO ] Deduced a trap composed of 5 places in 315 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/187 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
(s57 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 19)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/187 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 1/1 constraints]
After SMT, in 57263ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 57295ms
Finished structural reductions in LTL mode , in 1 iterations and 57325 ms. Remains : 187/188 places, 2028/2028 transitions.
[2024-05-21 08:33:43] [INFO ] Flatten gal took : 71 ms
[2024-05-21 08:33:43] [INFO ] Flatten gal took : 83 ms
[2024-05-21 08:33:43] [INFO ] Input system was already deterministic with 2028 transitions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2028
Applied a total of 1 rules in 15 ms. Remains 187 /188 variables (removed 1) and now considering 2028/2028 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-05-21 08:33:43] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 08:33:43] [INFO ] Invariant cache hit.
[2024-05-21 08:33:43] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-05-21 08:34:13] [INFO ] Deduced a trap composed of 5 places in 376 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/187 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-COL-V80P20N10

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 15
TRANSITIONS: 11
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 4
COLOR VARS: 4
ARCS: 56
LOADING TIME: 0.286

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 188
TRANSITIONS: 2108
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 15950
UNFOLDING TIME: 6.651

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.125
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 7.259
OK.
----------------------------------------------------------------------
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: 739
MODEL NAME: /home/mcc/execution/model
188 places, 2108 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-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-00 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-05 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-07 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-12 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2024-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716282252858

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="CTLCardinality"
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 CTLCardinality"
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-171620397500113"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;