About the Execution of GreatSPN+red for BridgeAndVehicles-COL-V80P50N20
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-171620397600149.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 UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397600149
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-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 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716282801309
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
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:13:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 09:13:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:13:22] [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:13:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 09:13:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 597 ms
[2024-05-21 09:13:23] [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/UpperBounds.xml in 5 ms.
Reduction of identical properties reduced properties to check from 16 to 10
[2024-05-21 09:13:23] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 3 ms.
[2024-05-21 09:13:23] [INFO ] Skeletonized 10 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 09:13:23] [INFO ] Computed 4 invariants in 10 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 1, 0, 80, 50, 0, 80, 0, 0, 0] Max Struct:[50, 1, 80, 80, 50, 80, 80, 50, 1, 80]
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-07 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-04 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-11 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-03 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-21 09:13:23] [INFO ] Invariant cache hit.
[2024-05-21 09:13:23] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-05-21 09:13:23] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-21 09:13:23] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-21 09:13:23] [INFO ] Added : 1 causal constraints over 1 iterations in 46 ms. Result :sat
Minimization took 9 ms.
[2024-05-21 09:13:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 09:13:23] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 09:13:23] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 09:13:23] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 09:13:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 09:13:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-21 09:13:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 09:13:24] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-21 09:13:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 09:13:24] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-21 09:13:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 09:13:24] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 09:13:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 09:13:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-21 09:13:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 09:13:24] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 09:13:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:13:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 09:13:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 09:13:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 09:13:24] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2024-05-21 09:13:24] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 09:13:24] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-21 09:13:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 09:13:24] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[50, 80, 80, 50, 1, 80]
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:13:24] [INFO ] Unfolded HLPN to a Petri net with 198 places and 3728 transitions 28830 arcs in 210 ms.
[2024-05-21 09:13:24] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[50, 80, 80, 50, 1, 80]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[50, 80, 80, 50, 1, 80]
[2024-05-21 09:13:24] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2024-05-21 09:13:24] [INFO ] Computed 7 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[50, 80, 80, 50, 1, 80]
RANDOM walk for 10000 steps (14 resets) in 358 ms. (27 steps per ms)
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-06 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-02 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-15 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (16 resets) in 146 ms. (204 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-05-21 09:13:25] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 09:13:25] [INFO ] Invariant cache hit.
[2024-05-21 09:13:25] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-05-21 09:13:25] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-05-21 09:13:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 09:13:25] [INFO ] [Real]Added 42 Read/Feed constraints in 136 ms returned sat
[2024-05-21 09:13:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:13:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 09:13:25] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-05-21 09:13:26] [INFO ] [Nat]Added 42 Read/Feed constraints in 84 ms returned sat
[2024-05-21 09:13:26] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 233 ms.
[2024-05-21 09:13:27] [INFO ] Deduced a trap composed of 5 places in 584 ms of which 20 ms to minimize.
[2024-05-21 09:13:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 683 ms
[2024-05-21 09:13:27] [INFO ] Added : 3 causal constraints over 3 iterations in 1280 ms. Result :sat
Minimization took 220 ms.
[2024-05-21 09:13:27] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 09:13:27] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-21 09:13:27] [INFO ] [Real]Added 42 Read/Feed constraints in 40 ms returned sat
[2024-05-21 09:13:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:13:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 09:13:28] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-21 09:13:28] [INFO ] [Nat]Added 42 Read/Feed constraints in 38 ms returned sat
[2024-05-21 09:13:28] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 237 ms.
[2024-05-21 09:13:28] [INFO ] Added : 21 causal constraints over 5 iterations in 501 ms. Result :sat
Minimization took 505 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Graph (complete) has 1962 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 720 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:13:29] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2024-05-21 09:13:29] [INFO ] Computed 5 invariants in 6 ms
[2024-05-21 09:13:30] [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 20134 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:14:47] [INFO ] Deduced a trap composed of 5 places in 376 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/606 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20105 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 87039ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 87129ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87916 ms. Remains : 196/198 places, 3728/3728 transitions.
[2024-05-21 09:14:57] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 09:14:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (1455 resets) in 10183 ms. (98 steps per ms)
BEST_FIRST walk for 2000002 steps (1037 resets) in 7155 ms. (279 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-05-21 09:15:14] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 09:15:14] [INFO ] Invariant cache hit.
[2024-05-21 09:15:14] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 09:15:14] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-21 09:15:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:15:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 09:15:14] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-21 09:15:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 09:15:14] [INFO ] [Nat]Added 42 Read/Feed constraints in 35 ms returned sat
[2024-05-21 09:15:15] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 2 ms to minimize.
[2024-05-21 09:15:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 396 ms
[2024-05-21 09:15:15] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 87 ms.
[2024-05-21 09:15:15] [INFO ] Added : 8 causal constraints over 6 iterations in 318 ms. Result :sat
Minimization took 279 ms.
[2024-05-21 09:15:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 09:15:15] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-21 09:15:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:15:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 09:15:16] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-21 09:15:16] [INFO ] [Nat]Added 42 Read/Feed constraints in 35 ms returned sat
[2024-05-21 09:15:16] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 87 ms.
[2024-05-21 09:15:16] [INFO ] Added : 21 causal constraints over 5 iterations in 449 ms. Result :sat
Minimization took 244 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 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 585 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 585 ms. Remains : 196/196 places, 3728/3728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 589 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2024-05-21 09:15:18] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 09:15:18] [INFO ] Invariant cache hit.
[2024-05-21 09:15:19] [INFO ] Implicit Places using invariants in 730 ms returned []
[2024-05-21 09:15:19] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 09:15:19] [INFO ] Invariant cache hit.
[2024-05-21 09:15:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 09:15:21] [INFO ] Implicit Places using invariants and state equation in 2090 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2868 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 194/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 531 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4001 ms. Remains : 194/196 places, 3728/3728 transitions.
[2024-05-21 09:15:22] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2024-05-21 09:15:22] [INFO ] Computed 5 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
----------------------------------------------------------------------
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.181
UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 198
TRANSITIONS: 3728
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 28830
UNFOLDING TIME: 9.439
SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.225
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 10.091
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: 657
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...
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-00 20 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-02 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-03 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-04 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-05 50 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-07 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-06 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-09 20 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-11 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-12 50 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-14 20 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-15 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716283033619
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V80P50N20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BridgeAndVehicles-COL-V80P50N20, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620397600149"
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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;