About the Execution of ITS-Tools for BridgeAndVehicles-COL-V50P50N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | TFF?TFTFTTF?TTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r016-smll-174853764700255.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is BridgeAndVehicles-COL-V50P50N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853764700255
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 42K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-15
=== Now, execution of the tool begins
BK_START 1748828784502
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-V50P50N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
ReachabilityFireability COL
Running Version 202505121319
[2025-06-02 01:46:26] [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]
[2025-06-02 01:46:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 01:46:26] [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.
[2025-06-02 01:46:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 01:46:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 946 ms
[2025-06-02 01:46:27] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
[2025-06-02 01:46:27] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 8 ms.
[2025-06-02 01:46:27] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 1 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 366 steps (0 resets) in 11 ms. (30 steps per ms) remains 0/1 properties
[2025-06-02 01:46:28] [INFO ] Flatten gal took : 19 ms
[2025-06-02 01:46:28] [INFO ] Flatten gal took : 4 ms
[2025-06-02 01:46:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15966517644557289267.gal : 8 ms
[2025-06-02 01:46:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11316784842546127266.prop : 1 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15966517644557289267.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11316784842546127266.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS tools runner thread asked to quit. Dying gracefully.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2025-06-02 01:46:28] [INFO ] Flatten gal took : 3 ms
[2025-06-02 01:46:28] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2025-06-02 01:46:28] [INFO ] Flatten gal took : 3 ms
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 01:46:28] [INFO ] Flatten gal took : 3 ms
[2025-06-02 01:46:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3743494587192454344.gal : 2 ms
[2025-06-02 01:46:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3221861878734732488.prop : 0 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3743494587192454344.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3221861878734732488.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3221861878734732488.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,5,0.003944,3884,2,21,5,62,6,0,54,27,0
Total reachable state count : 5
ITS tools runner thread asked to quit. Dying gracefully.
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] 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
[2025-06-02 01:46:28] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions 10010 arcs in 136 ms.
[2025-06-02 01:46:28] [INFO ] Unfolded 16 HLPN properties in 3 ms.
[2025-06-02 01:46:29] [INFO ] Flatten gal took : 539 ms
[2025-06-02 01:46:30] [INFO ] Flatten gal took : 333 ms
[2025-06-02 01:46:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5804268465554854192.gal : 169 ms
[2025-06-02 01:46:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8211558465381597954.prop : 373 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5804268465554854192.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8211558465381597954.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8211558465381597954.prop.
RANDOM walk for 40000 steps (88 resets) in 12525 ms. (3 steps per ms) remains 8/16 properties
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (40 resets) in 10068 ms. (3 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (41 resets) in 3067 ms. (13 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (32 resets) in 2225 ms. (17 steps per ms) remains 8/8 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 6
BEST_FIRST walk for 40003 steps (36 resets) in 6200 ms. (6 steps per ms) remains 8/8 properties
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :6 after 19
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :19 after 42
Reachability property BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-09 is true.
Reachability property BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-06 is true.
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :42 after 132
BEST_FIRST walk for 40000 steps (44 resets) in 11148 ms. (3 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (40 resets) in 2062 ms. (19 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (35 resets) in 5674 ms. (7 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (36 resets) in 6021 ms. (6 steps per ms) remains 7/8 properties
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-02 01:46:44] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2025-06-02 01:46:44] [INFO ] Computed 7 invariants in 33 ms
[2025-06-02 01:46:44] [INFO ] State equation strengthened by 22 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-00 is UNSAT
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-02 is UNSAT
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-05 is UNSAT
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-08 is UNSAT
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-10 is UNSAT
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2/128 variables, 2/7 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 250/378 variables, 128/135 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 22/157 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/157 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/157 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 157 constraints, problems are : Problem set: 5 solved, 2 unsolved in 1231 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/128 variables, 3/7 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 250/378 variables, 128/135 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 22/157 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/157 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/157 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 157 constraints, problems are : Problem set: 5 solved, 2 unsolved in 1198 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2661ms problems are : Problem set: 5 solved, 2 unsolved
Parikh walk visited 0 properties in 954 ms.
Support contains 121 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 194 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2025-06-02 01:46:48] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2025-06-02 01:46:48] [INFO ] Computed 5 invariants in 4 ms
[2025-06-02 01:46:48] [INFO ] State equation strengthened by 22 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :132 after 858
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 01:47:00] [INFO ] Deduced a trap composed of 5 places in 444 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 01:47:08] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 4 ms to minimize.
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/376 variables, and 7 constraints, problems are : Problem set: 50 solved, 1275 unsolved in 20085 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 50 solved, 1275 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 50 solved, 1275 unsolved
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Invariant property BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-14 does not hold.
Reachability property BridgeAndVehicles-COL-V50P50N10-ReachabilityFireability-2025-13 is true.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
At refinement iteration 3 (OVERLAPS) 250/376 variables, 126/133 constraints. Problems are: Problem set: 101 solved, 1224 unsolved
SMT process timed out in 44280ms, After SMT, problems are : Problem set: 101 solved, 1224 unsolved
Search for dead transitions found 101 dead transitions in 44298ms
Found 101 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 101 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/128 places, 1227/1328 transitions.
Applied a total of 0 rules in 75 ms. Remains 126 /126 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44607 ms. Remains : 126/128 places, 1227/1328 transitions.
RANDOM walk for 40000 steps (88 resets) in 2099 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (32 resets) in 1056 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (35 resets) in 6101 ms. (6 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 351937 steps, run timeout after 6001 ms. (steps per millisecond=58 ) properties seen :0 out of 2
Probabilistic random walk after 351937 steps, saw 96391 distinct states, run finished after 6007 ms. (steps per millisecond=58 ) properties seen :0
[2025-06-02 01:47:41] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 126 cols
[2025-06-02 01:47:41] [INFO ] Computed 6 invariants in 3 ms
[2025-06-02 01:47:41] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 970 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1863ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 361 ms.
Support contains 121 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1227/1227 transitions.
Applied a total of 0 rules in 107 ms. Remains 126 /126 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 126/126 places, 1227/1227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1227/1227 transitions.
Applied a total of 0 rules in 106 ms. Remains 126 /126 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
[2025-06-02 01:47:43] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-02 01:47:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 01:47:43] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-02 01:47:43] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-02 01:47:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 01:47:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 01:47:43] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 01:47:44] [INFO ] Redundant transitions in 92 ms returned []
Running 1224 sub problems to find dead transitions.
[2025-06-02 01:47:44] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2025-06-02 01:47:44] [INFO ] Invariant cache hit.
[2025-06-02 01:47:44] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 01:47:55] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/373 variables, and 7 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD154 is UNSAT
At refinement iteration 4 (OVERLAPS) 247/373 variables, 126/133 constraints. Problems are: Problem set: 1 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 20/153 constraints. Problems are: Problem set: 1 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 1275 constraints, problems are : Problem set: 1 solved, 1223 unsolved in 31119 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64364ms problems are : Problem set: 1 solved, 1223 unsolved
Search for dead transitions found 1 dead transitions in 64373ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/126 places, 1226/1227 transitions.
Applied a total of 0 rules in 67 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 01:48:48] [INFO ] Redundant transitions in 22 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65012 ms. Remains : 126/126 places, 1226/1227 transitions.
RANDOM walk for 40000 steps (88 resets) in 1523 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (32 resets) in 630 ms. (63 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (34 resets) in 4995 ms. (8 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 178773 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 2
Probabilistic random walk after 178773 steps, saw 49343 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2025-06-02 01:48:53] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 126 cols
[2025-06-02 01:48:53] [INFO ] Computed 7 invariants in 5 ms
[2025-06-02 01:48:53] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 246/371 variables, 125/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/372 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 153 constraints, problems are : Problem set: 0 solved, 2 unsolved in 861 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 246/371 variables, 125/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/372 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 153 constraints, problems are : Problem set: 0 solved, 2 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1736ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 544 ms.
Support contains 121 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 56 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 126/126 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 57 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2025-06-02 01:48:55] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-02 01:48:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 01:48:55] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-02 01:48:55] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-02 01:48:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 01:48:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 01:48:56] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 01:48:56] [INFO ] Redundant transitions in 95 ms returned []
Running 1223 sub problems to find dead transitions.
[2025-06-02 01:48:56] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2025-06-02 01:48:56] [INFO ] Invariant cache hit.
[2025-06-02 01:48:56] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 01:49:08] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/372 variables, and 8 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1223/1122 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (OVERLAPS) 246/372 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1276 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 31477 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1122 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64561ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 64567ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64999 ms. Remains : 126/126 places, 1226/1226 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Iterating post reduction 0 with 980 rules applied. Total rules applied 980 place count 126 transition count 246
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 984 place count 124 transition count 244
Applied a total of 984 rules in 27 ms. Remains 124 /126 variables (removed 2) and now considering 244/1226 (removed 982) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 244 rows 124 cols
[2025-06-02 01:50:00] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 01:50:00] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-02 01:50:00] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 01:50:01] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 01:50:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 01:50:01] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 01:50:01] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-02 01:50:01] [INFO ] After 234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-02 01:50:01] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-02 01:50:01] [INFO ] Flatten gal took : 36 ms
[2025-06-02 01:50:01] [INFO ] Flatten gal took : 33 ms
[2025-06-02 01:50:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14861700454460958441.gal : 5 ms
[2025-06-02 01:50:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7058651572546173825.prop : 8 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14861700454460958441.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7058651572546173825.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7058651572546173825.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 60
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :60 after 140
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :140 after 504
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :504 after 2860
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2860 after 20940
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :20940 after 166080
Detected timeout of ITS tools.
[2025-06-02 01:50:16] [INFO ] Flatten gal took : 26 ms
[2025-06-02 01:50:16] [INFO ] Applying decomposition
[2025-06-02 01:50:16] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6215285045108866267.txt' '-o' '/tmp/graph6215285045108866267.bin' '-w' '/tmp/graph6215285045108866267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6215285045108866267.bin' '-l' '-1' '-v' '-w' '/tmp/graph6215285045108866267.weights' '-q' '0' '-e' '0.001'
[2025-06-02 01:50:17] [INFO ] Decomposing Gal with order
[2025-06-02 01:50:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 01:50:17] [INFO ] Removed a total of 229 redundant transitions.
[2025-06-02 01:50:17] [INFO ] Flatten gal took : 144 ms
[2025-06-02 01:50:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 13 ms.
[2025-06-02 01:50:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17350261835310968835.gal : 5 ms
[2025-06-02 01:50:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15311197587900506995.prop : 16 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17350261835310968835.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15311197587900506995.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality15311197587900506995.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :858 after 2025
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 10032
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31531 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 01:50:32] [INFO ] Flatten gal took : 77 ms
[2025-06-02 01:50:32] [INFO ] Applying decomposition
[2025-06-02 01:50:32] [INFO ] Flatten gal took : 109 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8364071125227863954.txt' '-o' '/tmp/graph8364071125227863954.bin' '-w' '/tmp/graph8364071125227863954.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8364071125227863954.bin' '-l' '-1' '-v' '-w' '/tmp/graph8364071125227863954.weights' '-q' '0' '-e' '0.001'
[2025-06-02 01:50:32] [INFO ] Decomposing Gal with order
[2025-06-02 01:50:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 01:50:33] [INFO ] Removed a total of 2946 redundant transitions.
[2025-06-02 01:50:33] [INFO ] Flatten gal took : 430 ms
[2025-06-02 01:50:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 322 labels/synchronizations in 34 ms.
[2025-06-02 01:50:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8390962736514972507.gal : 4 ms
[2025-06-02 01:50:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13432534870642192061.prop : 4 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8390962736514972507.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13432534870642192061.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality13432534870642192061.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :10 after 10
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :10 after 38
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :38 after 39
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :39 after 44
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :44 after 87
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :670 after 711
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :711 after 824
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2635 after 10269
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.06641e+06 after 1.07336e+06
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.88037e+06 after 1.91617e+06
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :4.66994e+06 after 4.72089e+06
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :4.72089e+06 after 4.75413e+06
Detected timeout of ITS tools.
[2025-06-02 02:20:34] [INFO ] Flatten gal took : 56 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12337019491436179507
[2025-06-02 02:20:34] [INFO ] Computing symmetric may disable matrix : 1226 transitions.
[2025-06-02 02:20:34] [INFO ] Applying decomposition
[2025-06-02 02:20:34] [INFO ] Flatten gal took : 63 ms
[2025-06-02 02:20:34] [INFO ] Computation of Complete disable matrix. took 102 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12714488286318272427.txt' '-o' '/tmp/graph12714488286318272427.bin' '-w' '/tmp/graph12714488286318272427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12714488286318272427.bin' '-l' '-1' '-v' '-w' '/tmp/graph12714488286318272427.weights' '-q' '0' '-e' '0.001'
[2025-06-02 02:20:34] [INFO ] Decomposing Gal with order
[2025-06-02 02:20:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 02:20:34] [INFO ] Computing symmetric may enable matrix : 1226 transitions.
[2025-06-02 02:20:34] [INFO ] Computation of Complete enable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 02:20:34] [INFO ] Removed a total of 2917 redundant transitions.
[2025-06-02 02:20:34] [INFO ] Flatten gal took : 228 ms
[2025-06-02 02:20:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 250 labels/synchronizations in 25 ms.
[2025-06-02 02:20:34] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9636893774003713401.gal : 4 ms
[2025-06-02 02:20:34] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11454050378494322237.prop : 4 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability9636893774003713401.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11454050378494322237.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability11454050378494322237.prop.
[2025-06-02 02:20:35] [INFO ] Computing Do-Not-Accords matrix : 1226 transitions.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2 after 2
[2025-06-02 02:20:35] [INFO ] Computation of Completed DNA matrix. took 105 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :16 after 20
[2025-06-02 02:20:35] [INFO ] Built C files in 1256ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12337019491436179507
Running compilation step : cd /tmp/ltsmin12337019491436179507;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :20 after 34
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :34 after 36
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :36 after 118
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :118 after 224
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :224 after 664
Compilation finished in 10080 ms.
Running link step : cd /tmp/ltsmin12337019491436179507;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 128 ms.
Running LTSmin : cd /tmp/ltsmin12337019491436179507;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BridgeAndVehiclesCOLV50P50N10ReachabilityFireability202503==true'
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2427 after 7201
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7201 after 83607
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :164557 after 227152
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12337019491436179507;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BridgeAndVehiclesCOLV50P50N10ReachabilityFireability202503==true'
Running LTSmin : cd /tmp/ltsmin12337019491436179507;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BridgeAndVehiclesCOLV50P50N10ReachabilityFireability202511==true'
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :574853 after 900066
BK_TIME_CONFINEMENT_REACHED
--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-V50P50N10"
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-5832"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V50P50N10, 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 r016-smll-174853764700255"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P50N10.tgz
mv BridgeAndVehicles-COL-V50P50N10 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.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "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 ;