About the Execution of ITS-Tools for FamilyReunion-COL-L00020M0002C001P001G001
| 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 | FFFTFT?FTF?FTTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860101900110.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 FamilyReunion-COL-L00020M0002C001P001G001, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860101900110
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 7.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 24 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 135K 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 FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-00
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-01
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-02
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-03
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-04
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-05
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-06
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-07
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-08
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-09
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-10
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-11
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-12
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-13
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-14
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1748675864061
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00020M0002C001P001G001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
ReachabilityCardinality COL
Running Version 202505121319
[2025-05-31 07:17:45] [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-05-31 07:17:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:17:46] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-05-31 07:17:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-31 07:17:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1046 ms
[2025-05-31 07:17:47] [INFO ] Detected 5 constant HL places corresponding to 11 PT places.
[2025-05-31 07:17:47] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 3292 PT places and 2774.0 transition bindings in 51 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
[2025-05-31 07:17:47] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 8 ms.
[2025-05-31 07:17:47] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
RANDOM walk for 40028 steps (28 resets) in 457 ms. (87 steps per ms) remains 9/15 properties
[2025-05-31 07:17:47] [INFO ] Flatten gal took : 91 ms
[2025-05-31 07:17:47] [INFO ] Flatten gal took : 14 ms
[2025-05-31 07:17:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14481327725476997963.gal : 15 ms
[2025-05-31 07:17:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14200754569897232214.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/ReachabilityCardinality14481327725476997963.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14200754569897232214.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 480 ms. (83 steps per ms) remains 9/9 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14200754569897232214.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :19 after 225
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :225 after 10595
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :10595 after 1.28777e+06
BEST_FIRST walk for 40003 steps (8 resets) in 594 ms. (67 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 623 ms. (64 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 463 ms. (86 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 497 ms. (80 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 418 ms. (95 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 9/9 properties
// Phase 1: matrix 66 rows 99 cols
[2025-05-31 07:17:48] [INFO ] Computed 33 invariants in 11 ms
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/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-00 is UNSAT
Problem FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-03 is UNSAT
Problem FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-07 is UNSAT
Problem FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-09 is UNSAT
At refinement iteration 2 (OVERLAPS) 14/83 variables, 4/6 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 10/16 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/16 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Problem FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-04 is UNSAT
Problem FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-08 is UNSAT
Problem FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-13 is UNSAT
Problem FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-14 is UNSAT
Problem FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-15 is UNSAT
After SMT solving in domain Real declared 99/165 variables, and 33 constraints, problems are : Problem set: 9 solved, 0 unsolved in 713 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/99 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 809ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
[2025-05-31 07:17:49] [INFO ] Flatten gal took : 13 ms
[2025-05-31 07:17:49] [INFO ] Flatten gal took : 11 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-31 07:17:49] [INFO ] Flatten gal took : 13 ms
[2025-05-31 07:17:49] [INFO ] Flatten gal took : 17 ms
[2025-05-31 07:17:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4171446962733945593.gal : 4 ms
[2025-05-31 07:17:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17768179387343769899.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/ReachabilityCardinality4171446962733945593.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17768179387343769899.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
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality17768179387343769899.prop.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-00 FALSE TECHNIQUES CPN_APPROX
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-03 TRUE TECHNIQUES CPN_APPROX
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-04 FALSE TECHNIQUES CPN_APPROX
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-07 FALSE TECHNIQUES CPN_APPROX
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-08 TRUE TECHNIQUES CPN_APPROX
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-09 FALSE TECHNIQUES CPN_APPROX
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-12 TRUE TECHNIQUES CPN_APPROX
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-13 TRUE TECHNIQUES CPN_APPROX
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-14 FALSE TECHNIQUES CPN_APPROX
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-15 TRUE TECHNIQUES CPN_APPROX
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 2
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
[2025-05-31 07:17:49] [INFO ] Unfolded HLPN to a Petri net with 3095 places and 2438 transitions 6997 arcs in 87 ms.
[2025-05-31 07:17:49] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Deduced a syphon composed of 21 places in 26 ms
Reduce places removed 30 places and 0 transitions.
[2025-05-31 07:17:50] [INFO ] Flatten gal took : 309 ms
RANDOM walk for 40000 steps (32 resets) in 2117 ms. (18 steps per ms) remains 3/6 properties
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 275 ms. (144 steps per ms) remains 3/3 properties
[2025-05-31 07:17:50] [INFO ] Flatten gal took : 274 ms
BEST_FIRST walk for 40003 steps (8 resets) in 280 ms. (142 steps per ms) remains 3/3 properties
[2025-05-31 07:17:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality535757947954325267.gal : 122 ms
[2025-05-31 07:17:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6692620558834760965.prop : 10 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/ReachabilityCardinality535757947954325267.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6692620558834760965.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 ...327
Loading property file /tmp/ReachabilityCardinality6692620558834760965.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 2619 ms. (15 steps per ms) remains 3/3 properties
// Phase 1: matrix 2438 rows 3065 cols
[2025-05-31 07:17:51] [INFO ] Computed 747 invariants in 226 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/1163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 732/1895 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1895 variables, 59/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1895 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1167/3062 variables, 660/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3062 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/3065 variables, 2/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3065 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5503/5503 variables, and 3812 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 721/721 constraints, State Equation: 3065/3065 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 732/1895 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1895 variables, 59/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:17:58] [INFO ] Deduced a trap composed of 32 places in 913 ms of which 72 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1895 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1895 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1167/3062 variables, 660/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 5
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 20
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :20 after 25
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :25 after 135
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :135 after 255
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :255 after 2057
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :2057 after 12167
[2025-05-31 07:18:02] [INFO ] Deduced a trap composed of 55 places in 2038 ms of which 157 ms to minimize.
SMT process timed out in 10626ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1163 out of 3065 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3065/3065 places, 2438/2438 transitions.
Graph (complete) has 4456 edges and 3065 vertex of which 2996 are kept as prefixes of interest. Removing 69 places using SCC suffix rule.10 ms
Discarding 69 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Discarding 378 places :
Implicit places reduction removed 378 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 483 rules applied. Total rules applied 484 place count 2618 transition count 2310
Reduce places removed 105 places and 0 transitions.
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Iterating post reduction 1 with 210 rules applied. Total rules applied 694 place count 2513 transition count 2205
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 2 with 105 rules applied. Total rules applied 799 place count 2408 transition count 2205
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 799 place count 2408 transition count 2100
Deduced a syphon composed of 105 places in 4 ms
Ensure Unique test removed 21 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 231 rules applied. Total rules applied 1030 place count 2282 transition count 2100
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 3 with 21 rules applied. Total rules applied 1051 place count 2261 transition count 2100
Discarding 105 places :
Symmetric choice reduction at 4 with 105 rule applications. Total rules 1156 place count 2156 transition count 1995
Iterating global reduction 4 with 105 rules applied. Total rules applied 1261 place count 2156 transition count 1995
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 1429 place count 2072 transition count 1911
Applied a total of 1429 rules in 659 ms. Remains 2072 /3065 variables (removed 993) and now considering 1911/2438 (removed 527) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 673 ms. Remains : 2072/3065 places, 1911/2438 transitions.
RANDOM walk for 40000 steps (40 resets) in 915 ms. (43 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2092 ms. (19 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 195563 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 3
Probabilistic random walk after 195563 steps, saw 67276 distinct states, run finished after 3009 ms. (steps per millisecond=64 ) properties seen :0
// Phase 1: matrix 1911 rows 2072 cols
[2025-05-31 07:18:06] [INFO ] Computed 281 invariants in 54 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :12167 after 1.04853e+06
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 888/2051 variables, 281/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2051 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1911/3962 variables, 2051/2332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.04853e+06 after 4.59746e+08
At refinement iteration 4 (INCLUDED_ONLY) 0/3962 variables, 0/2332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 21/3983 variables, 21/2353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3983 variables, 0/2353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/3983 variables, 0/2353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3983/3983 variables, and 2353 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6225 ms.
Refiners :[Generalized P Invariants (flows): 281/281 constraints, State Equation: 2072/2072 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 888/2051 variables, 281/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:15] [INFO ] Deduced a trap composed of 49 places in 1573 ms of which 205 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:17] [INFO ] Deduced a trap composed of 49 places in 1747 ms of which 208 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:18] [INFO ] Deduced a trap composed of 49 places in 1770 ms of which 211 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:20] [INFO ] Deduced a trap composed of 49 places in 1778 ms of which 198 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:22] [INFO ] Deduced a trap composed of 49 places in 1748 ms of which 202 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:24] [INFO ] Deduced a trap composed of 49 places in 1773 ms of which 192 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:26] [INFO ] Deduced a trap composed of 49 places in 1676 ms of which 178 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:27] [INFO ] Deduced a trap composed of 49 places in 1701 ms of which 180 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:29] [INFO ] Deduced a trap composed of 49 places in 1663 ms of which 173 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:31] [INFO ] Deduced a trap composed of 49 places in 1637 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:32] [INFO ] Deduced a trap composed of 49 places in 1616 ms of which 173 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:34] [INFO ] Deduced a trap composed of 49 places in 1584 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:36] [INFO ] Deduced a trap composed of 49 places in 1530 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:37] [INFO ] Deduced a trap composed of 49 places in 1483 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:39] [INFO ] Deduced a trap composed of 49 places in 1436 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:40] [INFO ] Deduced a trap composed of 49 places in 1354 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:41] [INFO ] Deduced a trap composed of 49 places in 1282 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:43] [INFO ] Deduced a trap composed of 49 places in 1320 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:44] [INFO ] Deduced a trap composed of 49 places in 1100 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:45] [INFO ] Deduced a trap composed of 49 places in 1201 ms of which 106 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2051 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:46] [INFO ] Deduced a trap composed of 38 places in 984 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:47] [INFO ] Deduced a trap composed of 49 places in 1150 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:48] [INFO ] Deduced a trap composed of 49 places in 627 ms of which 58 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2051 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:50] [INFO ] Deduced a trap composed of 49 places in 1108 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:51] [INFO ] Deduced a trap composed of 49 places in 1034 ms of which 83 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2051 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:52] [INFO ] Deduced a trap composed of 49 places in 1106 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:53] [INFO ] Deduced a trap composed of 49 places in 1040 ms of which 83 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2051 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:55] [INFO ] Deduced a trap composed of 49 places in 1203 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:56] [INFO ] Deduced a trap composed of 49 places in 1120 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:18:57] [INFO ] Deduced a trap composed of 49 places in 1041 ms of which 84 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2051 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2051/3983 variables, and 311 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45010 ms.
Refiners :[Generalized P Invariants (flows): 281/281 constraints, State Equation: 0/2072 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51346ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1163 out of 2072 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2072/2072 places, 1911/1911 transitions.
Applied a total of 0 rules in 107 ms. Remains 2072 /2072 variables (removed 0) and now considering 1911/1911 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 2072/2072 places, 1911/1911 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2072/2072 places, 1911/1911 transitions.
Applied a total of 0 rules in 117 ms. Remains 2072 /2072 variables (removed 0) and now considering 1911/1911 (removed 0) transitions.
[2025-05-31 07:18:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:18:59] [INFO ] Implicit Places using invariants in 1007 ms returned [210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 1032, 1033, 1034, 1035, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1309, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1317, 1318, 1319, 1320, 1321, 1322, 1323, 1324, 1325, 1326, 1327, 1328, 1329, 1902, 1903, 1904, 1905, 1906, 1907, 1908, 1909, 1910, 1911, 1912, 1913, 1914, 1915, 1916, 1917, 1918, 1919, 1920, 1921, 1922, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2025, 2026, 2027, 2028, 2029]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 1024 ms to find 105 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1967/2072 places, 1911/1911 transitions.
Free-agglomeration rule applied 63 times.
Iterating global reduction 0 with 63 rules applied. Total rules applied 63 place count 1967 transition count 1848
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 126 place count 1904 transition count 1848
Applied a total of 126 rules in 171 ms. Remains 1904 /1967 variables (removed 63) and now considering 1848/1911 (removed 63) transitions.
// Phase 1: matrix 1848 rows 1904 cols
[2025-05-31 07:18:59] [INFO ] Computed 176 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:19:00] [INFO ] Implicit Places using invariants in 586 ms returned []
[2025-05-31 07:19:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:19:03] [INFO ] Implicit Places using invariants and state equation in 3166 ms returned []
Implicit Place search using SMT with State Equation took 3756 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1904/2072 places, 1848/1911 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5075 ms. Remains : 1904/2072 places, 1848/1911 transitions.
RANDOM walk for 40000 steps (40 resets) in 630 ms. (63 steps per ms) remains 2/3 properties
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1675 ms. (23 steps per ms) remains 2/2 properties
[2025-05-31 07:19:03] [INFO ] Invariant cache hit.
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/1121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 741/1862 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1862 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/1883 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1883 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1848/3731 variables, 1883/2059 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3731 variables, 0/2059 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 21/3752 variables, 21/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3752 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/3752 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3752/3752 variables, and 2080 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6178 ms.
Refiners :[Generalized P Invariants (flows): 176/176 constraints, State Equation: 1904/1904 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 741/1862 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1862 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/1883 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:12] [INFO ] Deduced a trap composed of 42 places in 1663 ms of which 172 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:14] [INFO ] Deduced a trap composed of 42 places in 1669 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:16] [INFO ] Deduced a trap composed of 42 places in 1676 ms of which 182 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:17] [INFO ] Deduced a trap composed of 42 places in 1682 ms of which 174 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:19] [INFO ] Deduced a trap composed of 42 places in 1441 ms of which 172 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:20] [INFO ] Deduced a trap composed of 42 places in 1554 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:22] [INFO ] Deduced a trap composed of 42 places in 1503 ms of which 162 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:23] [INFO ] Deduced a trap composed of 42 places in 1472 ms of which 155 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:25] [INFO ] Deduced a trap composed of 42 places in 1426 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:26] [INFO ] Deduced a trap composed of 42 places in 1199 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:28] [INFO ] Deduced a trap composed of 42 places in 1389 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:29] [INFO ] Deduced a trap composed of 42 places in 1321 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:30] [INFO ] Deduced a trap composed of 42 places in 1289 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:32] [INFO ] Deduced a trap composed of 42 places in 1226 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:33] [INFO ] Deduced a trap composed of 42 places in 1211 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:34] [INFO ] Deduced a trap composed of 42 places in 1184 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:35] [INFO ] Deduced a trap composed of 42 places in 1160 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:36] [INFO ] Deduced a trap composed of 42 places in 1082 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:37] [INFO ] Deduced a trap composed of 42 places in 1039 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:39] [INFO ] Deduced a trap composed of 42 places in 1020 ms of which 74 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1883 variables, 20/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:40] [INFO ] Deduced a trap composed of 55 places in 1686 ms of which 221 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:42] [INFO ] Deduced a trap composed of 55 places in 1620 ms of which 221 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:44] [INFO ] Deduced a trap composed of 55 places in 1546 ms of which 204 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:45] [INFO ] Deduced a trap composed of 55 places in 1448 ms of which 194 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:47] [INFO ] Deduced a trap composed of 55 places in 1393 ms of which 185 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:48] [INFO ] Deduced a trap composed of 55 places in 1319 ms of which 174 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:49] [INFO ] Deduced a trap composed of 55 places in 1281 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:50] [INFO ] Deduced a trap composed of 55 places in 1234 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,3 properties remain. new max is 4096
[2025-05-31 07:19:52] [INFO ] Deduced a trap composed of 55 places in 1163 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :4.59746e+08 after 6.30427e+09
[2025-05-31 07:19:53] [INFO ] Deduced a trap composed of 55 places in 1126 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:54] [INFO ] Deduced a trap composed of 55 places in 1065 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:55] [INFO ] Deduced a trap composed of 55 places in 1007 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:56] [INFO ] Deduced a trap composed of 55 places in 939 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:57] [INFO ] Deduced a trap composed of 55 places in 879 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:58] [INFO ] Deduced a trap composed of 55 places in 890 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:59] [INFO ] Deduced a trap composed of 55 places in 814 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:19:59] [INFO ] Deduced a trap composed of 55 places in 724 ms of which 66 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1883 variables, 17/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:01] [INFO ] Deduced a trap composed of 42 places in 1004 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:02] [INFO ] Deduced a trap composed of 55 places in 900 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:03] [INFO ] Deduced a trap composed of 55 places in 874 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:03] [INFO ] Deduced a trap composed of 55 places in 814 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:04] [INFO ] Deduced a trap composed of 55 places in 736 ms of which 67 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1883 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1883 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1848/3731 variables, 1883/2101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3731 variables, 1/2102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3731 variables, 0/2102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 21/3752 variables, 21/2123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3752/3752 variables, and 2123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 75024 ms.
Refiners :[Generalized P Invariants (flows): 176/176 constraints, State Equation: 1904/1904 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 81243ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1121 out of 1904 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1904/1904 places, 1848/1848 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 0 place count 1904 transition count 1806
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 1862 transition count 1806
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 0 with 42 rules applied. Total rules applied 126 place count 1820 transition count 1806
Applied a total of 126 rules in 101 ms. Remains 1820 /1904 variables (removed 84) and now considering 1806/1848 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 1820/1904 places, 1806/1848 transitions.
RANDOM walk for 40000 steps (44 resets) in 861 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1586 ms. (25 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 236601 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 2
Probabilistic random walk after 236601 steps, saw 72940 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
// Phase 1: matrix 1806 rows 1820 cols
[2025-05-31 07:20:29] [INFO ] Computed 134 invariants in 19 ms
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 488/1609 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1609 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1609 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 190/1799 variables, 28/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1799 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1806/3605 variables, 1799/1933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :6.30427e+09 after 8.92662e+09
At refinement iteration 7 (INCLUDED_ONLY) 0/3605 variables, 0/1933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 21/3626 variables, 21/1954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3626 variables, 0/1954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/3626 variables, 0/1954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3626/3626 variables, and 1954 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6911 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 132/132 constraints, State Equation: 1820/1820 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 488/1609 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1609 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1609 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 190/1799 variables, 28/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:38] [INFO ] Deduced a trap composed of 42 places in 1550 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:39] [INFO ] Deduced a trap composed of 42 places in 1549 ms of which 173 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:41] [INFO ] Deduced a trap composed of 42 places in 1524 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:43] [INFO ] Deduced a trap composed of 42 places in 1486 ms of which 166 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:44] [INFO ] Deduced a trap composed of 42 places in 1432 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:45] [INFO ] Deduced a trap composed of 42 places in 1316 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:47] [INFO ] Deduced a trap composed of 42 places in 1450 ms of which 160 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:48] [INFO ] Deduced a trap composed of 42 places in 1391 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:50] [INFO ] Deduced a trap composed of 42 places in 1371 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:51] [INFO ] Deduced a trap composed of 42 places in 1311 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:52] [INFO ] Deduced a trap composed of 42 places in 1283 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:54] [INFO ] Deduced a trap composed of 42 places in 1262 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:55] [INFO ] Deduced a trap composed of 42 places in 1215 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:56] [INFO ] Deduced a trap composed of 42 places in 1190 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:57] [INFO ] Deduced a trap composed of 42 places in 1183 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:20:59] [INFO ] Deduced a trap composed of 42 places in 1147 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:00] [INFO ] Deduced a trap composed of 42 places in 1106 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:01] [INFO ] Deduced a trap composed of 42 places in 1066 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:02] [INFO ] Deduced a trap composed of 42 places in 1032 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:03] [INFO ] Deduced a trap composed of 42 places in 989 ms of which 67 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1799 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:04] [INFO ] Deduced a trap composed of 42 places in 942 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:06] [INFO ] Deduced a trap composed of 55 places in 1593 ms of which 209 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:07] [INFO ] Deduced a trap composed of 55 places in 1545 ms of which 204 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:09] [INFO ] Deduced a trap composed of 55 places in 1458 ms of which 195 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:10] [INFO ] Deduced a trap composed of 55 places in 1424 ms of which 186 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:12] [INFO ] Deduced a trap composed of 55 places in 1382 ms of which 178 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:13] [INFO ] Deduced a trap composed of 55 places in 1281 ms of which 179 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:14] [INFO ] Deduced a trap composed of 55 places in 1240 ms of which 161 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:16] [INFO ] Deduced a trap composed of 55 places in 1229 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:17] [INFO ] Deduced a trap composed of 55 places in 1149 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:18] [INFO ] Deduced a trap composed of 55 places in 1099 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:19] [INFO ] Deduced a trap composed of 55 places in 1050 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:20] [INFO ] Deduced a trap composed of 55 places in 977 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:21] [INFO ] Deduced a trap composed of 55 places in 965 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:22] [INFO ] Deduced a trap composed of 55 places in 888 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:23] [INFO ] Deduced a trap composed of 55 places in 854 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:24] [INFO ] Deduced a trap composed of 55 places in 786 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:24] [INFO ] Deduced a trap composed of 55 places in 720 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:25] [INFO ] Deduced a trap composed of 55 places in 683 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:26] [INFO ] Deduced a trap composed of 55 places in 669 ms of which 60 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1799 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:27] [INFO ] Deduced a trap composed of 55 places in 760 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:28] [INFO ] Deduced a trap composed of 55 places in 699 ms of which 67 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1799 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1799 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1806/3605 variables, 1799/1975 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3605 variables, 1/1976 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3605 variables, 0/1976 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 21/3626 variables, 21/1997 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3626 variables, 0/1997 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3626/3626 variables, and 1997 constraints, problems are : Problem set: 0 solved, 2 unsolved in 90025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 132/132 constraints, State Equation: 1820/1820 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 96985ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1121 out of 1820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1820/1820 places, 1806/1806 transitions.
Applied a total of 0 rules in 44 ms. Remains 1820 /1820 variables (removed 0) and now considering 1806/1806 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1820/1820 places, 1806/1806 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1820/1820 places, 1806/1806 transitions.
Applied a total of 0 rules in 42 ms. Remains 1820 /1820 variables (removed 0) and now considering 1806/1806 (removed 0) transitions.
[2025-05-31 07:22:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:22:06] [INFO ] Implicit Places using invariants in 460 ms returned []
[2025-05-31 07:22:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:22:09] [INFO ] Implicit Places using invariants and state equation in 3079 ms returned []
Implicit Place search using SMT with State Equation took 3542 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:22:09] [INFO ] Redundant transitions in 185 ms returned []
Running 1743 sub problems to find dead transitions.
[2025-05-31 07:22:09] [INFO ] Invariant cache hit.
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/1772 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 1743 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1772/3626 variables, and 128 constraints, problems are : Problem set: 0 solved, 1743 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 128/132 constraints, State Equation: 0/1820 constraints, PredecessorRefiner: 1743/1743 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1743 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1772 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 1743 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 0)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1772/3626 variables, and 128 constraints, problems are : Problem set: 0 solved, 1743 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 128/132 constraints, State Equation: 0/1820 constraints, PredecessorRefiner: 0/1743 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60691ms problems are : Problem set: 0 solved, 1743 unsolved
Search for dead transitions found 0 dead transitions in 60701ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64488 ms. Remains : 1820/1820 places, 1806/1806 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 07:23:10] [INFO ] Flatten gal took : 135 ms
[2025-05-31 07:23:10] [INFO ] Applying decomposition
[2025-05-31 07:23:11] [INFO ] Flatten gal took : 115 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/graph8707198452969062155.txt' '-o' '/tmp/graph8707198452969062155.bin' '-w' '/tmp/graph8707198452969062155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8707198452969062155.bin' '-l' '-1' '-v' '-w' '/tmp/graph8707198452969062155.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:23:11] [INFO ] Decomposing Gal with order
[2025-05-31 07:23:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:23:13] [INFO ] Removed a total of 342 redundant transitions.
[2025-05-31 07:23:13] [INFO ] Flatten gal took : 873 ms
[2025-05-31 07:23:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 393 labels/synchronizations in 143 ms.
[2025-05-31 07:23:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7895398353039362607.gal : 54 ms
[2025-05-31 07:23:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18327054583085820941.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7895398353039362607.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18327054583085820941.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/ReachabilityCardinality18327054583085820941.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 10
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :10 after 55
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :55 after 451
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :451 after 6292
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :6292 after 60214
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :60214 after 124219
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :124219 after 279841
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :279841 after 2.07669e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.07669e+06 after 1.65841e+07
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.65841e+07 after 2.54531e+07
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.54531e+07 after 3.83655e+08
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :3.83655e+08 after 2.36187e+09
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.36187e+09 after 1.85419e+11
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.85419e+11 after 2.84699e+11
Detected timeout of ITS tools.
[2025-05-31 07:53:14] [INFO ] Flatten gal took : 118 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16473997398433394528
[2025-05-31 07:53:14] [INFO ] Too many transitions (1806) to apply POR reductions. Disabling POR matrices.
[2025-05-31 07:53:14] [INFO ] Applying decomposition
[2025-05-31 07:53:14] [INFO ] Flatten gal took : 63 ms
[2025-05-31 07:53:14] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16473997398433394528
Running compilation step : cd /tmp/ltsmin16473997398433394528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph3411516959576107610.txt' '-o' '/tmp/graph3411516959576107610.bin' '-w' '/tmp/graph3411516959576107610.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3411516959576107610.bin' '-l' '-1' '-v' '-w' '/tmp/graph3411516959576107610.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:53:14] [INFO ] Decomposing Gal with order
[2025-05-31 07:53:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:53:15] [INFO ] Removed a total of 320 redundant transitions.
[2025-05-31 07:53:15] [INFO ] Flatten gal took : 456 ms
[2025-05-31 07:53:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 33 ms.
[2025-05-31 07:53:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11177311556832679889.gal : 18 ms
[2025-05-31 07:53:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13899255578877513450.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11177311556832679889.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13899255578877513450.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 ...330
Loading property file /tmp/ReachabilityCardinality13899255578877513450.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 30
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :30 after 230
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :230 after 690
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :690 after 3328
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3328 after 172788
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :172788 after 1.83513e+08
Compilation finished in 6693 ms.
Running link step : cd /tmp/ltsmin16473997398433394528;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin16473997398433394528;'/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' 'FamilyReunionCOLL00020M0002C001P001G001ReachabilityCardinality202506==true'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin16473997398433394528;'/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' 'FamilyReunionCOLL00020M0002C001P001G001ReachabilityCardinality202506==true'
Running LTSmin : cd /tmp/ltsmin16473997398433394528;'/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' 'FamilyReunionCOLL00020M0002C001P001G001ReachabilityCardinality202510==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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="FamilyReunion-COL-L00020M0002C001P001G001"
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 FamilyReunion-COL-L00020M0002C001P001G001, 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 r086-smll-174860101900110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00020M0002C001P001G001.tgz
mv FamilyReunion-COL-L00020M0002C001P001G001 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 ;