About the Execution of ITS-Tools for ShieldIIPt-PT-100B
| 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 | T?FF??TFFFF?TTT? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533000598.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 ShieldIIPt-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533000598
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 ShieldIIPt-PT-100B-ReachabilityCardinality-2025-00
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2025-01
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2025-02
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2025-03
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2025-04
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2025-05
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2025-06
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2025-07
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2025-08
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2025-09
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2025-10
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2025-11
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2025-12
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2025-13
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2025-14
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1749180326158
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-06 03:25:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 03:25:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 03:25:27] [INFO ] Load time of PNML (sax parser for PT used): 269 ms
[2025-06-06 03:25:27] [INFO ] Transformed 7003 places.
[2025-06-06 03:25:27] [INFO ] Transformed 6503 transitions.
[2025-06-06 03:25:27] [INFO ] Found NUPN structural information;
[2025-06-06 03:25:28] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 682 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2402 ms. (16 steps per ms) remains 7/12 properties
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 7/7 properties
[2025-06-06 03:25:29] [INFO ] Flatten gal took : 508 ms
BEST_FIRST walk for 40004 steps (8 resets) in 843 ms. (47 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 193 ms. (206 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
[2025-06-06 03:25:29] [INFO ] Flatten gal took : 406 ms
BEST_FIRST walk for 40004 steps (8 resets) in 810 ms. (49 steps per ms) remains 7/7 properties
[2025-06-06 03:25:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7421742677944174964.gal : 183 ms
[2025-06-06 03:25:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1128529319773695105.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7421742677944174964.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1128529319773695105.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
// Phase 1: matrix 6503 rows 7003 cols
[2025-06-06 03:25:30] [INFO ] Computed 901 invariants in 75 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Loading property file /tmp/ReachabilityCardinality1128529319773695105.prop.
At refinement iteration 2 (OVERLAPS) 2325/2451 variables, 260/386 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2451 variables, 2325/2711 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2451 variables, 0/2711 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 4552/7003 variables, 641/3352 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7003 variables, 4552/7904 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7003 variables, 0/7904 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 5283ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 126 out of 7003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1603 transitions
Trivial Post-agglo rules discarded 1603 transitions
Performed 1603 trivial Post agglomeration. Transition count delta: 1603
Iterating post reduction 0 with 1603 rules applied. Total rules applied 1603 place count 7003 transition count 4900
Reduce places removed 1603 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 1 with 1645 rules applied. Total rules applied 3248 place count 5400 transition count 4858
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 3291 place count 5358 transition count 4857
Performed 403 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 403 Pre rules applied. Total rules applied 3291 place count 5358 transition count 4454
Deduced a syphon composed of 403 places in 20 ms
Reduce places removed 403 places and 0 transitions.
Iterating global reduction 3 with 806 rules applied. Total rules applied 4097 place count 4955 transition count 4454
Discarding 671 places :
Symmetric choice reduction at 3 with 671 rule applications. Total rules 4768 place count 4284 transition count 3783
Iterating global reduction 3 with 671 rules applied. Total rules applied 5439 place count 4284 transition count 3783
Performed 276 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 276 Pre rules applied. Total rules applied 5439 place count 4284 transition count 3507
Deduced a syphon composed of 276 places in 26 ms
Reduce places removed 276 places and 0 transitions.
Iterating global reduction 3 with 552 rules applied. Total rules applied 5991 place count 4008 transition count 3507
Performed 1648 Post agglomeration using F-continuation condition.Transition count delta: 1648
Deduced a syphon composed of 1648 places in 8 ms
Reduce places removed 1648 places and 0 transitions.
Iterating global reduction 3 with 3296 rules applied. Total rules applied 9287 place count 2360 transition count 1859
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 101 places in 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9489 place count 2259 transition count 1915
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 101 places in 13 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9691 place count 2158 transition count 1972
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 65 places in 9 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 9821 place count 2093 transition count 2010
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9822 place count 2093 transition count 2009
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 9830 place count 2093 transition count 2001
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 9838 place count 2085 transition count 2001
Partial Free-agglomeration rule applied 98 times.
Drop transitions (Partial Free agglomeration) removed 98 transitions
Iterating global reduction 5 with 98 rules applied. Total rules applied 9936 place count 2085 transition count 2001
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 9937 place count 2084 transition count 2000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 9938 place count 2083 transition count 2000
Applied a total of 9938 rules in 2734 ms. Remains 2083 /7003 variables (removed 4920) and now considering 2000/6503 (removed 4503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2748 ms. Remains : 2083/7003 places, 2000/6503 transitions.
RANDOM walk for 40000 steps (8 resets) in 1369 ms. (29 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 805 ms. (49 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 680 ms. (58 steps per ms) remains 6/7 properties
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 777 ms. (51 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 661 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 645 ms. (61 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 516 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 650 ms. (61 steps per ms) remains 6/6 properties
// Phase 1: matrix 2000 rows 2083 cols
[2025-06-06 03:25:39] [INFO ] Computed 900 invariants in 8 ms
[2025-06-06 03:25:39] [INFO ] State equation strengthened by 459 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/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 278/354 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1043/1397 variables, 479/585 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1397 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1424/2821 variables, 1397/1982 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2821 variables, 451/2433 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2821 variables, 0/2433 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 359/3180 variables, 188/2621 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3180 variables, 80/2701 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3180 variables, 0/2701 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 12/3192 variables, 12/2713 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3192 variables, 10/2723 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3192 variables, 0/2723 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 8/3200 variables, 4/2727 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3200 variables, 0/2727 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 336/3536 variables, 178/2905 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3536 variables, 67/2972 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3536 variables, 0/2972 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 18/3554 variables, 17/2989 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3554 variables, 10/2999 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3554 variables, 0/2999 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 14/3568 variables, 7/3006 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3568 variables, 0/3006 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 214/3782 variables, 126/3132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3782 variables, 41/3173 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3782 variables, 3/3176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3782 variables, 0/3176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 9/3791 variables, 11/3187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3791 variables, 7/3194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3791 variables, 0/3194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 23/3814 variables, 10/3204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3814 variables, 0/3204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 118/3932 variables, 80/3284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/3932 variables, 23/3307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3932 variables, 5/3312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3932 variables, 0/3312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (OVERLAPS) 4/3936 variables, 4/3316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3936 variables, 2/3318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3936 variables, 0/3318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (OVERLAPS) 2/3938 variables, 1/3319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3938 variables, 0/3319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (OVERLAPS) 92/4030 variables, 48/3367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/4030 variables, 16/3383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/4030 variables, 0/3383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (OVERLAPS) 4/4034 variables, 6/3389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/4034 variables, 4/3393 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/4034 variables, 0/3393 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (OVERLAPS) 4/4038 variables, 2/3395 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/4038 variables, 0/3395 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 50 (OVERLAPS) 30/4068 variables, 24/3419 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/4068 variables, 10/3429 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/4068 variables, 0/3429 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 53 (OVERLAPS) 12/4080 variables, 6/3435 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/4080 variables, 1/3436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/4080 variables, 0/3436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 56 (OVERLAPS) 1/4081 variables, 2/3438 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/4081 variables, 1/3439 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/4081 variables, 0/3439 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 59 (OVERLAPS) 2/4083 variables, 2/3441 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/4083 variables, 1/3442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/4083 variables, 0/3442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 62 (OVERLAPS) 0/4083 variables, 0/3442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4083/4083 variables, and 3442 constraints, problems are : Problem set: 0 solved, 6 unsolved in 13924 ms.
Refiners :[Positive P Invariants (semi-flows): 900/900 constraints, State Equation: 2083/2083 constraints, ReadFeed: 459/459 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 278/354 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:54] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:54] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 182 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1043/1397 variables, 479/587 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:54] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:54] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:54] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:55] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:55] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:55] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:55] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:55] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:55] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:55] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:55] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:55] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1397 variables, 12/599 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1397 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1424/2821 variables, 1397/1996 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2821 variables, 451/2447 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2821 variables, 2/2449 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:57] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:58] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2821 variables, 2/2451 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:59] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:59] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:25:59] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:00] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:00] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:00] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:00] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:00] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:00] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:00] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:00] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:01] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:01] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:01] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :36 after 69
At refinement iteration 12 (INCLUDED_ONLY) 0/2821 variables, 14/2465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :129 after 933
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :933 after 4.45318e+08
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :4.45318e+08 after 4.68295e+19
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :4.68295e+19 after 4.47767e+40
[2025-06-06 03:26:02] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:02] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :4.47767e+40 after 5.20516e+94
At refinement iteration 13 (INCLUDED_ONLY) 0/2821 variables, 2/2467 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:03] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 10 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2821 variables, 1/2468 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:04] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 10 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2821 variables, 1/2469 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:05] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:06] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:06] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:06] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:06] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:07] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2821 variables, 6/2475 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:07] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:08] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:08] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2821 variables, 3/2478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:10] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:10] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:10] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 11 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2821 variables, 3/2481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:12] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:12] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:12] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:13] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2821 variables, 4/2485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:14] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2821 variables, 1/2486 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:16] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2821 variables, 1/2487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2821 variables, 0/2487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 359/3180 variables, 188/2675 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3180 variables, 80/2755 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3180 variables, 4/2759 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:34] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:34] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:35] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 11 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/3180 variables, 3/2762 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:38] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 11 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/3180 variables, 1/2763 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3180/4083 variables, and 2763 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45019 ms.
Refiners :[Positive P Invariants (semi-flows): 665/900 constraints, State Equation: 1585/2083 constraints, ReadFeed: 451/459 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 31/31 constraints]
After SMT, in 59031ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 76 out of 2083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2083/2083 places, 2000/2000 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 2083 transition count 1988
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 2071 transition count 1988
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 24 place count 2071 transition count 1975
Deduced a syphon composed of 13 places in 14 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 50 place count 2058 transition count 1975
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 8 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 112 place count 2027 transition count 1944
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 12 places in 8 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 136 place count 2015 transition count 1958
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 2015 transition count 1958
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 144 place count 2008 transition count 1951
Applied a total of 144 rules in 376 ms. Remains 2008 /2083 variables (removed 75) and now considering 1951/2000 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 2008/2083 places, 1951/2000 transitions.
RANDOM walk for 40000 steps (8 resets) in 1123 ms. (35 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 632 ms. (63 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 609 ms. (65 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 515 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 584 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 443 ms. (90 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 552 ms. (72 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 75070 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 6
Probabilistic random walk after 75070 steps, saw 49445 distinct states, run finished after 3007 ms. (steps per millisecond=24 ) properties seen :0
// Phase 1: matrix 1951 rows 2008 cols
[2025-06-06 03:26:43] [INFO ] Computed 900 invariants in 5 ms
[2025-06-06 03:26:43] [INFO ] State equation strengthened by 465 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/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 258/334 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 978/1312 variables, 462/568 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1312 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1348/2660 variables, 1312/1880 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2660 variables, 465/2345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2660 variables, 0/2345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 362/3022 variables, 186/2531 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3022 variables, 86/2617 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3022 variables, 0/2617 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 6/3028 variables, 6/2623 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3028 variables, 6/2629 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3028 variables, 0/2629 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 12/3040 variables, 6/2635 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3040 variables, 0/2635 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 360/3400 variables, 194/2829 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3400 variables, 80/2909 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3400 variables, 0/2909 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 9/3409 variables, 11/2920 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3409 variables, 9/2929 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3409 variables, 0/2929 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 14/3423 variables, 7/2936 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3423 variables, 0/2936 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 223/3646 variables, 120/3056 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3646 variables, 46/3102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3646 variables, 0/3102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 6/3652 variables, 7/3109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3652 variables, 6/3115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3652 variables, 0/3115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 10/3662 variables, 5/3120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3662 variables, 0/3120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 132/3794 variables, 78/3198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3794 variables, 29/3227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/3794 variables, 0/3227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 4/3798 variables, 5/3232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3798 variables, 4/3236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/3798 variables, 0/3236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 6/3804 variables, 3/3239 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3804 variables, 0/3239 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (OVERLAPS) 102/3906 variables, 56/3295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3906 variables, 19/3314 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3906 variables, 0/3314 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (OVERLAPS) 4/3910 variables, 6/3320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3910 variables, 4/3324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3910 variables, 0/3324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (OVERLAPS) 4/3914 variables, 2/3326 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3914 variables, 0/3326 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (OVERLAPS) 30/3944 variables, 24/3350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/3944 variables, 10/3360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3944 variables, 0/3360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 51 (OVERLAPS) 12/3956 variables, 6/3366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3956 variables, 1/3367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/3956 variables, 0/3367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 54 (OVERLAPS) 1/3957 variables, 2/3369 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/3957 variables, 1/3370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/3957 variables, 0/3370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 57 (OVERLAPS) 2/3959 variables, 2/3372 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/3959 variables, 1/3373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/3959 variables, 0/3373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 60 (OVERLAPS) 0/3959 variables, 0/3373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3959/3959 variables, and 3373 constraints, problems are : Problem set: 0 solved, 6 unsolved in 12708 ms.
Refiners :[Positive P Invariants (semi-flows): 900/900 constraints, State Equation: 2008/2008 constraints, ReadFeed: 465/465 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 258/334 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:56] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 978/1312 variables, 462/569 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:56] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:56] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:56] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:57] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:57] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:57] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:57] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:57] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:57] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:57] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:57] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:57] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:57] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1312 variables, 13/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1312 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1348/2660 variables, 1312/1894 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2660 variables, 465/2359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2660 variables, 2/2361 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:26:59] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:00] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2660 variables, 2/2363 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2660 variables, 0/2363 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 362/3022 variables, 186/2549 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3022 variables, 86/2635 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3022 variables, 4/2639 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:05] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:05] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:06] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:06] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:06] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:08] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:11] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3022 variables, 7/2646 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:17] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3022 variables, 1/2647 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3022 variables, 0/2647 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 6/3028 variables, 6/2653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3028 variables, 6/2659 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3028 variables, 0/2659 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 12/3040 variables, 6/2665 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:35] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/3040 variables, 1/2666 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3040 variables, 0/2666 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 360/3400 variables, 194/2860 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3400 variables, 80/2940 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:46] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/3400 variables, 1/2941 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:51] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:51] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:51] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/3400 variables, 3/2944 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3400 variables, 0/2944 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 9/3409 variables, 11/2955 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3409 variables, 9/2964 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3409 variables, 0/2964 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 14/3423 variables, 7/2971 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3423 variables, 0/2971 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 223/3646 variables, 120/3091 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 87765ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 76 out of 2008 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2008/2008 places, 1951/1951 transitions.
Applied a total of 0 rules in 106 ms. Remains 2008 /2008 variables (removed 0) and now considering 1951/1951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 2008/2008 places, 1951/1951 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2008/2008 places, 1951/1951 transitions.
Applied a total of 0 rules in 66 ms. Remains 2008 /2008 variables (removed 0) and now considering 1951/1951 (removed 0) transitions.
[2025-06-06 03:28:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:28:12] [INFO ] Implicit Places using invariants in 1075 ms returned []
[2025-06-06 03:28:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:28:13] [INFO ] State equation strengthened by 465 read => feed constraints.
[2025-06-06 03:28:23] [INFO ] Implicit Places using invariants and state equation in 11050 ms returned []
Implicit Place search using SMT with State Equation took 12142 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:28:23] [INFO ] Redundant transitions in 105 ms returned []
Running 1939 sub problems to find dead transitions.
[2025-06-06 03:28:23] [INFO ] Invariant cache hit.
[2025-06-06 03:28:23] [INFO ] State equation strengthened by 465 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1999 variables, 358/358 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1999/3959 variables, and 358 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 358/900 constraints, State Equation: 0/2008 constraints, ReadFeed: 0/465 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1999 variables, 358/358 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1999/3959 variables, and 358 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 358/900 constraints, State Equation: 0/2008 constraints, ReadFeed: 0/465 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60866ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60877ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73209 ms. Remains : 2008/2008 places, 1951/1951 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 335 times.
Drop transitions (Partial Free agglomeration) removed 335 transitions
Iterating global reduction 0 with 335 rules applied. Total rules applied 335 place count 2008 transition count 1951
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 340 place count 2008 transition count 1946
Applied a total of 340 rules in 232 ms. Remains 2008 /2008 variables (removed 0) and now considering 1946/1951 (removed 5) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 1946 rows 2008 cols
[2025-06-06 03:29:24] [INFO ] Computed 900 invariants in 7 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 03:29:25] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 03:29:25] [INFO ] [Nat]Absence check using 900 positive place invariants in 140 ms returned sat
[2025-06-06 03:29:27] [INFO ] After 1337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2025-06-06 03:29:27] [INFO ] State equation strengthened by 317 read => feed constraints.
[2025-06-06 03:29:29] [INFO ] After 1734ms SMT Verify possible using 317 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:29:29] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:29:29] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:29:29] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:29:30] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:29:30] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:29:30] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:29:30] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 8 ms to minimize.
[2025-06-06 03:29:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1848 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:29:31] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:29:32] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:29:32] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:29:32] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 8 ms to minimize.
[2025-06-06 03:29:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1042 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:29:37] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:29:37] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 20 ms to minimize.
[2025-06-06 03:29:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 691 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:29:38] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:29:39] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 10 ms to minimize.
[2025-06-06 03:29:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 635 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:29:42] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 10 ms to minimize.
[2025-06-06 03:29:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:29:46] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 10 ms to minimize.
[2025-06-06 03:29:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 363 ms
TRAPS : Iteration 3
[2025-06-06 03:29:50] [INFO ] After 23518ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-06-06 03:29:54] [INFO ] After 28884ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2025-06-06 03:29:54] [INFO ] Flatten gal took : 171 ms
[2025-06-06 03:29:54] [INFO ] Flatten gal took : 86 ms
[2025-06-06 03:29:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10461467148178889462.gal : 16 ms
[2025-06-06 03:29:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4330797067211664013.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/ReachabilityCardinality10461467148178889462.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4330797067211664013.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/ReachabilityCardinality4330797067211664013.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 28
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :28 after 163
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :163 after 487
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :487 after 11665
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :11665 after 1.25971e+06
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1.25971e+06 after 3.36722e+10
Detected timeout of ITS tools.
[2025-06-06 03:30:09] [INFO ] Flatten gal took : 75 ms
[2025-06-06 03:30:09] [INFO ] Applying decomposition
[2025-06-06 03:30:09] [INFO ] Flatten gal took : 79 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/graph12671707686767353255.txt' '-o' '/tmp/graph12671707686767353255.bin' '-w' '/tmp/graph12671707686767353255.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12671707686767353255.bin' '-l' '-1' '-v' '-w' '/tmp/graph12671707686767353255.weights' '-q' '0' '-e' '0.001'
[2025-06-06 03:30:10] [INFO ] Decomposing Gal with order
[2025-06-06 03:30:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 03:30:10] [INFO ] Removed a total of 1173 redundant transitions.
[2025-06-06 03:30:10] [INFO ] Flatten gal took : 173 ms
[2025-06-06 03:30:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 252 labels/synchronizations in 276 ms.
[2025-06-06 03:30:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11598369139124415742.gal : 32 ms
[2025-06-06 03:30:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15278740675225638607.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/ReachabilityCardinality11598369139124415742.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15278740675225638607.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/ReachabilityCardinality15278740675225638607.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :3 after 19
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :19 after 19
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :19 after 19
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :19 after 19
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :19 after 19
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :19 after 19
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 61301 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-06 03:30:26] [INFO ] Flatten gal took : 146 ms
[2025-06-06 03:30:26] [INFO ] Applying decomposition
[2025-06-06 03:30:26] [INFO ] Flatten gal took : 147 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/graph5061370233460566586.txt' '-o' '/tmp/graph5061370233460566586.bin' '-w' '/tmp/graph5061370233460566586.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5061370233460566586.bin' '-l' '-1' '-v' '-w' '/tmp/graph5061370233460566586.weights' '-q' '0' '-e' '0.001'
[2025-06-06 03:30:26] [INFO ] Decomposing Gal with order
[2025-06-06 03:30:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 03:30:29] [INFO ] Removed a total of 600 redundant transitions.
[2025-06-06 03:30:29] [INFO ] Flatten gal took : 305 ms
[2025-06-06 03:30:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2025-06-06 03:30:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15611902607995824660.gal : 55 ms
[2025-06-06 03:30:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6951981126382615802.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/ReachabilityCardinality15611902607995824660.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6951981126382615802.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/ReachabilityCardinality6951981126382615802.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1 after 275556
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :2.64149e+11 after 1.27336e+23
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1.27336e+23 after 1.18396e+61
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :7.86256e+297 after 5.93654e+301
ITS-tools command line returned an error code 137
[2025-06-06 03:48:44] [INFO ] Flatten gal took : 747 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16859430297170200550
[2025-06-06 03:48:44] [INFO ] Too many transitions (1951) to apply POR reductions. Disabling POR matrices.
[2025-06-06 03:48:44] [INFO ] Applying decomposition
[2025-06-06 03:48:45] [INFO ] Built C files in 649ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16859430297170200550
Running compilation step : cd /tmp/ltsmin16859430297170200550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '120' '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'
[2025-06-06 03:48:45] [INFO ] Flatten gal took : 756 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/graph2969664821628923433.txt' '-o' '/tmp/graph2969664821628923433.bin' '-w' '/tmp/graph2969664821628923433.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2969664821628923433.bin' '-l' '-1' '-v' '-w' '/tmp/graph2969664821628923433.weights' '-q' '0' '-e' '0.001'
[2025-06-06 03:48:48] [INFO ] Decomposing Gal with order
[2025-06-06 03:48:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 03:48:49] [INFO ] Removed a total of 1906 redundant transitions.
[2025-06-06 03:48:49] [INFO ] Flatten gal took : 583 ms
Compilation finished in 5103 ms.
Running link step : cd /tmp/ltsmin16859430297170200550;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin16859430297170200550;'/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' 'ShieldIIPtPT100BReachabilityCardinality202501==true'
[2025-06-06 03:48:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 814 labels/synchronizations in 3465 ms.
[2025-06-06 03:48:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5463062814468333428.gal : 39 ms
[2025-06-06 03:48:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12871407462992689947.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/ReachabilityCardinality5463062814468333428.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12871407462992689947.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/ReachabilityCardinality12871407462992689947.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :10 after 10
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :10 after 10
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :10 after 629857
Invariant property ShieldIIPt-PT-100B-ReachabilityCardinality-2025-07 does not hold.
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1.0137e+18 after 1.80544e+97
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin16859430297170200550;'/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' 'ShieldIIPtPT100BReachabilityCardinality202501==true'
Running LTSmin : cd /tmp/ltsmin16859430297170200550;'/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' 'ShieldIIPtPT100BReachabilityCardinality202504==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin16859430297170200550;'/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' 'ShieldIIPtPT100BReachabilityCardinality202504==true'
Running LTSmin : cd /tmp/ltsmin16859430297170200550;'/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' 'ShieldIIPtPT100BReachabilityCardinality202505==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin16859430297170200550;'/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' 'ShieldIIPtPT100BReachabilityCardinality202505==true'
Running LTSmin : cd /tmp/ltsmin16859430297170200550;'/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' 'ShieldIIPtPT100BReachabilityCardinality202511==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin16859430297170200550;'/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' 'ShieldIIPtPT100BReachabilityCardinality202511==true'
Running LTSmin : cd /tmp/ltsmin16859430297170200550;'/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' 'ShieldIIPtPT100BReachabilityCardinality202515==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin16859430297170200550;'/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' 'ShieldIIPtPT100BReachabilityCardinality202515==true'
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin16859430297170200550;'/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' 'ShieldIIPtPT100BReachabilityCardinality202501==true'
WARNING : LTSmin timed out (>800 s) on command cd /tmp/ltsmin16859430297170200550;'/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' 'ShieldIIPtPT100BReachabilityCardinality202501==true'
Running LTSmin : cd /tmp/ltsmin16859430297170200550;'/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' 'ShieldIIPtPT100BReachabilityCardinality202504==true'
Detected timeout of ITS tools.
[2025-06-06 04:16:39] [INFO ] Applying decomposition
[2025-06-06 04:16:40] [INFO ] Flatten gal took : 677 ms
[2025-06-06 04:16:40] [INFO ] Decomposing Gal with order
[2025-06-06 04:16:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 04:16:42] [INFO ] Removed a total of 2098 redundant transitions.
[2025-06-06 04:16:42] [INFO ] Flatten gal took : 768 ms
[2025-06-06 04:16:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 1246 labels/synchronizations in 3679 ms.
[2025-06-06 04:16:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4579924161652851790.gal : 37 ms
[2025-06-06 04:16:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17847042562681278268.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/ReachabilityCardinality4579924161652851790.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17847042562681278268.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/ReachabilityCardinality17847042562681278268.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :3 after 19
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :19 after 19
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :19 after 19
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :19 after 19
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :19 after 19
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :19 after 19
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :19 after 11665
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1.0137e+18 after 1.0137e+18
WARNING : LTSmin timed out (>800 s) on command cd /tmp/ltsmin16859430297170200550;'/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' 'ShieldIIPtPT100BReachabilityCardinality202504==true'
Running LTSmin : cd /tmp/ltsmin16859430297170200550;'/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' 'ShieldIIPtPT100BReachabilityCardinality202505==true'
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-100B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-100B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894533000598"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100B.tgz
mv ShieldIIPt-PT-100B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;