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-171620397800260.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BridgeAndVehicles-PT-V50P50N20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397800260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 19K Apr 13 02:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 02:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 13 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 298K Apr 13 02:05 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 17K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 209K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 13 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 13 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.0M 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-PT-V50P50N20-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716289076189

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:57:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 10:57:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:57:58] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2024-05-21 10:57:58] [INFO ] Transformed 138 places.
[2024-05-21 10:57:58] [INFO ] Transformed 2348 transitions.
[2024-05-21 10:57:58] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 361 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 136 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 67 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 10:57:58] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 10:57:58] [INFO ] Computed 5 invariants in 16 ms
[2024-05-21 10:57:59] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 10:58:23] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20116 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 10:58:52] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 2 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1437 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 10 solved, 2335 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 55617ms problems are : Problem set: 10 solved, 2335 unsolved
Search for dead transitions found 10 dead transitions in 55683ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
[2024-05-21 10:58:54] [INFO ] Flow matrix only has 290 transitions (discarded 2048 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 10:58:54] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 10:58:54] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 10:58:54] [INFO ] Flow matrix only has 290 transitions (discarded 2048 similar events)
[2024-05-21 10:58:54] [INFO ] Invariant cache hit.
[2024-05-21 10:58:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:58:54] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2338/2348 transitions.
Applied a total of 0 rules in 11 ms. Remains 136 /136 variables (removed 0) and now considering 2338/2338 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56013 ms. Remains : 136/138 places, 2338/2348 transitions.
Support contains 136 out of 136 places after structural reductions.
[2024-05-21 10:58:55] [INFO ] Flatten gal took : 199 ms
[2024-05-21 10:58:55] [INFO ] Flatten gal took : 220 ms
[2024-05-21 10:58:56] [INFO ] Input system was already deterministic with 2338 transitions.
Reduction of identical properties reduced properties to check from 30 to 26
RANDOM walk for 40000 steps (92 resets) in 3476 ms. (11 steps per ms) remains 3/26 properties
BEST_FIRST walk for 40002 steps (32 resets) in 223 ms. (178 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (32 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (40 resets) in 217 ms. (183 steps per ms) remains 3/3 properties
[2024-05-21 10:58:58] [INFO ] Flow matrix only has 290 transitions (discarded 2048 similar events)
[2024-05-21 10:58:58] [INFO ] Invariant cache hit.
[2024-05-21 10:58:58] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 118/129 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 288/417 variables, 129/133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 42/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 9/426 variables, 7/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 1/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/426 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 183 constraints, problems are : Problem set: 1 solved, 2 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 121/129 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 288/417 variables, 129/133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 42/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/426 variables, 7/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 1/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 2/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 185 constraints, problems are : Problem set: 1 solved, 2 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1494ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 841 ms.
Support contains 8 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2338/2338 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2337
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2337
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 133 transition count 2336
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 131 transition count 2334
Applied a total of 9 rules in 388 ms. Remains 131 /136 variables (removed 5) and now considering 2334/2338 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 131/136 places, 2334/2338 transitions.
RANDOM walk for 40000 steps (128 resets) in 622 ms. (64 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (57 resets) in 439 ms. (90 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (61 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 251209 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :1 out of 2
Probabilistic random walk after 251209 steps, saw 80477 distinct states, run finished after 3004 ms. (steps per millisecond=83 ) properties seen :1
[2024-05-21 10:59:04] [INFO ] Flow matrix only has 286 transitions (discarded 2048 similar events)
// Phase 1: matrix 286 rows 131 cols
[2024-05-21 10:59:04] [INFO ] Computed 4 invariants in 3 ms
[2024-05-21 10:59:04] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/417 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 131/131 constraints, ReadFeed: 42/42 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/417 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 131/131 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 620ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 2334/2334 transitions.
Applied a total of 0 rules in 255 ms. Remains 131 /131 variables (removed 0) and now considering 2334/2334 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 131/131 places, 2334/2334 transitions.
RANDOM walk for 40000 steps (128 resets) in 633 ms. (63 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (60 resets) in 264 ms. (150 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 252794 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 252794 steps, saw 80969 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-21 10:59:08] [INFO ] Flow matrix only has 286 transitions (discarded 2048 similar events)
[2024-05-21 10:59:08] [INFO ] Invariant cache hit.
[2024-05-21 10:59:08] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/417 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 131/131 constraints, ReadFeed: 42/42 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/417 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 131/131 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 637ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 2334/2334 transitions.
Applied a total of 0 rules in 231 ms. Remains 131 /131 variables (removed 0) and now considering 2334/2334 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 131/131 places, 2334/2334 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 2334/2334 transitions.
Applied a total of 0 rules in 218 ms. Remains 131 /131 variables (removed 0) and now considering 2334/2334 (removed 0) transitions.
[2024-05-21 10:59:09] [INFO ] Flow matrix only has 286 transitions (discarded 2048 similar events)
[2024-05-21 10:59:09] [INFO ] Invariant cache hit.
[2024-05-21 10:59:09] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-21 10:59:09] [INFO ] Flow matrix only has 286 transitions (discarded 2048 similar events)
[2024-05-21 10:59:09] [INFO ] Invariant cache hit.
[2024-05-21 10:59:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:59:11] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1481 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 129/131 places, 2334/2334 transitions.
Applied a total of 0 rules in 280 ms. Remains 129 /129 variables (removed 0) and now considering 2334/2334 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1980 ms. Remains : 129/131 places, 2334/2334 transitions.
RANDOM walk for 40000 steps (128 resets) in 528 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (60 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 253854 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 253854 steps, saw 80819 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-21 10:59:14] [INFO ] Flow matrix only has 286 transitions (discarded 2048 similar events)
// Phase 1: matrix 286 rows 129 cols
[2024-05-21 10:59:14] [INFO ] Computed 4 invariants in 5 ms
[2024-05-21 10:59:14] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/415 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/415 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 129/129 constraints, ReadFeed: 42/42 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/415 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/415 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 129/129 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 742ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2334/2334 transitions.
Applied a total of 0 rules in 227 ms. Remains 129 /129 variables (removed 0) and now considering 2334/2334 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 129/129 places, 2334/2334 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2334/2334 transitions.
Applied a total of 0 rules in 190 ms. Remains 129 /129 variables (removed 0) and now considering 2334/2334 (removed 0) transitions.
[2024-05-21 10:59:15] [INFO ] Flow matrix only has 286 transitions (discarded 2048 similar events)
[2024-05-21 10:59:15] [INFO ] Invariant cache hit.
[2024-05-21 10:59:16] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-21 10:59:16] [INFO ] Flow matrix only has 286 transitions (discarded 2048 similar events)
[2024-05-21 10:59:16] [INFO ] Invariant cache hit.
[2024-05-21 10:59:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:59:16] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
[2024-05-21 10:59:17] [INFO ] Redundant transitions in 135 ms returned []
Running 2331 sub problems to find dead transitions.
[2024-05-21 10:59:17] [INFO ] Flow matrix only has 286 transitions (discarded 2048 similar events)
[2024-05-21 10:59:17] [INFO ] Invariant cache hit.
[2024-05-21 10:59:17] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2331 unsolved
[2024-05-21 10:59:45] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 2 ms to minimize.
Problem TDEAD443 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1262 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 129/415 variables, and 5 constraints, problems are : Problem set: 40 solved, 2291 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/129 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2331/2331 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 40 solved, 2291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 4/4 constraints. Problems are: Problem set: 40 solved, 2291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 1/5 constraints. Problems are: Problem set: 40 solved, 2291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 129/415 variables, and 5 constraints, problems are : Problem set: 40 solved, 2291 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/129 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2331 constraints, Known Traps: 1/1 constraints]
After SMT, in 75624ms problems are : Problem set: 40 solved, 2291 unsolved
Search for dead transitions found 40 dead transitions in 75648ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 129/129 places, 2294/2334 transitions.
Applied a total of 0 rules in 204 ms. Remains 129 /129 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
[2024-05-21 11:00:32] [INFO ] Redundant transitions in 83 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77438 ms. Remains : 129/129 places, 2294/2334 transitions.
RANDOM walk for 40000 steps (128 resets) in 494 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (60 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 247447 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 1
Probabilistic random walk after 247447 steps, saw 79150 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2024-05-21 11:00:36] [INFO ] Flow matrix only has 285 transitions (discarded 2009 similar events)
// Phase 1: matrix 285 rows 129 cols
[2024-05-21 11:00:36] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 11:00:36] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 285/412 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 41/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/414 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/414 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 129/129 constraints, ReadFeed: 41/41 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 285/412 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 41/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/414 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/414 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 129/129 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 664ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2294/2294 transitions.
Applied a total of 0 rules in 201 ms. Remains 129 /129 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 129/129 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2294/2294 transitions.
Applied a total of 0 rules in 174 ms. Remains 129 /129 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
[2024-05-21 11:00:37] [INFO ] Flow matrix only has 285 transitions (discarded 2009 similar events)
[2024-05-21 11:00:37] [INFO ] Invariant cache hit.
[2024-05-21 11:00:37] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-21 11:00:37] [INFO ] Flow matrix only has 285 transitions (discarded 2009 similar events)
[2024-05-21 11:00:37] [INFO ] Invariant cache hit.
[2024-05-21 11:00:37] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:00:38] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
[2024-05-21 11:00:38] [INFO ] Redundant transitions in 43 ms returned []
Running 2291 sub problems to find dead transitions.
[2024-05-21 11:00:38] [INFO ] Flow matrix only has 285 transitions (discarded 2009 similar events)
[2024-05-21 11:00:38] [INFO ] Invariant cache hit.
[2024-05-21 11:00:38] [INFO ] State equation strengthened by 41 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V50P50N20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 138
TRANSITIONS: 2348
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.077s, Sys 0.008s]


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


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

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

Process ID: 668
MODEL NAME: /home/mcc/execution/model
138 places, 2348 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-01 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-02 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-04 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-05 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-06 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-09 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-10 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-11 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-12 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-13 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716291313462

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

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-PT-V50P50N20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BridgeAndVehicles-PT-V50P50N20, examination is LTLFireability"
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-171620397800260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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