Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854027700079.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 CloudDeployment-PT-6b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854027700079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.8M 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 CloudDeployment-PT-6b-ReachabilityFireability-2024-14
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityFireability-2025-00
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityFireability-2025-01
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityFireability-2025-02
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityFireability-2025-03
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityFireability-2025-04
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityFireability-2025-05
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityFireability-2025-06
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityFireability-2025-07
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityFireability-2025-08
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityFireability-2025-09
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityFireability-2025-10
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityFireability-2025-11
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityFireability-2025-12
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityFireability-2025-13
FORMULA_NAME CloudDeployment-PT-6b-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748561981187

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-29 23:39:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 23:39:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 23:39:42] [INFO ] Load time of PNML (sax parser for PT used): 408 ms
[2025-05-29 23:39:42] [INFO ] Transformed 1888 places.
[2025-05-29 23:39:42] [INFO ] Transformed 6804 transitions.
[2025-05-29 23:39:42] [INFO ] Found NUPN structural information;
[2025-05-29 23:39:42] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 558 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (202 resets) in 2087 ms. (19 steps per ms) remains 13/16 properties
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (28 resets) in 368 ms. (108 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (31 resets) in 1132 ms. (35 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (15 resets) in 810 ms. (49 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (21 resets) in 293 ms. (136 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (29 resets) in 405 ms. (98 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (27 resets) in 196 ms. (203 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (29 resets) in 1321 ms. (30 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (27 resets) in 177 ms. (224 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (27 resets) in 229 ms. (173 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (30 resets) in 340 ms. (117 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (23 resets) in 620 ms. (64 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (24 resets) in 331 ms. (120 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (15 resets) in 451 ms. (88 steps per ms) remains 13/13 properties
[2025-05-29 23:39:45] [INFO ] Flatten gal took : 1994 ms
// Phase 1: matrix 6804 rows 1888 cols
[2025-05-29 23:39:45] [INFO ] Computed 25 invariants in 188 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/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-05-29 23:39:46] [INFO ] Flatten gal took : 1108 ms
At refinement iteration 3 (OVERLAPS) 1769/1887 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-05-29 23:39:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6069477214742903599.gal : 214 ms
[2025-05-29 23:39:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13280485112978026251.prop : 12 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/ReachabilityCardinality6069477214742903599.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13280485112978026251.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
At refinement iteration 4 (INCLUDED_ONLY) 0/1887 variables, 1769/1912 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Loading property file /tmp/ReachabilityCardinality13280485112978026251.prop.
At refinement iteration 5 (INCLUDED_ONLY) 0/1887 variables, 0/1912 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SMT process timed out in 5483ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 118 out of 1888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1888/1888 places, 6804/6804 transitions.
Graph (trivial) has 1663 edges and 1888 vertex of which 303 / 1888 are part of one of the 31 SCC in 8 ms
Free SCC test removed 272 places
Drop transitions (Empty/Sink Transition effects.) removed 333 transitions
Reduce isomorphic transitions removed 333 transitions.
Graph (complete) has 4527 edges and 1616 vertex of which 1604 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.21 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 634 transitions
Trivial Post-agglo rules discarded 634 transitions
Performed 634 trivial Post agglomeration. Transition count delta: 634
Iterating post reduction 0 with 637 rules applied. Total rules applied 639 place count 1604 transition count 5828
Reduce places removed 634 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 648 rules applied. Total rules applied 1287 place count 970 transition count 5814
Reduce places removed 5 places and 0 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Iterating post reduction 2 with 67 rules applied. Total rules applied 1354 place count 965 transition count 5752
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1417 place count 903 transition count 5751
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 65 Pre rules applied. Total rules applied 1417 place count 903 transition count 5686
Deduced a syphon composed of 65 places in 4 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 1547 place count 838 transition count 5686
Discarding 308 places :
Symmetric choice reduction at 4 with 308 rule applications. Total rules 1855 place count 530 transition count 5378
Iterating global reduction 4 with 308 rules applied. Total rules applied 2163 place count 530 transition count 5378
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 29 rules applied. Total rules applied 2192 place count 530 transition count 5349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2193 place count 529 transition count 5349
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 2193 place count 529 transition count 5338
Deduced a syphon composed of 11 places in 18 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 2215 place count 518 transition count 5338
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2219 place count 514 transition count 5334
Iterating global reduction 6 with 4 rules applied. Total rules applied 2223 place count 514 transition count 5334
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2226 place count 511 transition count 5331
Iterating global reduction 6 with 3 rules applied. Total rules applied 2229 place count 511 transition count 5331
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2231 place count 509 transition count 5329
Iterating global reduction 6 with 2 rules applied. Total rules applied 2233 place count 509 transition count 5329
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2234 place count 508 transition count 5328
Iterating global reduction 6 with 1 rules applied. Total rules applied 2235 place count 508 transition count 5328
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 13 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 6 with 210 rules applied. Total rules applied 2445 place count 403 transition count 5223
Performed 40 Post agglomeration using F-continuation condition with reduction of 33 identical transitions.
Deduced a syphon composed of 40 places in 13 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 2525 place count 363 transition count 5460
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2538 place count 363 transition count 5447
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 5 places in 14 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 2548 place count 358 transition count 5497
Drop transitions (Redundant composition of simpler transitions.) removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 7 with 66 rules applied. Total rules applied 2614 place count 358 transition count 5431
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2616 place count 357 transition count 5444
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2617 place count 357 transition count 5443
Free-agglomeration rule applied 31 times.
Iterating global reduction 7 with 31 rules applied. Total rules applied 2648 place count 357 transition count 5412
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 7 with 81 rules applied. Total rules applied 2729 place count 326 transition count 5362
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2731 place count 324 transition count 5347
Iterating global reduction 8 with 2 rules applied. Total rules applied 2733 place count 324 transition count 5347
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 8 with 30 rules applied. Total rules applied 2763 place count 324 transition count 5317
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2765 place count 324 transition count 5317
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2767 place count 322 transition count 5317
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 2777 place count 322 transition count 5317
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 2779 place count 322 transition count 5315
Applied a total of 2779 rules in 1446 ms. Remains 322 /1888 variables (removed 1566) and now considering 5315/6804 (removed 1489) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1458 ms. Remains : 322/1888 places, 5315/6804 transitions.
RANDOM walk for 40000 steps (580 resets) in 1561 ms. (25 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (107 resets) in 230 ms. (173 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (114 resets) in 464 ms. (86 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (39 resets) in 531 ms. (75 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (57 resets) in 210 ms. (189 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (109 resets) in 307 ms. (129 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (94 resets) in 131 ms. (303 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (99 resets) in 289 ms. (137 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (92 resets) in 126 ms. (314 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (88 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (104 resets) in 253 ms. (157 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (54 resets) in 441 ms. (90 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (77 resets) in 246 ms. (161 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (32 resets) in 305 ms. (130 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 152831 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 13
Probabilistic random walk after 152831 steps, saw 29005 distinct states, run finished after 3005 ms. (steps per millisecond=50 ) properties seen :0
[2025-05-29 23:39:57] [INFO ] Flow matrix only has 5108 transitions (discarded 207 similar events)
// Phase 1: matrix 5108 rows 322 cols
[2025-05-29 23:39:57] [INFO ] Computed 22 invariants in 83 ms
[2025-05-29 23:39:57] [INFO ] State equation strengthened by 223 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 134/252 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 5078/5330 variables, 252/274 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5330 variables, 194/468 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5330 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem CloudDeployment-PT-6b-ReachabilityFireability-2025-01 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-6b-ReachabilityFireability-2025-02 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-6b-ReachabilityFireability-2025-04 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-6b-ReachabilityFireability-2025-05 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-6b-ReachabilityFireability-2025-07 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2025-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-6b-ReachabilityFireability-2025-09 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-6b-ReachabilityFireability-2025-10 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-6b-ReachabilityFireability-2025-13 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 96/5426 variables, 67/535 constraints. Problems are: Problem set: 8 solved, 5 unsolved
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :11 after 13
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :13 after 41
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :41 after 127
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :127 after 1929
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :1929 after 65607
At refinement iteration 8 (INCLUDED_ONLY) 0/5426 variables, 23/558 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5426 variables, 0/558 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/5430 variables, 3/561 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5430 variables, 6/567 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5430 variables, 0/567 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/5430 variables, 0/567 constraints. Problems are: Problem set: 8 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5430/5430 variables, and 567 constraints, problems are : Problem set: 8 solved, 5 unsolved in 25797 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 322/322 constraints, ReadFeed: 223/223 constraints, PredecessorRefiner: 13/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 159/235 variables, 21/22 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/22 constraints. Problems are: Problem set: 8 solved, 5 unsolved
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :65607 after 1.59953e+06
At refinement iteration 4 (OVERLAPS) 5029/5264 variables, 235/257 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5264 variables, 193/450 constraints. Problems are: Problem set: 8 solved, 5 unsolved
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :1.59953e+06 after 1.65329e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/5264 variables, 0/450 constraints. Problems are: Problem set: 8 solved, 5 unsolved
Problem CloudDeployment-PT-6b-ReachabilityFireability-2025-00 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-6b-ReachabilityFireability-2025-06 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2025-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 138/5402 variables, 68/518 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5402 variables, 18/536 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5402 variables, 0/536 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 27/5429 variables, 18/554 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5429 variables, 12/566 constraints. Problems are: Problem set: 10 solved, 3 unsolved
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :1.65329e+06 after 1.66961e+06
At refinement iteration 12 (INCLUDED_ONLY) 0/5429 variables, 0/566 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/5430 variables, 1/567 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5430 variables, 0/567 constraints. Problems are: Problem set: 10 solved, 3 unsolved
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :1.66961e+06 after 1.72153e+06
At refinement iteration 15 (OVERLAPS) 0/5430 variables, 0/567 constraints. Problems are: Problem set: 10 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5430/5430 variables, and 567 constraints, problems are : Problem set: 10 solved, 3 unsolved in 6510 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 322/322 constraints, ReadFeed: 223/223 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32537ms problems are : Problem set: 10 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2025-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2025-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 341 ms.
Support contains 48 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 5315/5315 transitions.
Graph (trivial) has 195 edges and 322 vertex of which 39 / 322 are part of one of the 15 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 298 transition count 5248
Reduce places removed 22 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 25 rules applied. Total rules applied 48 place count 276 transition count 5245
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 273 transition count 5245
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 51 place count 273 transition count 5232
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 77 place count 260 transition count 5232
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 81 place count 256 transition count 5228
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 256 transition count 5228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 256 transition count 5227
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 86 place count 256 transition count 5226
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 255 transition count 5226
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 128 place count 235 transition count 5206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 129 place count 235 transition count 5205
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 145 place count 227 transition count 5269
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 178 place count 227 transition count 5236
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 180 place count 226 transition count 5249
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 197 place count 226 transition count 5232
Drop transitions (Redundant composition of simpler transitions.) removed 119 transitions
Redundant transition composition rules discarded 119 transitions
Iterating global reduction 7 with 119 rules applied. Total rules applied 316 place count 226 transition count 5113
Free-agglomeration rule applied 17 times with reduction of 1 identical transitions.
Iterating global reduction 7 with 17 rules applied. Total rules applied 333 place count 226 transition count 5095
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 7 with 56 rules applied. Total rules applied 389 place count 209 transition count 5056
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 390 place count 208 transition count 5048
Iterating global reduction 8 with 1 rules applied. Total rules applied 391 place count 208 transition count 5048
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 8 with 22 rules applied. Total rules applied 413 place count 208 transition count 5026
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 414 place count 207 transition count 5019
Iterating global reduction 8 with 1 rules applied. Total rules applied 415 place count 207 transition count 5019
Applied a total of 415 rules in 469 ms. Remains 207 /322 variables (removed 115) and now considering 5019/5315 (removed 296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 469 ms. Remains : 207/322 places, 5019/5315 transitions.
RANDOM walk for 40000 steps (665 resets) in 1733 ms. (23 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (27 resets) in 312 ms. (127 steps per ms) remains 1/1 properties
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :1.72153e+06 after 1.77377e+06
Interrupted probabilistic random walk after 211925 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 1
Probabilistic random walk after 211925 steps, saw 41069 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2025-05-29 23:40:34] [INFO ] Flow matrix only has 4711 transitions (discarded 308 similar events)
// Phase 1: matrix 4711 rows 207 cols
[2025-05-29 23:40:34] [INFO ] Computed 25 invariants in 40 ms
[2025-05-29 23:40:34] [INFO ] State equation strengthened by 227 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
SDD proceeding with computation,13 properties remain. new max is 32768
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :1.77377e+06 after 1.79729e+06
At refinement iteration 2 (OVERLAPS) 158/206 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4711/4917 variables, 206/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4917 variables, 227/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4917 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/4918 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4918 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/4918 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4918/4918 variables, and 459 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1985 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 227/227 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 158/206 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4711/4917 variables, 206/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4917 variables, 227/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4917 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/4918 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4918 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/4918 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4918/4918 variables, and 459 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2080 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 227/227 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4174ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 121 ms.
Support contains 48 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 5019/5019 transitions.
Applied a total of 0 rules in 47 ms. Remains 207 /207 variables (removed 0) and now considering 5019/5019 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 207/207 places, 5019/5019 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 5019/5019 transitions.
Applied a total of 0 rules in 48 ms. Remains 207 /207 variables (removed 0) and now considering 5019/5019 (removed 0) transitions.
[2025-05-29 23:40:38] [INFO ] Flow matrix only has 4711 transitions (discarded 308 similar events)
[2025-05-29 23:40:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:40:38] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-05-29 23:40:38] [INFO ] Flow matrix only has 4711 transitions (discarded 308 similar events)
[2025-05-29 23:40:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:40:39] [INFO ] State equation strengthened by 227 read => feed constraints.
[2025-05-29 23:40:40] [INFO ] Implicit Places using invariants and state equation in 1502 ms returned []
Implicit Place search using SMT with State Equation took 1627 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:40:41] [INFO ] Redundant transitions in 1102 ms returned []
Running 5018 sub problems to find dead transitions.
[2025-05-29 23:40:41] [INFO ] Flow matrix only has 4711 transitions (discarded 308 similar events)
[2025-05-29 23:40:41] [INFO ] Invariant cache hit.
[2025-05-29 23:40:41] [INFO ] State equation strengthened by 227 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,13 properties remain. new max is 65536
SDD size :1.79729e+06 after 2.09768e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 5018 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/4918 variables, and 25 constraints, problems are : Problem set: 0 solved, 5018 unsolved in 30100 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/207 constraints, ReadFeed: 0/227 constraints, PredecessorRefiner: 5018/459 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5018 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 5018 unsolved
SDD proceeding with computation,13 properties remain. new max is 131072
SDD size :2.09768e+07 after 2.436e+07
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 206/4918 variables, and 25 constraints, problems are : Problem set: 0 solved, 5018 unsolved in 30064 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/207 constraints, ReadFeed: 0/227 constraints, PredecessorRefiner: 4559/459 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 71406ms problems are : Problem set: 0 solved, 5018 unsolved
Search for dead transitions found 0 dead transitions in 71450ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74282 ms. Remains : 207/207 places, 5019/5019 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 136 edges and 207 vertex of which 13 / 207 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 308 transitions
Reduce isomorphic transitions removed 324 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 197 transition count 4687
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 14 rules applied. Total rules applied 23 place count 189 transition count 4681
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 186 transition count 4680
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 185 transition count 4679
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 29 place count 185 transition count 4672
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 43 place count 178 transition count 4672
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 45 place count 176 transition count 4670
Iterating global reduction 4 with 2 rules applied. Total rules applied 47 place count 176 transition count 4670
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 63 place count 168 transition count 4662
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 65 place count 168 transition count 4660
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 67 place count 166 transition count 4658
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 166 transition count 4658
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 71 place count 164 transition count 4656
Iterating global reduction 5 with 2 rules applied. Total rules applied 73 place count 164 transition count 4656
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 74 place count 163 transition count 4655
Iterating global reduction 5 with 1 rules applied. Total rules applied 75 place count 163 transition count 4655
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 76 place count 162 transition count 4654
Iterating global reduction 5 with 1 rules applied. Total rules applied 77 place count 162 transition count 4654
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 78 place count 161 transition count 4644
Iterating global reduction 5 with 1 rules applied. Total rules applied 79 place count 161 transition count 4644
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 113 place count 161 transition count 4610
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 6 with 38 rules applied. Total rules applied 151 place count 161 transition count 4572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 151 place count 161 transition count 4571
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 153 place count 160 transition count 4571
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 155 place count 158 transition count 4559
Iterating global reduction 6 with 2 rules applied. Total rules applied 157 place count 158 transition count 4559
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 161 place count 156 transition count 4557
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 165 place count 156 transition count 4553
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 169 place count 152 transition count 4553
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 152 transition count 4557
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 171 place count 151 transition count 4557
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 183 place count 151 transition count 4557
Applied a total of 183 rules in 505 ms. Remains 151 /207 variables (removed 56) and now considering 4557/5019 (removed 462) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4557 rows 151 cols
[2025-05-29 23:41:53] [INFO ] Computed 25 invariants in 33 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 23:41:53] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 23:41:53] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 4 ms returned sat
[2025-05-29 23:41:54] [INFO ] After 1222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 23:41:55] [INFO ] After 1500ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 23:41:55] [INFO ] After 1737ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2350 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-29 23:41:56] [INFO ] Flatten gal took : 830 ms
[2025-05-29 23:41:56] [INFO ] Applying decomposition
[2025-05-29 23:41:57] [INFO ] Flatten gal took : 772 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/graph15574106023506278532.txt' '-o' '/tmp/graph15574106023506278532.bin' '-w' '/tmp/graph15574106023506278532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15574106023506278532.bin' '-l' '-1' '-v' '-w' '/tmp/graph15574106023506278532.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:41:58] [INFO ] Decomposing Gal with order
[2025-05-29 23:41:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:42:13] [INFO ] Removed a total of 26787 redundant transitions.
[2025-05-29 23:42:13] [INFO ] Flatten gal took : 14461 ms
[2025-05-29 23:42:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 8284 labels/synchronizations in 775 ms.
[2025-05-29 23:42:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9140191474536085322.gal : 96 ms
[2025-05-29 23:42:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11101770071766536205.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9140191474536085322.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11101770071766536205.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality11101770071766536205.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3 after 21
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :21 after 8.75194e+17
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8.75194e+17 after 4.30138e+19
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.30138e+19 after 5.78395e+19
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.78395e+19 after 1.30033e+20
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.30033e+20 after 1.72995e+21
Detected timeout of ITS tools.
[2025-05-30 00:12:23] [INFO ] Flatten gal took : 5840 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17907042862769033973
[2025-05-30 00:12:23] [INFO ] Too many transitions (5019) to apply POR reductions. Disabling POR matrices.
[2025-05-30 00:12:25] [INFO ] Built C files in 2003ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17907042862769033973
Running compilation step : cd /tmp/ltsmin17907042862769033973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 00:12:25] [INFO ] Applying decomposition
[2025-05-30 00:12:27] [INFO ] Flatten gal took : 1770 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/graph3746493411511816454.txt' '-o' '/tmp/graph3746493411511816454.bin' '-w' '/tmp/graph3746493411511816454.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3746493411511816454.bin' '-l' '-1' '-v' '-w' '/tmp/graph3746493411511816454.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:12:33] [INFO ] Decomposing Gal with order
[2025-05-30 00:12:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:12:36] [INFO ] Removed a total of 36331 redundant transitions.
[2025-05-30 00:12:37] [INFO ] Flatten gal took : 3604 ms
[2025-05-30 00:12:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 208 labels/synchronizations in 293 ms.
[2025-05-30 00:12:38] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5431388200310839118.gal : 103 ms
[2025-05-30 00:12:38] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12262460070513222819.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability5431388200310839118.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12262460070513222819.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability12262460070513222819.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 145
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :145 after 15697
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :15697 after 7.91914e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7.91914e+06 after 1.53114e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.53114e+08 after 6.12021e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.12021e+08 after 3.31897e+11
Reachability property CloudDeployment-PT-6b-ReachabilityFireability-2024-14 is true.
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.64823e+15,17.3915,146120,336,668,8602,17329,21435,15428,4525,41246,0
Total reachable state count : 4648230882754561

Verifying 1 reachability properties.
Reachability property CloudDeployment-PT-6b-ReachabilityFireability-2024-14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CloudDeployment-PT-6b-ReachabilityFireability-2024-14,13440,17.9946,146120,56,146,8602,17329,22053,15428,4693,41246,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1993735 ms.

BK_STOP 1748563976395

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-6b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-6b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854027700079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-6b.tgz
mv CloudDeployment-PT-6b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;