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

About the Execution of ITS-Tools for BridgeAndVehicles-PT-V80P50N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 126062.00 0.00 0.00 FFTT?F?TFFFFFFFT normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399200310.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 itstools
Input is BridgeAndVehicles-PT-V80P50N20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399200310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 21K Apr 13 01:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 13 01:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 386K Apr 13 00:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 13 00:56 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 18K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 286K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 828K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 13 02:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 198K Apr 13 02:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 963K Apr 13 01:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 13 01:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716330837929

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P50N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 22:33:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:33:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:33:59] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2024-05-21 22:33:59] [INFO ] Transformed 198 places.
[2024-05-21 22:33:59] [INFO ] Transformed 3728 transitions.
[2024-05-21 22:33:59] [INFO ] Parsed PT model containing 198 places and 3728 transitions and 28830 arcs in 361 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 22:34:01] [INFO ] Flatten gal took : 655 ms
RANDOM walk for 40000 steps (56 resets) in 4746 ms. (8 steps per ms) remains 11/16 properties
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 22:34:01] [INFO ] Flatten gal took : 313 ms
[2024-05-21 22:34:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16558194501817224071.gal : 137 ms
[2024-05-21 22:34:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality54828788993913667.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16558194501817224071.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality54828788993913667.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40000 steps (24 resets) in 1003 ms. (39 steps per ms) remains 11/11 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
BEST_FIRST walk for 40001 steps (24 resets) in 636 ms. (62 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 392 ms. (101 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (20 resets) in 523 ms. (76 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (18 resets) in 434 ms. (91 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (20 resets) in 383 ms. (104 steps per ms) remains 11/11 properties
Loading property file /tmp/ReachabilityCardinality54828788993913667.prop.
BEST_FIRST walk for 40002 steps (16 resets) in 856 ms. (46 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 500 ms. (79 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (16 resets) in 520 ms. (76 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (16 resets) in 474 ms. (84 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (16 resets) in 369 ms. (108 steps per ms) remains 11/11 properties
[2024-05-21 22:34:03] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2024-05-21 22:34:03] [INFO ] Computed 7 invariants in 53 ms
[2024-05-21 22:34:03] [INFO ] State equation strengthened by 42 read => feed constraints.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :2 after 6
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-01 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
SDD proceeding with computation,11 properties remain. new max is 16
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-07 is UNSAT
SDD size :6 after 19
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-08 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-11 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-14 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-15 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 86/198 variables, 6/7 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 410/608 variables, 198/205 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/608 variables, 42/247 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 0/247 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/608 variables, 0/247 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 247 constraints, problems are : Problem set: 9 solved, 2 unsolved in 780 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 2 unsolved
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :19 after 42
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/15 variables, 1/4 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 410/425 variables, 15/19 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 42/61 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/61 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 183/608 variables, 183/244 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 3/247 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/608 variables, 2/249 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/608 variables, 0/249 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/608 variables, 0/249 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 249 constraints, problems are : Problem set: 9 solved, 2 unsolved in 1430 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 2815ms problems are : Problem set: 9 solved, 2 unsolved
Parikh walk visited 0 properties in 725 ms.
Support contains 3 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.26 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 195 transition count 3727
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :42 after 132
Applied a total of 3 rules in 1015 ms. Remains 195 /198 variables (removed 3) and now considering 3727/3728 (removed 1) transitions.
Running 3724 sub problems to find dead transitions.
[2024-05-21 22:34:08] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2024-05-21 22:34:08] [INFO ] Computed 5 invariants in 12 ms
[2024-05-21 22:34:08] [INFO ] State equation strengthened by 42 read => feed constraints.
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :132 after 461
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
[2024-05-21 22:35:19] [INFO ] Deduced a trap composed of 5 places in 569 ms of which 28 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/604 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 20119 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: 1/1 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
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
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 20077 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 91288ms problems are : Problem set: 0 solved, 3724 unsolved
Search for dead transitions found 0 dead transitions in 91377ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92449 ms. Remains : 195/198 places, 3727/3728 transitions.
RANDOM walk for 40000 steps (64 resets) in 1193 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (24 resets) in 294 ms. (135 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (24 resets) in 389 ms. (102 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 166820 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 2
Probabilistic random walk after 166820 steps, saw 48139 distinct states, run finished after 3008 ms. (steps per millisecond=55 ) properties seen :0
[2024-05-21 22:35:43] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 22:35:43] [INFO ] Invariant cache hit.
[2024-05-21 22:35:43] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 247/255 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 347/602 variables, 185/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 42/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/604 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/604 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/604 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 242 constraints, problems are : Problem set: 0 solved, 2 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 195/195 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 247/255 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 347/602 variables, 185/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 42/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/604 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/604 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/604 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 244 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1290 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 195/195 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1868ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 953 ms.
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 673 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 674 ms. Remains : 195/195 places, 3727/3727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 842 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2024-05-21 22:35:47] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 22:35:47] [INFO ] Invariant cache hit.
[2024-05-21 22:35:57] [INFO ] Implicit Places using invariants in 10081 ms returned []
[2024-05-21 22:35:57] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 22:35:57] [INFO ] Invariant cache hit.
[2024-05-21 22:35:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:36:00] [INFO ] Implicit Places using invariants and state equation in 2306 ms returned [82, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12410 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 193/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 443 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13696 ms. Remains : 193/195 places, 3727/3727 transitions.
RANDOM walk for 40000 steps (64 resets) in 679 ms. (58 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (24 resets) in 249 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (24 resets) in 239 ms. (166 steps per ms) remains 2/2 properties

BK_STOP 1716330963991

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V80P50N20"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BridgeAndVehicles-PT-V80P50N20, 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 r048-tajo-171620399200310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P50N20.tgz
mv BridgeAndVehicles-PT-V80P50N20 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 ;