Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r025-smll-171620166500366.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is AutonomousCar-PT-10a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166500366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 17:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 12 17:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 AutonomousCar-PT-10a-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716362586998

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:23:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 07:23:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:23:10] [INFO ] Load time of PNML (sax parser for PT used): 489 ms
[2024-05-22 07:23:10] [INFO ] Transformed 97 places.
[2024-05-22 07:23:10] [INFO ] Transformed 1921 transitions.
[2024-05-22 07:23:10] [INFO ] Found NUPN structural information;
[2024-05-22 07:23:10] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 758 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1833 resets) in 5124 ms. (7 steps per ms) remains 3/10 properties
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (130 resets) in 527 ms. (75 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (144 resets) in 1780 ms. (22 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (137 resets) in 296 ms. (134 steps per ms) remains 3/3 properties
[2024-05-22 07:23:12] [INFO ] Flow matrix only has 1497 transitions (discarded 1 similar events)
// Phase 1: matrix 1497 rows 97 cols
[2024-05-22 07:23:12] [INFO ] Computed 15 invariants in 70 ms
[2024-05-22 07:23:12] [INFO ] State equation strengthened by 403 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 40/97 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1496/1593 variables, 97/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1593 variables, 402/611 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1593 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1594 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1594 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1594 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1594/1594 variables, and 612 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1764 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 97/97 constraints, ReadFeed: 403/403 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AutonomousCar-PT-10a-ReachabilityCardinality-2024-15 is UNSAT
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 40/97 variables, 15/72 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 40/112 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 07:23:16] [INFO ] Deduced a trap composed of 8 places in 1414 ms of which 29 ms to minimize.
[2024-05-22 07:23:17] [INFO ] Deduced a trap composed of 7 places in 1240 ms of which 4 ms to minimize.
[2024-05-22 07:23:19] [INFO ] Deduced a trap composed of 7 places in 1389 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 3/115 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1593/1594 variables, and 212 constraints, problems are : Problem set: 1 solved, 2 unsolved in 5010 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 97/97 constraints, ReadFeed: 0/403 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 3/3 constraints]
After SMT, in 7443ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 97 transition count 1495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 96 transition count 1495
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 93 transition count 1462
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 93 transition count 1462
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 15 place count 93 transition count 1457
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 20 place count 88 transition count 1457
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 88 transition count 1457
Applied a total of 21 rules in 925 ms. Remains 88 /97 variables (removed 9) and now considering 1457/1498 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 954 ms. Remains : 88/97 places, 1457/1498 transitions.
RANDOM walk for 40000 steps (1992 resets) in 2129 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (134 resets) in 270 ms. (147 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (157 resets) in 283 ms. (140 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 292896 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 2
Probabilistic random walk after 292896 steps, saw 51163 distinct states, run finished after 3008 ms. (steps per millisecond=97 ) properties seen :0
// Phase 1: matrix 1457 rows 88 cols
[2024-05-22 07:23:24] [INFO ] Computed 15 invariants in 33 ms
[2024-05-22 07:23:25] [INFO ] State equation strengthened by 373 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/88 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1457/1545 variables, 88/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1545 variables, 373/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1545 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1545 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1545/1545 variables, and 476 constraints, problems are : Problem set: 0 solved, 2 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 88/88 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/88 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:23:27] [INFO ] Deduced a trap composed of 7 places in 1127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1457/1545 variables, 88/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1545 variables, 373/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1545 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1545 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1545/1545 variables, and 477 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2226 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 88/88 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints]
After SMT, in 3430ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 833 ms.
Support contains 49 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 1457/1457 transitions.
Applied a total of 0 rules in 120 ms. Remains 88 /88 variables (removed 0) and now considering 1457/1457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 88/88 places, 1457/1457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 1457/1457 transitions.
Applied a total of 0 rules in 117 ms. Remains 88 /88 variables (removed 0) and now considering 1457/1457 (removed 0) transitions.
[2024-05-22 07:23:29] [INFO ] Invariant cache hit.
[2024-05-22 07:23:30] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-05-22 07:23:30] [INFO ] Invariant cache hit.
[2024-05-22 07:23:30] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-22 07:23:31] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned [83, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1880 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 86/88 places, 1457/1457 transitions.
Applied a total of 0 rules in 114 ms. Remains 86 /86 variables (removed 0) and now considering 1457/1457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2114 ms. Remains : 86/88 places, 1457/1457 transitions.
RANDOM walk for 40000 steps (2007 resets) in 1900 ms. (21 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (134 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (156 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 320628 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 2
Probabilistic random walk after 320628 steps, saw 55467 distinct states, run finished after 3002 ms. (steps per millisecond=106 ) properties seen :0
// Phase 1: matrix 1457 rows 86 cols
[2024-05-22 07:23:35] [INFO ] Computed 13 invariants in 17 ms
[2024-05-22 07:23:35] [INFO ] State equation strengthened by 373 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/84 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1457/1541 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1541 variables, 373/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1541 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1543 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1543 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1543 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1543/1543 variables, and 472 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 86/86 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/84 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1457/1541 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1541 variables, 373/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1541 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1543 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1543 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1543 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1543/1543 variables, and 472 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 86/86 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2202ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1719 ms.
Support contains 49 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 1457/1457 transitions.
Applied a total of 0 rules in 118 ms. Remains 86 /86 variables (removed 0) and now considering 1457/1457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 86/86 places, 1457/1457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 1457/1457 transitions.
Applied a total of 0 rules in 109 ms. Remains 86 /86 variables (removed 0) and now considering 1457/1457 (removed 0) transitions.
[2024-05-22 07:23:39] [INFO ] Invariant cache hit.
[2024-05-22 07:23:39] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-22 07:23:39] [INFO ] Invariant cache hit.
[2024-05-22 07:23:40] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-22 07:23:41] [INFO ] Implicit Places using invariants and state equation in 1440 ms returned []
Implicit Place search using SMT with State Equation took 1845 ms to find 0 implicit places.
[2024-05-22 07:23:41] [INFO ] Redundant transitions in 138 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-05-22 07:23:41] [INFO ] Invariant cache hit.
[2024-05-22 07:23:41] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (OVERLAPS) 2/85 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-22 07:24:23] [INFO ] Deduced a trap composed of 24 places in 1754 ms of which 2 ms to minimize.
[2024-05-22 07:24:24] [INFO ] Deduced a trap composed of 7 places in 1125 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 85/1543 variables, and 15 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/86 constraints, ReadFeed: 0/373 constraints, PredecessorRefiner: 1456/60 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (OVERLAPS) 2/85 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1542/1543 variables, and 100 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 85/86 constraints, ReadFeed: 0/373 constraints, PredecessorRefiner: 1396/60 constraints, Known Traps: 2/2 constraints]
After SMT, in 86641ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 86672ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88789 ms. Remains : 86/86 places, 1457/1457 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 101 ms. Remains 86 /86 variables (removed 0) and now considering 1457/1457 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 07:25:08] [INFO ] Invariant cache hit.
[2024-05-22 07:25:08] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 07:25:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-22 07:25:08] [INFO ] After 528ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :2
[2024-05-22 07:25:08] [INFO ] After 580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 815 ms.
[2024-05-22 07:25:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-22 07:25:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 86 places, 1457 transitions and 25639 arcs took 32 ms.
[2024-05-22 07:25:10] [INFO ] Flatten gal took : 730 ms
Total runtime 120699 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-10a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 86
TRANSITIONS: 1457
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.147s, Sys 0.016s]


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


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

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

Process ID: 669
MODEL NAME: /home/mcc/execution/415/model
86 places, 1457 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 AutonomousCar-PT-10a-ReachabilityCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716362715149

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-10a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is AutonomousCar-PT-10a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r025-smll-171620166500366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-10a.tgz
mv AutonomousCar-PT-10a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;