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

About the Execution of ITS-Tools for BridgeAndVehicles-COL-V20P10N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5501.567 409679.00 556733.00 158.80 TFFFFFTTFFFTTTTT normal

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.r048-tajo-171620398600023.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-COL-V20P10N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620398600023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 9.2K Apr 13 01:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 13 01:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 01:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 01:23 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.5K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 01:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 13 01:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 13 01:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 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 39K 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-V20P10N10-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716320747653

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P10N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
ReachabilityFireability COL
Running Version 202405141337
[2024-05-21 19:45:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:45:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:45:49] [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 19:45:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 19:45:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 607 ms
[2024-05-21 19:45:49] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 68 PT places and 19578.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:45:49] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 13 ms.
[2024-05-21 19:45:49] [INFO ] Skeletonized 12 HLPN properties in 0 ms.
All 12 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] 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 19:45:50] [INFO ] Unfolded HLPN to a Petri net with 68 places and 548 transitions 4070 arcs in 94 ms.
[2024-05-21 19:45:50] [INFO ] Unfolded 12 HLPN properties in 2 ms.
[2024-05-21 19:45:51] [INFO ] Flatten gal took : 298 ms
[2024-05-21 19:45:51] [INFO ] Flatten gal took : 174 ms
[2024-05-21 19:45:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3693005184376699808.gal : 101 ms
[2024-05-21 19:45:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14192915620161252288.prop : 83 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/ReachabilityCardinality3693005184376699808.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14192915620161252288.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...329
Loading property file /tmp/ReachabilityCardinality14192915620161252288.prop.
RANDOM walk for 40000 steps (224 resets) in 4492 ms. (8 steps per ms) remains 6/12 properties
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (106 resets) in 2958 ms. (13 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (96 resets) in 2668 ms. (14 steps per ms) remains 6/6 properties
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 2
Reachability property BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-07 is true.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :2 after 6
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :6 after 12
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :12 after 30
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :30 after 72
BEST_FIRST walk for 40002 steps (71 resets) in 1810 ms. (22 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (105 resets) in 3231 ms. (12 steps per ms) remains 6/6 properties
Reachability property BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-13 is true.
BEST_FIRST walk for 40003 steps (97 resets) in 3093 ms. (12 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (96 resets) in 743 ms. (53 steps per ms) remains 6/6 properties
[2024-05-21 19:45:56] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2024-05-21 19:45:56] [INFO ] Computed 7 invariants in 10 ms
[2024-05-21 19:45:56] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-14 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-00 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-04 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-11 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-15 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 2/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 130/198 variables, 68/75 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 22/97 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/97 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/97 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 97 constraints, problems are : Problem set: 5 solved, 1 unsolved in 650 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 12/68 variables, 5/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 130/198 variables, 68/75 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 22/97 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 1/98 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/98 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-21 19:46:00] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 13 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/198 variables, 1/99 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/99 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/99 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 99 constraints, problems are : Problem set: 5 solved, 1 unsolved in 2247 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 5221ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 140 ms.
Support contains 56 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 135 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
Running 545 sub problems to find dead transitions.
[2024-05-21 19:46:02] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2024-05-21 19:46:02] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 19:46:02] [INFO ] State equation strengthened by 22 read => feed constraints.
Invariant property BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-01 does not hold.
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :72 after 705
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-05-21 19:46:05] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 3 ms to minimize.
[2024-05-21 19:46:06] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
[2024-05-21 19:46:06] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 505 unsolved
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :705 after 706
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 505 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 3 (OVERLAPS) 130/196 variables, 66/74 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 22/96 constraints. Problems are: Problem set: 42 solved, 503 unsolved
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :706 after 708
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/96 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/96 constraints. Problems are: Problem set: 42 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 96 constraints, problems are : Problem set: 42 solved, 503 unsolved in 11205 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 66/66 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 42 solved, 503 unsolved
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :708 after 711
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 130/196 variables, 66/74 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 22/96 constraints. Problems are: Problem set: 42 solved, 503 unsolved
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :711 after 946
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 503/599 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/599 constraints. Problems are: Problem set: 42 solved, 503 unsolved
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :946 after 1625
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/599 constraints. Problems are: Problem set: 42 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 599 constraints, problems are : Problem set: 42 solved, 503 unsolved in 18683 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 66/66 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 503/545 constraints, Known Traps: 3/3 constraints]
After SMT, in 31529ms problems are : Problem set: 42 solved, 503 unsolved
Search for dead transitions found 42 dead transitions in 31550ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 66/68 places, 506/548 transitions.
Applied a total of 0 rules in 40 ms. Remains 66 /66 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31755 ms. Remains : 66/68 places, 506/548 transitions.
RANDOM walk for 40002 steps (224 resets) in 513 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (69 resets) in 1417 ms. (28 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 899064 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :0 out of 1
Probabilistic random walk after 899064 steps, saw 217680 distinct states, run finished after 3004 ms. (steps per millisecond=299 ) properties seen :0
[2024-05-21 19:46:37] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 66 cols
[2024-05-21 19:46:37] [INFO ] Computed 7 invariants in 5 ms
[2024-05-21 19:46:37] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/64 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 19:46:37] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 126/190 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/192 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 94 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/64 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 126/190 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/192 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 926 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1285ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 56 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 506/506 transitions.
Applied a total of 0 rules in 43 ms. Remains 66 /66 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 66/66 places, 506/506 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 506/506 transitions.
Applied a total of 0 rules in 27 ms. Remains 66 /66 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-21 19:46:38] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:46:38] [INFO ] Invariant cache hit.
[2024-05-21 19:46:38] [INFO ] Implicit Places using invariants in 89 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/66 places, 506/506 transitions.
Applied a total of 0 rules in 24 ms. Remains 65 /65 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 148 ms. Remains : 65/66 places, 506/506 transitions.
RANDOM walk for 40000 steps (224 resets) in 433 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (68 resets) in 1051 ms. (38 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 901546 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :0 out of 1
Probabilistic random walk after 901546 steps, saw 218208 distinct states, run finished after 3001 ms. (steps per millisecond=300 ) properties seen :0
[2024-05-21 19:46:42] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 65 cols
[2024-05-21 19:46:42] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 19:46:42] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/63 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 126/189 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/191 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/63 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 126/189 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 19:46:43] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 29 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/191 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/191 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 93 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1548 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1845ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 56 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 506/506 transitions.
Applied a total of 0 rules in 25 ms. Remains 65 /65 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 65/65 places, 506/506 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 506/506 transitions.
Applied a total of 0 rules in 12 ms. Remains 65 /65 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-21 19:46:44] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:46:44] [INFO ] Invariant cache hit.
[2024-05-21 19:46:44] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 19:46:44] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:46:44] [INFO ] Invariant cache hit.
[2024-05-21 19:46:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:46:44] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-05-21 19:46:44] [INFO ] Redundant transitions in 31 ms returned []
Running 503 sub problems to find dead transitions.
[2024-05-21 19:46:44] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:46:44] [INFO ] Invariant cache hit.
[2024-05-21 19:46:44] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:46:46] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 126/191 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 503 unsolved
SDD proceeding with computation,9 properties remain. new max is 2048
[2024-05-21 19:46:52] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
SDD size :1625 after 3169
[2024-05-21 19:46:52] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 94 constraints, problems are : Problem set: 0 solved, 503 unsolved in 12816 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 126/191 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 503/597 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:47:06] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 598 constraints, problems are : Problem set: 0 solved, 503 unsolved in 26889 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
After SMT, in 40478ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 40483ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40825 ms. Remains : 65/65 places, 506/506 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 380 transitions
Reduce isomorphic transitions removed 380 transitions.
Iterating post reduction 0 with 380 rules applied. Total rules applied 380 place count 65 transition count 126
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 384 place count 63 transition count 124
Applied a total of 384 rules in 30 ms. Remains 63 /65 variables (removed 2) and now considering 124/506 (removed 382) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 124 rows 63 cols
[2024-05-21 19:47:25] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 19:47:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 19:47:25] [INFO ] After 536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:47:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 19:47:26] [INFO ] After 463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 19:47:26] [INFO ] After 916ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 19:47:27] [INFO ] After 1574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-21 19:47:27] [INFO ] Flatten gal took : 46 ms
[2024-05-21 19:47:27] [INFO ] Flatten gal took : 25 ms
[2024-05-21 19:47:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1599571297410898546.gal : 4 ms
[2024-05-21 19:47:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4935615006641928243.prop : 5 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/ReachabilityCardinality1599571297410898546.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4935615006641928243.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...328
Loading property file /tmp/ReachabilityCardinality4935615006641928243.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 20
Reachability property BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-08 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,100,0.14986,11160,2,242,9,1559,6,0,377,609,0
Total reachable state count : 100

Verifying 1 reachability properties.
Reachability property BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-08 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-08,4,0.237115,11476,2,92,9,1559,7,0,890,609,0
Over-approximation ignoring read arcs solved 0 properties in 2549 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 19:47:27] [INFO ] Flatten gal took : 32 ms
[2024-05-21 19:47:27] [INFO ] Applying decomposition
[2024-05-21 19:47:27] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16037581289167813967.txt' '-o' '/tmp/graph16037581289167813967.bin' '-w' '/tmp/graph16037581289167813967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16037581289167813967.bin' '-l' '-1' '-v' '-w' '/tmp/graph16037581289167813967.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:47:27] [INFO ] Decomposing Gal with order
[2024-05-21 19:47:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:47:28] [INFO ] Removed a total of 1098 redundant transitions.
[2024-05-21 19:47:28] [INFO ] Flatten gal took : 324 ms
[2024-05-21 19:47:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 12 ms.
[2024-05-21 19:47:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12670277357322236102.gal : 2 ms
[2024-05-21 19:47:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1075488839562532763.prop : 3 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/ReachabilityCardinality12670277357322236102.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1075488839562532763.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality1075488839562532763.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :20 after 26
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :26 after 61
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1454 after 1495
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3703 after 3764
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :7831 after 8263
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :45252 after 45421
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :118090 after 121558
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :382811 after 383469
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :972768 after 973230
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.01179e+06 after 2.02376e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4.32804e+06 after 4.32881e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.32651e+06 after 6.32684e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.73257e+06,302.45,2095088,50289,15843,3.38475e+06,157278,589,6.90582e+06,257,984833,0
Total reachable state count : 6732570

Verifying 1 reachability properties.
Reachability property BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-08 does not hold.
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-08

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-08,0,308.418,2095088,1,0,3.38475e+06,157278,1364,6.90582e+06,379,984833,101863
All properties solved without resorting to model-checking.
Total runtime 408105 ms.

BK_STOP 1716321157332

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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-COL-V20P10N10"
export BK_EXAMINATION="ReachabilityFireability"
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-COL-V20P10N10, examination is ReachabilityFireability"
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-171620398600023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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