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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 5.8K Apr 13 00:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 13 00:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 00:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 13 00:54 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 25K 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 9.3K Apr 13 02:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 02:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 13 01:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 01:57 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-V80P50N20-CTLFireability-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLFireability-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLFireability-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLFireability-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLFireability-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLFireability-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLFireability-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLFireability-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLFireability-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLFireability-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLFireability-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLFireability-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLFireability-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLFireability-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLFireability-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716282659287

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P50N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 09:11:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 09:11:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:11:00] [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 09:11:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 09:11:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 848 ms
[2024-05-21 09:11:01] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 198 PT places and 551698.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
[2024-05-21 09:11:01] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-05-21 09:11:01] [INFO ] Skeletonized 4 HLPN properties in 3 ms. Removed 12 properties that had guard overlaps.
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.14 ms
Remains 3 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.
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.10 ms
RANDOM walk for 700 steps (0 resets) in 68 ms. (10 steps per ms) remains 0/4 properties
[2024-05-21 09:11:02] [INFO ] Flatten gal took : 41 ms
[2024-05-21 09:11:02] [INFO ] Flatten gal took : 2 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) 21)]] 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 09:11:02] [INFO ] Unfolded HLPN to a Petri net with 198 places and 3728 transitions 28830 arcs in 277 ms.
[2024-05-21 09:11:02] [INFO ] Unfolded 16 HLPN properties in 5 ms.
Support contains 196 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 196 transition count 3728
Applied a total of 2 rules in 117 ms. Remains 196 /198 variables (removed 2) and now considering 3728/3728 (removed 0) transitions.
Running 3725 sub problems to find dead transitions.
[2024-05-21 09:11:03] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2024-05-21 09:11:03] [INFO ] Computed 5 invariants in 20 ms
[2024-05-21 09:11:03] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/606 variables, and 5 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20200 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 09:12:21] [INFO ] Deduced a trap composed of 5 places in 834 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/606 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20083 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 87228ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 87396ms
[2024-05-21 09:12:30] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 09:12:30] [INFO ] Invariant cache hit.
[2024-05-21 09:12:30] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 09:12:30] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 09:12:30] [INFO ] Invariant cache hit.
[2024-05-21 09:12:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 09:12:31] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 3725 sub problems to find dead transitions.
[2024-05-21 09:12:31] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 09:12:31] [INFO ] Invariant cache hit.
[2024-05-21 09:12:31] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 09:13:47] [INFO ] Deduced a trap composed of 5 places in 475 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/606 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/606 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 30352 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 112536ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 112585ms
Starting structural reductions in LTL mode, iteration 1 : 196/198 places, 3728/3728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200759 ms. Remains : 196/198 places, 3728/3728 transitions.
Support contains 196 out of 196 places after structural reductions.
[2024-05-21 09:14:27] [INFO ] Flatten gal took : 1140 ms
[2024-05-21 09:14:33] [INFO ] Flatten gal took : 988 ms
[2024-05-21 09:14:40] [INFO ] Input system was already deterministic with 3728 transitions.
Reduction of identical properties reduced properties to check from 33 to 27
RANDOM walk for 40000 steps (56 resets) in 7976 ms. (5 steps per ms) remains 2/27 properties
BEST_FIRST walk for 40003 steps (17 resets) in 1247 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (24 resets) in 1308 ms. (30 steps per ms) remains 2/2 properties
[2024-05-21 09:14:45] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 09:14:45] [INFO ] Invariant cache hit.
[2024-05-21 09:14:45] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem AtomicPropp30 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/173 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 410/583 variables, 173/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 42/219 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 23/606 variables, 23/242 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/606 variables, 1/243 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 0/243 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/606 variables, 0/243 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 243 constraints, problems are : Problem set: 1 solved, 1 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 196/196 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/91 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 329/420 variables, 91/94 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 21/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 185/605 variables, 104/219 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 2/221 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 21/242 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 1/243 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/605 variables, 0/243 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/606 variables, 1/244 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/606 variables, 0/244 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/606 variables, 0/244 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 244 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2147 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 196/196 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3021ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 534 ms.
Support contains 84 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 690 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Running 3725 sub problems to find dead transitions.
[2024-05-21 09:14:49] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 09:14:49] [INFO ] Invariant cache hit.
[2024-05-21 09:14:49] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/606 variables, and 5 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20064 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 09:16:15] [INFO ] Deduced a trap composed of 5 places in 487 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/606 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20077 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 92989ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 93028ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93727 ms. Remains : 196/196 places, 3728/3728 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-21 09:16:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 09:16:23] [INFO ] Flatten gal took : 355 ms
FORMULA BridgeAndVehicles-COL-V80P50N20-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 09:16:27] [INFO ] Flatten gal took : 460 ms
[2024-05-21 09:16:31] [INFO ] Input system was already deterministic with 3728 transitions.
Computed a total of 169 stabilizing places and 324 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 195 transition count 3727
Applied a total of 2 rules in 35 ms. Remains 195 /196 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
Running 3724 sub problems to find dead transitions.
[2024-05-21 09:16:31] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2024-05-21 09:16:31] [INFO ] Computed 5 invariants in 14 ms
[2024-05-21 09:16:31] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/604 variables, and 5 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 20094 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3724/3724 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
[2024-05-21 09:18:01] [INFO ] Deduced a trap composed of 5 places in 450 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 195/604 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 20084 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3724 constraints, Known Traps: 1/1 constraints]
After SMT, in 94992ms problems are : Problem set: 0 solved, 3724 unsolved
Search for dead transitions found 0 dead transitions in 95031ms
Finished structural reductions in LTL mode , in 1 iterations and 95075 ms. Remains : 195/196 places, 3727/3728 transitions.
[2024-05-21 09:18:06] [INFO ] Flatten gal took : 105 ms
[2024-05-21 09:18:06] [INFO ] Flatten gal took : 135 ms
[2024-05-21 09:18:07] [INFO ] Input system was already deterministic with 3727 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 18 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Running 3725 sub problems to find dead transitions.
[2024-05-21 09:18:07] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2024-05-21 09:18:07] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 09:18:07] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/606 variables, and 5 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20099 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 09:19:31] [INFO ] Deduced a trap composed of 5 places in 595 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/606 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20118 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 95604ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 95652ms
Finished structural reductions in LTL mode , in 1 iterations and 95681 ms. Remains : 196/196 places, 3728/3728 transitions.
[2024-05-21 09:19:43] [INFO ] Flatten gal took : 213 ms
[2024-05-21 09:19:43] [INFO ] Flatten gal took : 242 ms
[2024-05-21 09:19:43] [INFO ] Input system was already deterministic with 3728 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 3727
Applied a total of 2 rules in 1464 ms. Remains 195 /196 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
Running 3724 sub problems to find dead transitions.
[2024-05-21 09:19:45] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2024-05-21 09:19:45] [INFO ] Computed 5 invariants in 10 ms
[2024-05-21 09:19:45] [INFO ] State equation strengthened by 42 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-COL-V80P50N20

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

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 198
TRANSITIONS: 3728
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 28830
UNFOLDING TIME: 9.135

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.128
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 9.69
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: 679
MODEL NAME: /home/mcc/execution/model
198 places, 3728 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...

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
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-V80P50N20"
export BK_EXAMINATION="CTLFireability"
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-V80P50N20, examination is CTLFireability"
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-171620397600146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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