Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r070-tall-171620506300627.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is CloudDeployment-PT-7b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620506300627
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 20M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716334093274

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-7b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 23:28:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:28:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:28:15] [INFO ] Load time of PNML (sax parser for PT used): 935 ms
[2024-05-21 23:28:15] [INFO ] Transformed 2271 places.
[2024-05-21 23:28:15] [INFO ] Transformed 19752 transitions.
[2024-05-21 23:28:15] [INFO ] Found NUPN structural information;
[2024-05-21 23:28:15] [INFO ] Parsed PT model containing 2271 places and 19752 transitions and 389666 arcs in 1194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-7b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-7b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 2271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2271/2271 places, 19752/19752 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 2263 transition count 19752
Discarding 649 places :
Symmetric choice reduction at 1 with 649 rule applications. Total rules 657 place count 1614 transition count 2734
Iterating global reduction 1 with 649 rules applied. Total rules applied 1306 place count 1614 transition count 2734
Discarding 253 places :
Symmetric choice reduction at 1 with 253 rule applications. Total rules 1559 place count 1361 transition count 2481
Iterating global reduction 1 with 253 rules applied. Total rules applied 1812 place count 1361 transition count 2481
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 1848 place count 1361 transition count 2445
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 1873 place count 1336 transition count 2420
Iterating global reduction 2 with 25 rules applied. Total rules applied 1898 place count 1336 transition count 2420
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1901 place count 1333 transition count 2417
Iterating global reduction 2 with 3 rules applied. Total rules applied 1904 place count 1333 transition count 2417
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1906 place count 1331 transition count 2415
Iterating global reduction 2 with 2 rules applied. Total rules applied 1908 place count 1331 transition count 2415
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1909 place count 1330 transition count 2414
Iterating global reduction 2 with 1 rules applied. Total rules applied 1910 place count 1330 transition count 2414
Applied a total of 1910 rules in 3713 ms. Remains 1330 /2271 variables (removed 941) and now considering 2414/19752 (removed 17338) transitions.
// Phase 1: matrix 2414 rows 1330 cols
[2024-05-21 23:28:19] [INFO ] Computed 21 invariants in 40 ms
[2024-05-21 23:28:20] [INFO ] Implicit Places using invariants in 526 ms returned []
[2024-05-21 23:28:20] [INFO ] Invariant cache hit.
[2024-05-21 23:28:22] [INFO ] Implicit Places using invariants and state equation in 2116 ms returned [13, 23, 190, 202, 368, 376, 547, 556, 722, 732, 899, 907, 1073, 1083]
[2024-05-21 23:28:22] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2703 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1329/2271 places, 2414/19752 transitions.
Applied a total of 0 rules in 45 ms. Remains 1329 /1329 variables (removed 0) and now considering 2414/2414 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6487 ms. Remains : 1329/2271 places, 2414/19752 transitions.
Support contains 42 out of 1329 places after structural reductions.
[2024-05-21 23:28:22] [INFO ] Flatten gal took : 229 ms
[2024-05-21 23:28:23] [INFO ] Flatten gal took : 133 ms
[2024-05-21 23:28:23] [INFO ] Input system was already deterministic with 2414 transitions.
Support contains 40 out of 1329 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (174 resets) in 1970 ms. (20 steps per ms) remains 10/21 properties
BEST_FIRST walk for 40004 steps (19 resets) in 236 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (17 resets) in 112 ms. (354 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 94 ms. (421 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (13 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (15 resets) in 90 ms. (439 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (17 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (19 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 96 ms. (412 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (17 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
// Phase 1: matrix 2414 rows 1329 cols
[2024-05-21 23:28:24] [INFO ] Computed 20 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 116/128 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 176/304 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1261/1565 variables, 304/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1565 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 685/2250 variables, 290/614 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2250 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 614/2864 variables, 272/886 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2864 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 580/3444 variables, 265/1151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3444 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 228/3672 variables, 155/1306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3672 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 49/3721 variables, 28/1334 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3721 variables, 0/1334 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 22/3743 variables, 15/1349 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3743 variables, 0/1349 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/3743 variables, 0/1349 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3743/3743 variables, and 1349 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2625 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 1329/1329 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 116/128 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 176/304 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1261/1565 variables, 304/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1565 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 685/2250 variables, 290/614 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2250 variables, 6/620 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2250 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 614/2864 variables, 272/892 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2864 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 580/3444 variables, 265/1157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3444 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 228/3672 variables, 155/1312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3672 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 49/3721 variables, 28/1340 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3721 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 22/3743 variables, 15/1355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3743 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/3743 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3743/3743 variables, and 1355 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3805 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 1329/1329 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 6504ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 1027 steps, including 2 resets, run visited all 1 properties in 4 ms. (steps per millisecond=256 )
Parikh walk visited 6 properties in 298 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 197 stabilizing places and 869 stable transitions
Graph (complete) has 4677 edges and 1329 vertex of which 1307 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.34 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(X(p1)&&(p2 U (p3||G(p2))))))'
Support contains 6 out of 1329 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1329/1329 places, 2414/2414 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1313 transition count 2398
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1313 transition count 2398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1313 transition count 2397
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 1307 transition count 2391
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 1307 transition count 2391
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 1307 transition count 2386
Applied a total of 50 rules in 100 ms. Remains 1307 /1329 variables (removed 22) and now considering 2386/2414 (removed 28) transitions.
// Phase 1: matrix 2386 rows 1307 cols
[2024-05-21 23:28:31] [INFO ] Computed 20 invariants in 16 ms
[2024-05-21 23:28:31] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-21 23:28:31] [INFO ] Invariant cache hit.
[2024-05-21 23:28:33] [INFO ] Implicit Places using invariants and state equation in 1702 ms returned [20, 187, 195, 360, 368, 534, 542, 707, 715, 881, 889, 1055, 1063]
[2024-05-21 23:28:33] [INFO ] Actually due to overlaps returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2013 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1306/1329 places, 2386/2414 transitions.
Applied a total of 0 rules in 31 ms. Remains 1306 /1306 variables (removed 0) and now considering 2386/2386 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2146 ms. Remains : 1306/1329 places, 2386/2414 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-00
Stuttering criterion allowed to conclude after 540 steps with 2 reset in 8 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-00 finished in 2517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1329 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1329/1329 places, 2414/2414 transitions.
Graph (trivial) has 1379 edges and 1329 vertex of which 498 / 1329 are part of one of the 56 SCC in 7 ms
Free SCC test removed 442 places
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Graph (complete) has 4087 edges and 887 vertex of which 865 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.11 ms
Discarding 22 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 354 place count 864 transition count 1554
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 706 place count 512 transition count 1554
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 706 place count 512 transition count 1488
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 838 place count 446 transition count 1488
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 849 place count 435 transition count 1477
Iterating global reduction 2 with 11 rules applied. Total rules applied 860 place count 435 transition count 1477
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 861 place count 435 transition count 1476
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 861 place count 435 transition count 1471
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 871 place count 430 transition count 1471
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 872 place count 429 transition count 1470
Iterating global reduction 3 with 1 rules applied. Total rules applied 873 place count 429 transition count 1470
Performed 137 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 137 places in 1 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 1147 place count 292 transition count 1329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1148 place count 292 transition count 1328
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1204 place count 264 transition count 1398
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1211 place count 264 transition count 1391
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1225 place count 257 transition count 1475
Drop transitions (Redundant composition of simpler transitions.) removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 5 with 57 rules applied. Total rules applied 1282 place count 257 transition count 1418
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1283 place count 256 transition count 1417
Applied a total of 1283 rules in 355 ms. Remains 256 /1329 variables (removed 1073) and now considering 1417/2414 (removed 997) transitions.
[2024-05-21 23:28:34] [INFO ] Flow matrix only has 1117 transitions (discarded 300 similar events)
// Phase 1: matrix 1117 rows 256 cols
[2024-05-21 23:28:34] [INFO ] Computed 7 invariants in 8 ms
[2024-05-21 23:28:34] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-21 23:28:34] [INFO ] Flow matrix only has 1117 transitions (discarded 300 similar events)
[2024-05-21 23:28:34] [INFO ] Invariant cache hit.
[2024-05-21 23:28:34] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-21 23:28:35] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-05-21 23:28:36] [INFO ] Redundant transitions in 1197 ms returned []
Running 1360 sub problems to find dead transitions.
[2024-05-21 23:28:36] [INFO ] Flow matrix only has 1117 transitions (discarded 300 similar events)
[2024-05-21 23:28:36] [INFO ] Invariant cache hit.
[2024-05-21 23:28:36] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 2 (OVERLAPS) 1116/1365 variables, 249/256 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1365 variables, 56/312 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1365/1373 variables, and 312 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 249/256 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1360/1360 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 2 (OVERLAPS) 1116/1365 variables, 249/256 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1365 variables, 56/312 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1365 variables, 18/330 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1365/1373 variables, and 330 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 249/256 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 18/1360 constraints, Known Traps: 0/0 constraints]
After SMT, in 67861ms problems are : Problem set: 0 solved, 1360 unsolved
Search for dead transitions found 0 dead transitions in 67881ms
Starting structural reductions in SI_LTL mode, iteration 1 : 256/1329 places, 1417/2414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70106 ms. Remains : 256/1329 places, 1417/2414 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-02 finished in 70154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&(p1 U G((p2 U X(X(X(p3))))))) U X(G(p4))))'
Support contains 10 out of 1329 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1329/1329 places, 2414/2414 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1314 transition count 2399
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1314 transition count 2399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1314 transition count 2398
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1312 transition count 2396
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1312 transition count 2396
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 1312 transition count 2394
Applied a total of 37 rules in 128 ms. Remains 1312 /1329 variables (removed 17) and now considering 2394/2414 (removed 20) transitions.
// Phase 1: matrix 2394 rows 1312 cols
[2024-05-21 23:29:44] [INFO ] Computed 20 invariants in 11 ms
[2024-05-21 23:29:44] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-21 23:29:44] [INFO ] Invariant cache hit.
[2024-05-21 23:29:46] [INFO ] Implicit Places using invariants and state equation in 1679 ms returned [20, 186, 198, 364, 372, 537, 545, 710, 718, 883, 891, 1056, 1066]
[2024-05-21 23:29:46] [INFO ] Actually due to overlaps returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2080 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1311/1329 places, 2394/2414 transitions.
Applied a total of 0 rules in 36 ms. Remains 1311 /1311 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2245 ms. Remains : 1311/1329 places, 2394/2414 transitions.
Stuttering acceptance computed with spot in 2075 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-03
Product exploration explored 100000 steps with 22266 reset in 563 ms.
Product exploration explored 100000 steps with 22130 reset in 562 ms.
Computed a total of 193 stabilizing places and 865 stable transitions
Graph (complete) has 4619 edges and 1311 vertex of which 1290 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.9 ms
Computed a total of 193 stabilizing places and 865 stable transitions
Knowledge obtained : [(AND p4 p2 p0 p1 p3), (X p2), (X (AND p0 p2 p1)), (X p4), (X (NOT (AND (NOT p2) (NOT p4)))), (X (NOT (AND (NOT p2) p4))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4)))), (X (AND p1 p4)), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p4))), (X (NOT (AND p2 (NOT p4)))), (X (NOT (AND p0 (NOT p4)))), (X (AND p0 p4)), (X (NOT (AND (NOT p1) p4))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p1 p4))), (X (NOT (AND p2 (NOT p1) p4))), (X (NOT (AND p2 p1 (NOT p4)))), (X (AND p2 p4)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p4)))), (X (AND p2 p1 p4)), (X (NOT (AND (NOT p2) p1 (NOT p4)))), (X (NOT (AND p1 (NOT p4)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p2) p1))), (X (X p2)), (X (X (AND p0 p2 p1))), (X (X p4)), (X (X (NOT (AND (NOT p2) (NOT p4))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p4)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p1 p4))), (X (X (AND p0 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p4)))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (NOT (AND p0 (NOT p4))))), (X (X (AND p0 p4))), (X (X (NOT (AND (NOT p1) p4)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 p4)))), (X (X (NOT (AND p2 (NOT p1) p4)))), (X (X (NOT (AND p2 p1 (NOT p4))))), (X (X (AND p2 p4))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (AND p2 p1 p4))), (X (X (NOT (AND (NOT p2) p1 (NOT p4))))), (X (X (NOT (AND p1 (NOT p4))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 61 factoid took 3322 ms. Reduced automaton from 44 states, 173 edges and 5 AP (stutter sensitive) to 44 states, 173 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1802 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
RANDOM walk for 40000 steps (176 resets) in 882 ms. (45 steps per ms) remains 21/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
// Phase 1: matrix 2394 rows 1311 cols
[2024-05-21 23:29:55] [INFO ] Computed 19 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 117/127 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 146/273 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 1217/1490 variables, 273/292 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1490 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 695/2185 variables, 287/579 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2185 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 627/2812 variables, 283/862 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2812 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 577/3389 variables, 260/1122 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3389 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 245/3634 variables, 164/1286 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3634 variables, 0/1286 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 50/3684 variables, 30/1316 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3684 variables, 0/1316 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (OVERLAPS) 21/3705 variables, 14/1330 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3705/3705 variables, and 1330 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 1311/1311 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 117/127 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 146/273 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 1217/1490 variables, 273/292 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1490 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 695/2185 variables, 287/579 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2185 variables, 21/600 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2185 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 627/2812 variables, 283/883 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2812 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 577/3389 variables, 260/1143 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3389 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 245/3634 variables, 164/1307 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3634 variables, 0/1307 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 50/3684 variables, 30/1337 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3684/3705 variables, and 1337 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5007 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 1297/1311 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 10050ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 1311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1311/1311 places, 2394/2394 transitions.
Graph (trivial) has 1345 edges and 1311 vertex of which 485 / 1311 are part of one of the 55 SCC in 3 ms
Free SCC test removed 430 places
Drop transitions (Empty/Sink Transition effects.) removed 550 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 551 transitions.
Graph (complete) has 3866 edges and 881 vertex of which 860 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.4 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 376 rules applied. Total rules applied 378 place count 860 transition count 1467
Reduce places removed 350 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 353 rules applied. Total rules applied 731 place count 510 transition count 1464
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 734 place count 507 transition count 1464
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 734 place count 507 transition count 1388
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 886 place count 431 transition count 1388
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 893 place count 424 transition count 1381
Iterating global reduction 3 with 7 rules applied. Total rules applied 900 place count 424 transition count 1381
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 900 place count 424 transition count 1374
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 914 place count 417 transition count 1374
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 1148 place count 300 transition count 1257
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -314
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1232 place count 258 transition count 1571
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 3 with 55 rules applied. Total rules applied 1287 place count 258 transition count 1516
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1301 place count 251 transition count 1600
Drop transitions (Redundant composition of simpler transitions.) removed 272 transitions
Redundant transition composition rules discarded 272 transitions
Iterating global reduction 4 with 272 rules applied. Total rules applied 1573 place count 251 transition count 1328
Free-agglomeration rule applied 69 times with reduction of 35 identical transitions.
Iterating global reduction 4 with 69 rules applied. Total rules applied 1642 place count 251 transition count 1224
Reduce places removed 69 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 179 transitions
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 263 transitions.
Graph (complete) has 1639 edges and 182 vertex of which 181 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 333 rules applied. Total rules applied 1975 place count 181 transition count 961
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1976 place count 181 transition count 960
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1981 place count 176 transition count 920
Iterating global reduction 6 with 5 rules applied. Total rules applied 1986 place count 176 transition count 920
Drop transitions (Redundant composition of simpler transitions.) removed 147 transitions
Redundant transition composition rules discarded 147 transitions
Iterating global reduction 6 with 147 rules applied. Total rules applied 2133 place count 176 transition count 773
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2134 place count 175 transition count 772
Applied a total of 2134 rules in 315 ms. Remains 175 /1311 variables (removed 1136) and now considering 772/2394 (removed 1622) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 315 ms. Remains : 175/1311 places, 772/2394 transitions.
RANDOM walk for 40000 steps (8 resets) in 1223 ms. (32 steps per ms) remains 2/21 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
[2024-05-21 23:30:06] [INFO ] Flow matrix only has 366 transitions (discarded 406 similar events)
// Phase 1: matrix 366 rows 175 cols
[2024-05-21 23:30:06] [INFO ] Computed 27 invariants in 1 ms
[2024-05-21 23:30:06] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 55/110 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/122 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 290/412 variables, 122/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 61/473 variables, 17/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 36/509 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/509 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 32/541 variables, 36/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/541 variables, 7/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/541 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/541 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 175/175 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 55/110 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/122 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 290/412 variables, 122/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 61/473 variables, 17/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/473 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 36/509 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/509 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 32/541 variables, 36/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/541 variables, 7/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/541 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/541 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 175/175 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 458ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 22 ms.
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 772/772 transitions.
Graph (trivial) has 63 edges and 175 vertex of which 2 / 175 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 0 with 3 rules applied. Total rules applied 4 place count 174 transition count 767
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 171 transition count 767
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 169 transition count 765
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 15 place count 169 transition count 761
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 168 transition count 768
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 168 transition count 767
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 26 place count 168 transition count 759
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 28 place count 168 transition count 757
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 50 place count 166 transition count 737
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 51 place count 165 transition count 729
Iterating global reduction 5 with 1 rules applied. Total rules applied 52 place count 165 transition count 729
Applied a total of 52 rules in 51 ms. Remains 165 /175 variables (removed 10) and now considering 729/772 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 165/175 places, 729/772 transitions.
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 901688 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :0 out of 1
Probabilistic random walk after 901688 steps, saw 116258 distinct states, run finished after 3004 ms. (steps per millisecond=300 ) properties seen :0
[2024-05-21 23:30:09] [INFO ] Flow matrix only has 336 transitions (discarded 393 similar events)
// Phase 1: matrix 336 rows 165 cols
[2024-05-21 23:30:09] [INFO ] Computed 27 invariants in 1 ms
[2024-05-21 23:30:09] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/87 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/99 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 242/341 variables, 99/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 75/416 variables, 21/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 45/461 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/461 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 40/501 variables, 45/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 7/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/501 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 200 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 165/165 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/87 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/99 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 242/341 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 75/416 variables, 21/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 45/461 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 40/501 variables, 45/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/501 variables, 7/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/501 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/501 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 165/165 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 436ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 165 /165 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 165/165 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 165 /165 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-21 23:30:10] [INFO ] Flow matrix only has 336 transitions (discarded 393 similar events)
[2024-05-21 23:30:10] [INFO ] Invariant cache hit.
[2024-05-21 23:30:10] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-21 23:30:10] [INFO ] Flow matrix only has 336 transitions (discarded 393 similar events)
[2024-05-21 23:30:10] [INFO ] Invariant cache hit.
[2024-05-21 23:30:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:30:10] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-21 23:30:10] [INFO ] Redundant transitions in 20 ms returned []
Running 678 sub problems to find dead transitions.
[2024-05-21 23:30:10] [INFO ] Flow matrix only has 336 transitions (discarded 393 similar events)
[2024-05-21 23:30:10] [INFO ] Invariant cache hit.
[2024-05-21 23:30:10] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (OVERLAPS) 7/165 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 4 (OVERLAPS) 336/501 variables, 165/192 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 7 (OVERLAPS) 0/501 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 678 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 200 constraints, problems are : Problem set: 0 solved, 678 unsolved in 24159 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 165/165 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 678 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (OVERLAPS) 7/165 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 4 (OVERLAPS) 336/501 variables, 165/192 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 678/878 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 878 constraints, problems are : Problem set: 0 solved, 678 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 165/165 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 0/0 constraints]
After SMT, in 55633ms problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 55639ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56107 ms. Remains : 165/165 places, 729/729 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 162 edges and 165 vertex of which 49 / 165 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Ensure Unique test removed 393 transitions
Reduce isomorphic transitions removed 459 transitions.
Graph (complete) has 406 edges and 123 vertex of which 110 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 110 transition count 244
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 28 rules applied. Total rules applied 56 place count 84 transition count 242
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 59 place count 83 transition count 240
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 81 transition count 239
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 62 place count 81 transition count 226
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 88 place count 68 transition count 226
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 93 place count 63 transition count 221
Iterating global reduction 4 with 5 rules applied. Total rules applied 98 place count 63 transition count 221
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 103 place count 58 transition count 186
Iterating global reduction 4 with 5 rules applied. Total rules applied 108 place count 58 transition count 186
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 4 with 45 rules applied. Total rules applied 153 place count 58 transition count 141
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 171 place count 49 transition count 132
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 185 place count 49 transition count 118
Performed 8 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 201 place count 41 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 6 with 69 rules applied. Total rules applied 270 place count 41 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 285 place count 31 transition count 95
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 6 with 36 rules applied. Total rules applied 321 place count 31 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 323 place count 30 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 342 place count 30 transition count 48
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 352 place count 30 transition count 48
Applied a total of 352 rules in 12 ms. Remains 30 /165 variables (removed 135) and now considering 48/729 (removed 681) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 48 rows 30 cols
[2024-05-21 23:31:06] [INFO ] Computed 10 invariants in 1 ms
[2024-05-21 23:31:06] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:31:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-05-21 23:31:06] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 23:31:06] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:31:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
TRAPS : Iteration 1
[2024-05-21 23:31:06] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:31:06] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 118 ms.
Knowledge obtained : [(AND p4 p2 p0 p1 p3), (X p2), (X (AND p0 p2 p1)), (X p4), (X (NOT (AND (NOT p2) (NOT p4)))), (X (NOT (AND (NOT p2) p4))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4)))), (X (AND p1 p4)), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p4))), (X (NOT (AND p2 (NOT p4)))), (X (NOT (AND p0 (NOT p4)))), (X (AND p0 p4)), (X (NOT (AND (NOT p1) p4))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p1 p4))), (X (NOT (AND p2 (NOT p1) p4))), (X (NOT (AND p2 p1 (NOT p4)))), (X (AND p2 p4)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p4)))), (X (AND p2 p1 p4)), (X (NOT (AND (NOT p2) p1 (NOT p4)))), (X (NOT (AND p1 (NOT p4)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p2) p1))), (X (X p2)), (X (X (AND p0 p2 p1))), (X (X p4)), (X (X (NOT (AND (NOT p2) (NOT p4))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p4)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p1 p4))), (X (X (AND p0 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p4)))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (NOT (AND p0 (NOT p4))))), (X (X (AND p0 p4))), (X (X (NOT (AND (NOT p1) p4)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 p4)))), (X (X (NOT (AND p2 (NOT p1) p4)))), (X (X (NOT (AND p2 p1 (NOT p4))))), (X (X (AND p2 p4))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (AND p2 p1 p4))), (X (X (NOT (AND (NOT p2) p1 (NOT p4))))), (X (X (NOT (AND p1 (NOT p4))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT (OR (NOT p2) p1 p3))), (F (NOT (AND p4 p1))), (F (NOT (OR (NOT p4) p1))), (F (NOT (OR p2 (NOT p4)))), (F (NOT (OR p4 p1))), (F (NOT (OR (NOT p2) (NOT p1) p3))), (F (NOT (OR (NOT p2) p4))), (F (NOT p2)), (F (NOT (OR (NOT p2) p3))), (F (NOT (AND p2 p1 p0))), (F (NOT (OR p2 p4))), (F (NOT (OR p4 (NOT p1)))), (F (NOT p4)), (F (NOT (OR p2 p1 (NOT p0)))), (F (NOT (OR p2 (NOT p4) (NOT p1)))), (F (NOT (OR p2 p4 (NOT p1)))), (F (NOT p1)), (F (NOT (OR p2 (NOT p4) p1))), (F (NOT (AND p1 p0))), (F (NOT p3)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1 (NOT p0)))), (F (NOT (OR p1 p3))), (F (NOT p0)), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND p2 p4))), (F (NOT (OR p2 (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p2) p4 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p4) p1))), (F (NOT (OR p2 p3))), (F (NOT (OR p2 p4 p1))), (F (NOT (OR p4 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND p4 p0))), (F (NOT (OR (NOT p4) p3))), (F (NOT (OR p2 p1))), (F (NOT (AND p2 p4 p1))), (F (NOT (OR p2 (NOT p1) p3))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p2) p4 p1))), (F (NOT (OR p2 p1 p3)))]
Knowledge based reduction with 61 factoid took 6133 ms. Reduced automaton from 44 states, 173 edges and 5 AP (stutter sensitive) to 44 states, 173 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1835 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 1930 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 10 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2394/2394 transitions.
Applied a total of 0 rules in 32 ms. Remains 1311 /1311 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
// Phase 1: matrix 2394 rows 1311 cols
[2024-05-21 23:31:16] [INFO ] Computed 19 invariants in 16 ms
[2024-05-21 23:31:16] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-21 23:31:16] [INFO ] Invariant cache hit.
[2024-05-21 23:31:18] [INFO ] Implicit Places using invariants and state equation in 1522 ms returned [185, 197, 363, 371, 536, 544, 709, 717, 882, 890, 1055, 1065]
[2024-05-21 23:31:18] [INFO ] Actually due to overlaps returned [185]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1789 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1310/1311 places, 2394/2394 transitions.
Applied a total of 0 rules in 51 ms. Remains 1310 /1310 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1874 ms. Remains : 1310/1311 places, 2394/2394 transitions.
Computed a total of 193 stabilizing places and 865 stable transitions
Graph (complete) has 4596 edges and 1310 vertex of which 1290 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.9 ms
Computed a total of 193 stabilizing places and 865 stable transitions
Knowledge obtained : [(AND p4 p2 p0 p1 p3), (X p2), (X p4), (X (NOT (AND (NOT p2) (NOT p4)))), (X (NOT (AND p4 (NOT p1)))), (X (NOT (AND (NOT p2) p4))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 p4 (NOT p1)))), (X (NOT (AND p2 (NOT p4) p1))), (X p0), (X (AND p4 p0)), (X (NOT (AND (NOT p4) p0))), (X (NOT (AND (NOT p2) (NOT p4) (NOT p1)))), (X (NOT (AND (NOT p2) p4 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p4) p1))), (X (NOT (AND (NOT p2) p4 p1))), (X (NOT (AND p2 (NOT p4)))), (X (NOT (AND (NOT p4) (NOT p1)))), (X (AND p4 p1)), (X (NOT (AND (NOT p4) p1))), (X (AND p2 p1 p0)), (X (NOT (AND p2 (NOT p4) (NOT p1)))), (X (AND p2 p4 p1)), (X (NOT (AND (NOT p2) p1 p0))), (X (AND p2 p4)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p1 p0)), (X p1), (X (X p2)), (X (X p4)), (X (X (NOT (AND (NOT p2) (NOT p4))))), (X (X (NOT (AND p4 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p4)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 p4 (NOT p1))))), (X (X (NOT (AND p2 (NOT p4) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p4 p0))), (X (X (NOT (AND (NOT p4) p0)))), (X (X (NOT (AND (NOT p2) (NOT p4) (NOT p1))))), (X (X (NOT (AND (NOT p2) p4 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p4) p1)))), (X (X (NOT (AND (NOT p2) p4 p1)))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (NOT (AND (NOT p4) (NOT p1))))), (X (X (AND p4 p1))), (X (X (NOT (AND (NOT p4) p1)))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 (NOT p4) (NOT p1))))), (X (X (AND p2 p4 p1))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND p2 p4))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 61 factoid took 3281 ms. Reduced automaton from 44 states, 173 edges and 5 AP (stutter sensitive) to 44 states, 173 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1863 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
RANDOM walk for 40000 steps (178 resets) in 403 ms. (99 steps per ms) remains 26/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
// Phase 1: matrix 2394 rows 1310 cols
[2024-05-21 23:31:23] [INFO ] Computed 18 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 99/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 154/263 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 1204/1467 variables, 263/281 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1467 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 710/2177 variables, 292/573 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2177 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 632/2809 variables, 286/859 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2809 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 579/3388 variables, 261/1120 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3388 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 245/3633 variables, 164/1284 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3633 variables, 0/1284 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (OVERLAPS) 50/3683 variables, 30/1314 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3683/3704 variables, and 1314 constraints, problems are : Problem set: 0 solved, 26 unsolved in 5009 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 1296/1310 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 99/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 154/263 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 1204/1467 variables, 263/281 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1467 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 710/2177 variables, 292/573 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2177 variables, 26/599 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2177 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 632/2809 variables, 286/885 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2809 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 579/3388 variables, 261/1146 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3388 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 245/3633 variables, 164/1310 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3633/3704 variables, and 1310 constraints, problems are : Problem set: 0 solved, 26 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 1266/1310 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 10057ms problems are : Problem set: 0 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 1310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1310/1310 places, 2394/2394 transitions.
Graph (trivial) has 1344 edges and 1310 vertex of which 485 / 1310 are part of one of the 55 SCC in 4 ms
Free SCC test removed 430 places
Drop transitions (Empty/Sink Transition effects.) removed 551 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 552 transitions.
Graph (complete) has 3843 edges and 880 vertex of which 860 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 375 rules applied. Total rules applied 377 place count 860 transition count 1467
Reduce places removed 350 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 353 rules applied. Total rules applied 730 place count 510 transition count 1464
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 733 place count 507 transition count 1464
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 733 place count 507 transition count 1388
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 885 place count 431 transition count 1388
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 892 place count 424 transition count 1381
Iterating global reduction 3 with 7 rules applied. Total rules applied 899 place count 424 transition count 1381
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 899 place count 424 transition count 1374
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 913 place count 417 transition count 1374
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 1147 place count 300 transition count 1257
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -314
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1231 place count 258 transition count 1571
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 3 with 55 rules applied. Total rules applied 1286 place count 258 transition count 1516
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
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 1300 place count 251 transition count 1600
Drop transitions (Redundant composition of simpler transitions.) removed 272 transitions
Redundant transition composition rules discarded 272 transitions
Iterating global reduction 4 with 272 rules applied. Total rules applied 1572 place count 251 transition count 1328
Free-agglomeration rule applied 69 times with reduction of 35 identical transitions.
Iterating global reduction 4 with 69 rules applied. Total rules applied 1641 place count 251 transition count 1224
Reduce places removed 69 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 179 transitions
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 263 transitions.
Graph (complete) has 1639 edges and 182 vertex of which 181 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 333 rules applied. Total rules applied 1974 place count 181 transition count 961
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1975 place count 181 transition count 960
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1980 place count 176 transition count 920
Iterating global reduction 6 with 5 rules applied. Total rules applied 1985 place count 176 transition count 920
Drop transitions (Redundant composition of simpler transitions.) removed 147 transitions
Redundant transition composition rules discarded 147 transitions
Iterating global reduction 6 with 147 rules applied. Total rules applied 2132 place count 176 transition count 773
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2133 place count 175 transition count 772
Applied a total of 2133 rules in 192 ms. Remains 175 /1310 variables (removed 1135) and now considering 772/2394 (removed 1622) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 175/1310 places, 772/2394 transitions.
RANDOM walk for 40000 steps (8 resets) in 402 ms. (99 steps per ms) remains 3/26 properties
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/2 properties
[2024-05-21 23:31:34] [INFO ] Flow matrix only has 366 transitions (discarded 406 similar events)
// Phase 1: matrix 366 rows 175 cols
[2024-05-21 23:31:34] [INFO ] Computed 27 invariants in 2 ms
[2024-05-21 23:31:34] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/93 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/105 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 266/371 variables, 105/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/457 variables, 25/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 45/502 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/502 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 39/541 variables, 44/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/541 variables, 7/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/541 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/541 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 175/175 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/93 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/105 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 266/371 variables, 105/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 86/457 variables, 25/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 45/502 variables, 5/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/502 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/502 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 39/541 variables, 44/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/541 variables, 7/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/541 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/541 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 175/175 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 477ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p4 p2 p0 p1 p3), (X p2), (X p4), (X (NOT (AND (NOT p2) (NOT p4)))), (X (NOT (AND p4 (NOT p1)))), (X (NOT (AND (NOT p2) p4))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 p4 (NOT p1)))), (X (NOT (AND p2 (NOT p4) p1))), (X p0), (X (AND p4 p0)), (X (NOT (AND (NOT p4) p0))), (X (NOT (AND (NOT p2) (NOT p4) (NOT p1)))), (X (NOT (AND (NOT p2) p4 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p4) p1))), (X (NOT (AND (NOT p2) p4 p1))), (X (NOT (AND p2 (NOT p4)))), (X (NOT (AND (NOT p4) (NOT p1)))), (X (AND p4 p1)), (X (NOT (AND (NOT p4) p1))), (X (AND p2 p1 p0)), (X (NOT (AND p2 (NOT p4) (NOT p1)))), (X (AND p2 p4 p1)), (X (NOT (AND (NOT p2) p1 p0))), (X (AND p2 p4)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p1 p0)), (X p1), (X (X p2)), (X (X p4)), (X (X (NOT (AND (NOT p2) (NOT p4))))), (X (X (NOT (AND p4 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p4)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 p4 (NOT p1))))), (X (X (NOT (AND p2 (NOT p4) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p4 p0))), (X (X (NOT (AND (NOT p4) p0)))), (X (X (NOT (AND (NOT p2) (NOT p4) (NOT p1))))), (X (X (NOT (AND (NOT p2) p4 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p4) p1)))), (X (X (NOT (AND (NOT p2) p4 p1)))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (NOT (AND (NOT p4) (NOT p1))))), (X (X (AND p4 p1))), (X (X (NOT (AND (NOT p4) p1)))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 (NOT p4) (NOT p1))))), (X (X (AND p2 p4 p1))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND p2 p4))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT (OR (NOT p2) p1 p3))), (F (NOT (AND p4 p1))), (F (NOT (OR (NOT p4) p1))), (F (NOT (OR p2 (NOT p4)))), (F (NOT (OR p4 p1))), (F (NOT (OR (NOT p2) p4))), (F (NOT (OR (NOT p2) (NOT p1) p3))), (F (NOT p2)), (F (NOT (OR (NOT p2) p3))), (F (NOT (AND p2 p1 p0))), (F (NOT (OR p2 p4))), (F (NOT (OR p4 (NOT p1)))), (F (NOT p4)), (F (NOT (OR p2 p1 (NOT p0)))), (F (NOT (OR p2 (NOT p4) (NOT p1)))), (F (NOT (OR p2 p4 (NOT p1)))), (F (NOT p1)), (F (NOT (OR p2 (NOT p4) p1))), (F (NOT (AND p1 p0))), (F (NOT p3)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1 (NOT p0)))), (F (NOT (OR p1 p3))), (F (NOT p0)), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND p2 p4))), (F (NOT (OR p2 (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p2) p4 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p4) p1))), (F (NOT (OR p2 p3))), (F (NOT (OR p2 p4 p1))), (F (NOT (OR p4 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND p4 p0))), (F (NOT (OR (NOT p4) p3))), (F (NOT (OR p2 p1))), (F (NOT (AND p2 p4 p1))), (F (NOT (OR p2 (NOT p1) p3))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p2) p4 p1))), (F (NOT (OR p2 p1 p3))), (F (NOT (OR p4 p3)))]
Knowledge based reduction with 61 factoid took 6085 ms. Reduced automaton from 44 states, 173 edges and 5 AP (stutter sensitive) to 44 states, 173 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1939 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 1782 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 1916 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 22221 reset in 420 ms.
Product exploration explored 100000 steps with 22163 reset in 422 ms.
Applying partial POR strategy [true, false, false, false, false, false, false, false, true, false, false, true, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, true, false, false, false, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 1878 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 10 out of 1310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1310/1310 places, 2394/2394 transitions.
Graph (trivial) has 1344 edges and 1310 vertex of which 485 / 1310 are part of one of the 55 SCC in 3 ms
Free SCC test removed 430 places
Ensure Unique test removed 492 transitions
Reduce isomorphic transitions removed 492 transitions.
Graph (complete) has 4017 edges and 880 vertex of which 860 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 346 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 346 rules applied. Total rules applied 348 place count 860 transition count 1900
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 348 place count 860 transition count 1942
Deduced a syphon composed of 395 places in 1 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 397 place count 860 transition count 1942
Discarding 184 places :
Symmetric choice reduction at 1 with 184 rule applications. Total rules 581 place count 676 transition count 1758
Deduced a syphon composed of 211 places in 2 ms
Iterating global reduction 1 with 184 rules applied. Total rules applied 765 place count 676 transition count 1758
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 355 places in 1 ms
Iterating global reduction 1 with 144 rules applied. Total rules applied 909 place count 676 transition count 1758
Discarding 108 places :
Symmetric choice reduction at 1 with 108 rule applications. Total rules 1017 place count 568 transition count 1650
Deduced a syphon composed of 247 places in 0 ms
Iterating global reduction 1 with 108 rules applied. Total rules applied 1125 place count 568 transition count 1650
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -314
Deduced a syphon composed of 291 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 1169 place count 568 transition count 1964
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 1176 place count 568 transition count 1957
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 1229 place count 515 transition count 1788
Deduced a syphon composed of 238 places in 1 ms
Iterating global reduction 2 with 53 rules applied. Total rules applied 1282 place count 515 transition count 1788
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 245 places in 1 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 1289 place count 515 transition count 1886
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1296 place count 508 transition count 1872
Deduced a syphon composed of 238 places in 1 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 1303 place count 508 transition count 1872
Deduced a syphon composed of 238 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 113 transitions
Redundant transition composition rules discarded 113 transitions
Iterating global reduction 2 with 113 rules applied. Total rules applied 1416 place count 508 transition count 1759
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1430 place count 494 transition count 1745
Deduced a syphon composed of 224 places in 1 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 1444 place count 494 transition count 1745
Deduced a syphon composed of 224 places in 0 ms
Applied a total of 1444 rules in 261 ms. Remains 494 /1310 variables (removed 816) and now considering 1745/2394 (removed 649) transitions.
[2024-05-21 23:31:53] [INFO ] Redundant transitions in 1497 ms returned []
Running 1744 sub problems to find dead transitions.
[2024-05-21 23:31:53] [INFO ] Flow matrix only has 1439 transitions (discarded 306 similar events)
// Phase 1: matrix 1439 rows 494 cols
[2024-05-21 23:31:53] [INFO ] Computed 7 invariants in 14 ms
[2024-05-21 23:31:53] [INFO ] State equation strengthened by 449 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/493 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/493 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1744 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
At refinement iteration 2 (OVERLAPS) 1438/1931 variables, 493/500 constraints. Problems are: Problem set: 294 solved, 1450 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1931 variables, 448/948 constraints. Problems are: Problem set: 294 solved, 1450 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1931/1933 variables, and 948 constraints, problems are : Problem set: 294 solved, 1450 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 493/494 constraints, ReadFeed: 448/449 constraints, PredecessorRefiner: 1744/1744 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 294 solved, 1450 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 294 solved, 1450 unsolved
At refinement iteration 1 (OVERLAPS) 16/285 variables, 7/7 constraints. Problems are: Problem set: 294 solved, 1450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/7 constraints. Problems are: Problem set: 294 solved, 1450 unsolved
At refinement iteration 3 (OVERLAPS) 1417/1702 variables, 285/292 constraints. Problems are: Problem set: 294 solved, 1450 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1702 variables, 448/740 constraints. Problems are: Problem set: 294 solved, 1450 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1702/1933 variables, and 2190 constraints, problems are : Problem set: 294 solved, 1450 unsolved in 30677 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 285/494 constraints, ReadFeed: 448/449 constraints, PredecessorRefiner: 1450/1744 constraints, Known Traps: 0/0 constraints]
After SMT, in 68992ms problems are : Problem set: 294 solved, 1450 unsolved
Search for dead transitions found 294 dead transitions in 69010ms
Found 294 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 294 transitions
Dead transitions reduction (with SMT) removed 294 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 494/1310 places, 1451/2394 transitions.
Graph (complete) has 3080 edges and 494 vertex of which 270 are kept as prefixes of interest. Removing 224 places using SCC suffix rule.6 ms
Discarding 224 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 37 ms. Remains 270 /494 variables (removed 224) and now considering 1451/1451 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 270/1310 places, 1451/2394 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 70825 ms. Remains : 270/1310 places, 1451/2394 transitions.
Built C files in :
/tmp/ltsmin11277404060525787711
[2024-05-21 23:33:02] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11277404060525787711
Running compilation step : cd /tmp/ltsmin11277404060525787711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11277404060525787711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11277404060525787711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 1310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1310/1310 places, 2394/2394 transitions.
Applied a total of 0 rules in 51 ms. Remains 1310 /1310 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
// Phase 1: matrix 2394 rows 1310 cols
[2024-05-21 23:33:05] [INFO ] Computed 18 invariants in 9 ms
[2024-05-21 23:33:05] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-21 23:33:05] [INFO ] Invariant cache hit.
[2024-05-21 23:33:07] [INFO ] Implicit Places using invariants and state equation in 1891 ms returned [196, 362, 370, 535, 543, 708, 716, 881, 889, 1054, 1064]
[2024-05-21 23:33:07] [INFO ] Actually due to overlaps returned [196]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2179 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1309/1310 places, 2394/2394 transitions.
Applied a total of 0 rules in 41 ms. Remains 1309 /1309 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2273 ms. Remains : 1309/1310 places, 2394/2394 transitions.
Built C files in :
/tmp/ltsmin12751655510444144697
[2024-05-21 23:33:07] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12751655510444144697
Running compilation step : cd /tmp/ltsmin12751655510444144697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12751655510444144697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12751655510444144697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 23:33:10] [INFO ] Flatten gal took : 100 ms
[2024-05-21 23:33:11] [INFO ] Flatten gal took : 97 ms
[2024-05-21 23:33:11] [INFO ] Time to serialize gal into /tmp/LTL7299406942070222120.gal : 29 ms
[2024-05-21 23:33:11] [INFO ] Time to serialize properties into /tmp/LTL9605511625848703090.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7299406942070222120.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18051417205170705187.hoa' '-atoms' '/tmp/LTL9605511625848703090.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9605511625848703090.prop.
Loaded 5 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18051417205170705187.hoa
Detected timeout of ITS tools.
[2024-05-21 23:33:26] [INFO ] Flatten gal took : 102 ms
[2024-05-21 23:33:26] [INFO ] Flatten gal took : 106 ms
[2024-05-21 23:33:26] [INFO ] Time to serialize gal into /tmp/LTL7002160198181939743.gal : 30 ms
[2024-05-21 23:33:26] [INFO ] Time to serialize properties into /tmp/LTL5739068880966210672.ltl : 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7002160198181939743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5739068880966210672.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((("((p351==0)||(p1869==1))")U(G(("((p99==0)||(p2029==1))")U(X(X(X("((p522==0)||(p367==1))")))))))&&("((p1984==0)||(p496==1))"))U(X...189
Formula 0 simplified : (!"((p1984==0)||(p496==1))" | (!"((p351==0)||(p1869==1))" R F(!"((p99==0)||(p2029==1))" R XXX!"((p522==0)||(p367==1))"))) R XF!"((p1...176
Detected timeout of ITS tools.
[2024-05-21 23:33:41] [INFO ] Flatten gal took : 80 ms
[2024-05-21 23:33:41] [INFO ] Applying decomposition
[2024-05-21 23:33:41] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7162247664462513712.txt' '-o' '/tmp/graph7162247664462513712.bin' '-w' '/tmp/graph7162247664462513712.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7162247664462513712.bin' '-l' '-1' '-v' '-w' '/tmp/graph7162247664462513712.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:33:41] [INFO ] Decomposing Gal with order
[2024-05-21 23:33:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:33:42] [INFO ] Removed a total of 3451 redundant transitions.
[2024-05-21 23:33:42] [INFO ] Flatten gal took : 237 ms
[2024-05-21 23:33:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 50 ms.
[2024-05-21 23:33:42] [INFO ] Time to serialize gal into /tmp/LTL17856287761915923238.gal : 19 ms
[2024-05-21 23:33:42] [INFO ] Time to serialize properties into /tmp/LTL16625905289320006070.ltl : 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17856287761915923238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16625905289320006070.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((((("((i5.u69.p351==0)||(i25.i0.i0.u385.p1869==1))")U(G(("((i6.u8.p99==0)||(i23.i1.i1.u410.p2029==1))")U(X(X(X("((i8.i0.i4.u104.p522...298
Formula 0 simplified : (!"((i23.i0.i0.u396.p1984==0)||(i8.i0.i2.u97.p496==1))" | (!"((i5.u69.p351==0)||(i25.i0.i0.u385.p1869==1))" R F(!"((i6.u8.p99==0)||(...285
Detected timeout of ITS tools.
Treatment of property CloudDeployment-PT-7b-LTLCardinality-03 finished in 253389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1329 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1329/1329 places, 2414/2414 transitions.
Graph (trivial) has 1378 edges and 1329 vertex of which 498 / 1329 are part of one of the 56 SCC in 2 ms
Free SCC test removed 442 places
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Graph (complete) has 4087 edges and 887 vertex of which 865 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 354 place count 864 transition count 1554
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 706 place count 512 transition count 1554
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 706 place count 512 transition count 1488
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 838 place count 446 transition count 1488
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 849 place count 435 transition count 1477
Iterating global reduction 2 with 11 rules applied. Total rules applied 860 place count 435 transition count 1477
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 861 place count 435 transition count 1476
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 861 place count 435 transition count 1471
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 871 place count 430 transition count 1471
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 872 place count 429 transition count 1470
Iterating global reduction 3 with 1 rules applied. Total rules applied 873 place count 429 transition count 1470
Performed 137 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 137 places in 1 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 1147 place count 292 transition count 1329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1148 place count 292 transition count 1328
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1204 place count 264 transition count 1398
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1210 place count 264 transition count 1392
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1222 place count 258 transition count 1464
Drop transitions (Redundant composition of simpler transitions.) removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 5 with 57 rules applied. Total rules applied 1279 place count 258 transition count 1407
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1280 place count 257 transition count 1406
Applied a total of 1280 rules in 163 ms. Remains 257 /1329 variables (removed 1072) and now considering 1406/2414 (removed 1008) transitions.
[2024-05-21 23:33:57] [INFO ] Flow matrix only has 1106 transitions (discarded 300 similar events)
// Phase 1: matrix 1106 rows 257 cols
[2024-05-21 23:33:57] [INFO ] Computed 7 invariants in 10 ms
[2024-05-21 23:33:57] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-21 23:33:57] [INFO ] Flow matrix only has 1106 transitions (discarded 300 similar events)
[2024-05-21 23:33:57] [INFO ] Invariant cache hit.
[2024-05-21 23:33:58] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-21 23:33:58] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2024-05-21 23:33:59] [INFO ] Redundant transitions in 995 ms returned []
Running 1348 sub problems to find dead transitions.
[2024-05-21 23:33:59] [INFO ] Flow matrix only has 1106 transitions (discarded 300 similar events)
[2024-05-21 23:33:59] [INFO ] Invariant cache hit.
[2024-05-21 23:33:59] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1348 unsolved
At refinement iteration 2 (OVERLAPS) 1105/1354 variables, 249/256 constraints. Problems are: Problem set: 0 solved, 1348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1354 variables, 56/312 constraints. Problems are: Problem set: 0 solved, 1348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1354/1363 variables, and 312 constraints, problems are : Problem set: 0 solved, 1348 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 249/257 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1348/1348 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1348 unsolved
At refinement iteration 2 (OVERLAPS) 1105/1354 variables, 249/256 constraints. Problems are: Problem set: 0 solved, 1348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1354 variables, 56/312 constraints. Problems are: Problem set: 0 solved, 1348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1354 variables, 15/327 constraints. Problems are: Problem set: 0 solved, 1348 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 Int declared 1354/1363 variables, and 327 constraints, problems are : Problem set: 0 solved, 1348 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 249/257 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 15/1348 constraints, Known Traps: 0/0 constraints]
After SMT, in 67469ms problems are : Problem set: 0 solved, 1348 unsolved
Search for dead transitions found 0 dead transitions in 67481ms
Starting structural reductions in SI_LTL mode, iteration 1 : 257/1329 places, 1406/2414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69253 ms. Remains : 257/1329 places, 1406/2414 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-04 finished in 69375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 1329 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1329/1329 places, 2414/2414 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1311 transition count 2396
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1311 transition count 2396
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1311 transition count 2395
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 1305 transition count 2389
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 1305 transition count 2389
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 54 place count 1305 transition count 2384
Applied a total of 54 rules in 121 ms. Remains 1305 /1329 variables (removed 24) and now considering 2384/2414 (removed 30) transitions.
// Phase 1: matrix 2384 rows 1305 cols
[2024-05-21 23:35:07] [INFO ] Computed 20 invariants in 18 ms
[2024-05-21 23:35:07] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-21 23:35:07] [INFO ] Invariant cache hit.
[2024-05-21 23:35:09] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned [20, 186, 194, 359, 367, 533, 541, 707, 715, 880, 888, 1053, 1061]
[2024-05-21 23:35:09] [INFO ] Actually due to overlaps returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2033 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1304/1329 places, 2384/2414 transitions.
Applied a total of 0 rules in 36 ms. Remains 1304 /1304 variables (removed 0) and now considering 2384/2384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2190 ms. Remains : 1304/1329 places, 2384/2414 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-09 finished in 2318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1329 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1329/1329 places, 2414/2414 transitions.
Graph (trivial) has 1376 edges and 1329 vertex of which 498 / 1329 are part of one of the 56 SCC in 1 ms
Free SCC test removed 442 places
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Graph (complete) has 4087 edges and 887 vertex of which 865 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 354 place count 864 transition count 1554
Reduce places removed 352 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 353 rules applied. Total rules applied 707 place count 512 transition count 1553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 708 place count 511 transition count 1553
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 708 place count 511 transition count 1488
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 838 place count 446 transition count 1488
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 849 place count 435 transition count 1477
Iterating global reduction 3 with 11 rules applied. Total rules applied 860 place count 435 transition count 1477
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 861 place count 435 transition count 1476
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 861 place count 435 transition count 1471
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 871 place count 430 transition count 1471
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 872 place count 429 transition count 1470
Iterating global reduction 4 with 1 rules applied. Total rules applied 873 place count 429 transition count 1470
Performed 137 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 137 places in 1 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 4 with 274 rules applied. Total rules applied 1147 place count 292 transition count 1329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1148 place count 292 transition count 1328
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 1202 place count 265 transition count 1396
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1208 place count 265 transition count 1390
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1220 place count 259 transition count 1462
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 6 with 53 rules applied. Total rules applied 1273 place count 259 transition count 1409
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1274 place count 258 transition count 1408
Applied a total of 1274 rules in 183 ms. Remains 258 /1329 variables (removed 1071) and now considering 1408/2414 (removed 1006) transitions.
[2024-05-21 23:35:09] [INFO ] Flow matrix only has 1108 transitions (discarded 300 similar events)
// Phase 1: matrix 1108 rows 258 cols
[2024-05-21 23:35:09] [INFO ] Computed 7 invariants in 8 ms
[2024-05-21 23:35:09] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-21 23:35:09] [INFO ] Flow matrix only has 1108 transitions (discarded 300 similar events)
[2024-05-21 23:35:09] [INFO ] Invariant cache hit.
[2024-05-21 23:35:09] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-21 23:35:10] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2024-05-21 23:35:11] [INFO ] Redundant transitions in 1102 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-05-21 23:35:11] [INFO ] Flow matrix only has 1108 transitions (discarded 300 similar events)
[2024-05-21 23:35:11] [INFO ] Invariant cache hit.
[2024-05-21 23:35:11] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (OVERLAPS) 1107/1358 variables, 251/258 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1358 variables, 56/314 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1358/1366 variables, and 314 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 251/258 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (OVERLAPS) 1107/1358 variables, 251/258 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1358 variables, 56/314 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1358 variables, 17/331 constraints. Problems are: Problem set: 0 solved, 1351 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 Int declared 1358/1366 variables, and 331 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 251/258 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 17/1351 constraints, Known Traps: 0/0 constraints]
After SMT, in 67252ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 67264ms
Starting structural reductions in SI_LTL mode, iteration 1 : 258/1329 places, 1408/2414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69213 ms. Remains : 258/1329 places, 1408/2414 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-10
Stuttering criterion allowed to conclude after 195 steps with 3 reset in 13 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-10 finished in 69281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1&&G((!p0&&X(!p0))))))'
Support contains 4 out of 1329 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1329/1329 places, 2414/2414 transitions.
Graph (trivial) has 1374 edges and 1329 vertex of which 483 / 1329 are part of one of the 55 SCC in 2 ms
Free SCC test removed 428 places
Ensure Unique test removed 489 transitions
Reduce isomorphic transitions removed 489 transitions.
Graph (complete) has 4105 edges and 901 vertex of which 879 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 358 place count 878 transition count 1566
Reduce places removed 356 places and 0 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 714 place count 522 transition count 1566
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 714 place count 522 transition count 1496
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 854 place count 452 transition count 1496
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 863 place count 443 transition count 1487
Iterating global reduction 2 with 9 rules applied. Total rules applied 872 place count 443 transition count 1487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 873 place count 443 transition count 1486
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 873 place count 443 transition count 1482
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 881 place count 439 transition count 1482
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 882 place count 438 transition count 1481
Iterating global reduction 3 with 1 rules applied. Total rules applied 883 place count 438 transition count 1481
Performed 139 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 139 places in 0 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 1161 place count 299 transition count 1339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1162 place count 299 transition count 1338
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 1224 place count 268 transition count 1429
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1231 place count 268 transition count 1422
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1245 place count 261 transition count 1506
Drop transitions (Redundant composition of simpler transitions.) removed 79 transitions
Redundant transition composition rules discarded 79 transitions
Iterating global reduction 5 with 79 rules applied. Total rules applied 1324 place count 261 transition count 1427
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1325 place count 260 transition count 1426
Applied a total of 1325 rules in 177 ms. Remains 260 /1329 variables (removed 1069) and now considering 1426/2414 (removed 988) transitions.
[2024-05-21 23:36:18] [INFO ] Flow matrix only has 1127 transitions (discarded 299 similar events)
// Phase 1: matrix 1127 rows 260 cols
[2024-05-21 23:36:18] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 23:36:18] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-21 23:36:18] [INFO ] Flow matrix only has 1127 transitions (discarded 299 similar events)
[2024-05-21 23:36:18] [INFO ] Invariant cache hit.
[2024-05-21 23:36:19] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-21 23:36:19] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2024-05-21 23:36:20] [INFO ] Redundant transitions in 1057 ms returned []
Running 1369 sub problems to find dead transitions.
[2024-05-21 23:36:20] [INFO ] Flow matrix only has 1127 transitions (discarded 299 similar events)
[2024-05-21 23:36:20] [INFO ] Invariant cache hit.
[2024-05-21 23:36:20] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1369 unsolved
At refinement iteration 2 (OVERLAPS) 1126/1379 variables, 253/260 constraints. Problems are: Problem set: 0 solved, 1369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1379 variables, 56/316 constraints. Problems are: Problem set: 0 solved, 1369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1379/1387 variables, and 316 constraints, problems are : Problem set: 0 solved, 1369 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 253/260 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1369/1369 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1369 unsolved
At refinement iteration 2 (OVERLAPS) 1126/1379 variables, 253/260 constraints. Problems are: Problem set: 0 solved, 1369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1379 variables, 56/316 constraints. Problems are: Problem set: 0 solved, 1369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1379 variables, 18/334 constraints. Problems are: Problem set: 0 solved, 1369 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 Int declared 1379/1387 variables, and 334 constraints, problems are : Problem set: 0 solved, 1369 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 253/260 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 18/1369 constraints, Known Traps: 0/0 constraints]
After SMT, in 67578ms problems are : Problem set: 0 solved, 1369 unsolved
Search for dead transitions found 0 dead transitions in 67590ms
Starting structural reductions in SI_LTL mode, iteration 1 : 260/1329 places, 1426/2414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69457 ms. Remains : 260/1329 places, 1426/2414 transitions.
Stuttering acceptance computed with spot in 87 ms :[p0, true, (OR (NOT p1) p0)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-12 finished in 69562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p1||X(X(F(p1)))))||p0))))'
Support contains 3 out of 1329 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1329/1329 places, 2414/2414 transitions.
Graph (trivial) has 1375 edges and 1329 vertex of which 493 / 1329 are part of one of the 55 SCC in 1 ms
Free SCC test removed 438 places
Ensure Unique test removed 501 transitions
Reduce isomorphic transitions removed 501 transitions.
Graph (complete) has 4091 edges and 891 vertex of which 869 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 353 place count 868 transition count 1559
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 704 place count 517 transition count 1559
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 704 place count 517 transition count 1492
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 838 place count 450 transition count 1492
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 848 place count 440 transition count 1482
Iterating global reduction 2 with 10 rules applied. Total rules applied 858 place count 440 transition count 1482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 859 place count 440 transition count 1481
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 859 place count 440 transition count 1477
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 867 place count 436 transition count 1477
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 868 place count 435 transition count 1476
Iterating global reduction 3 with 1 rules applied. Total rules applied 869 place count 435 transition count 1476
Performed 138 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 138 places in 0 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 276 rules applied. Total rules applied 1145 place count 297 transition count 1335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1146 place count 297 transition count 1334
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -82
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1204 place count 268 transition count 1416
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1210 place count 268 transition count 1410
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1222 place count 262 transition count 1482
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 5 with 56 rules applied. Total rules applied 1278 place count 262 transition count 1426
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1280 place count 261 transition count 1433
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1281 place count 260 transition count 1432
Applied a total of 1281 rules in 161 ms. Remains 260 /1329 variables (removed 1069) and now considering 1432/2414 (removed 982) transitions.
[2024-05-21 23:37:28] [INFO ] Flow matrix only has 1140 transitions (discarded 292 similar events)
// Phase 1: matrix 1140 rows 260 cols
[2024-05-21 23:37:28] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 23:37:28] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-21 23:37:28] [INFO ] Flow matrix only has 1140 transitions (discarded 292 similar events)
[2024-05-21 23:37:28] [INFO ] Invariant cache hit.
[2024-05-21 23:37:28] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-21 23:37:28] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2024-05-21 23:37:29] [INFO ] Redundant transitions in 862 ms returned []
Running 1375 sub problems to find dead transitions.
[2024-05-21 23:37:29] [INFO ] Flow matrix only has 1140 transitions (discarded 292 similar events)
[2024-05-21 23:37:29] [INFO ] Invariant cache hit.
[2024-05-21 23:37:29] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (OVERLAPS) 1139/1392 variables, 253/260 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1392 variables, 56/316 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1392/1400 variables, and 316 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 253/260 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1375/1375 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (OVERLAPS) 1139/1392 variables, 253/260 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1392 variables, 56/316 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1392 variables, 15/331 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1392/1400 variables, and 331 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 253/260 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 15/1375 constraints, Known Traps: 0/0 constraints]
After SMT, in 68152ms problems are : Problem set: 0 solved, 1375 unsolved
Search for dead transitions found 0 dead transitions in 68164ms
Starting structural reductions in SI_LTL mode, iteration 1 : 260/1329 places, 1432/2414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69807 ms. Remains : 260/1329 places, 1432/2414 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-13
Stuttering criterion allowed to conclude after 7859 steps with 149 reset in 59 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-13 finished in 69966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 1329 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1329/1329 places, 2414/2414 transitions.
Graph (trivial) has 1376 edges and 1329 vertex of which 498 / 1329 are part of one of the 56 SCC in 0 ms
Free SCC test removed 442 places
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Graph (complete) has 4087 edges and 887 vertex of which 865 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 353 transitions
Trivial Post-agglo rules discarded 353 transitions
Performed 353 trivial Post agglomeration. Transition count delta: 353
Iterating post reduction 0 with 353 rules applied. Total rules applied 355 place count 864 transition count 1553
Reduce places removed 353 places and 0 transitions.
Iterating post reduction 1 with 353 rules applied. Total rules applied 708 place count 511 transition count 1553
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 708 place count 511 transition count 1487
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 840 place count 445 transition count 1487
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 849 place count 436 transition count 1478
Iterating global reduction 2 with 9 rules applied. Total rules applied 858 place count 436 transition count 1478
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 859 place count 436 transition count 1477
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 859 place count 436 transition count 1472
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 869 place count 431 transition count 1472
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 870 place count 430 transition count 1471
Iterating global reduction 3 with 1 rules applied. Total rules applied 871 place count 430 transition count 1471
Performed 135 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 135 places in 1 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 1141 place count 295 transition count 1332
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1142 place count 295 transition count 1331
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1198 place count 267 transition count 1401
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1205 place count 267 transition count 1394
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1219 place count 260 transition count 1478
Drop transitions (Redundant composition of simpler transitions.) removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 5 with 57 rules applied. Total rules applied 1276 place count 260 transition count 1421
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1278 place count 260 transition count 1421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1279 place count 259 transition count 1420
Applied a total of 1279 rules in 175 ms. Remains 259 /1329 variables (removed 1070) and now considering 1420/2414 (removed 994) transitions.
[2024-05-21 23:38:38] [INFO ] Flow matrix only has 1120 transitions (discarded 300 similar events)
// Phase 1: matrix 1120 rows 259 cols
[2024-05-21 23:38:38] [INFO ] Computed 7 invariants in 9 ms
[2024-05-21 23:38:38] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-21 23:38:38] [INFO ] Flow matrix only has 1120 transitions (discarded 300 similar events)
[2024-05-21 23:38:38] [INFO ] Invariant cache hit.
[2024-05-21 23:38:38] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-21 23:38:38] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2024-05-21 23:38:39] [INFO ] Redundant transitions in 882 ms returned []
Running 1363 sub problems to find dead transitions.
[2024-05-21 23:38:39] [INFO ] Flow matrix only has 1120 transitions (discarded 300 similar events)
[2024-05-21 23:38:39] [INFO ] Invariant cache hit.
[2024-05-21 23:38:39] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
At refinement iteration 2 (OVERLAPS) 1119/1371 variables, 252/259 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1371 variables, 56/315 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1371/1379 variables, and 315 constraints, problems are : Problem set: 0 solved, 1363 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 252/259 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1363/1363 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
At refinement iteration 2 (OVERLAPS) 1119/1371 variables, 252/259 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1371 variables, 56/315 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1371 variables, 15/330 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1371/1379 variables, and 330 constraints, problems are : Problem set: 0 solved, 1363 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 252/259 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 15/1363 constraints, Known Traps: 0/0 constraints]
After SMT, in 67273ms problems are : Problem set: 0 solved, 1363 unsolved
Search for dead transitions found 0 dead transitions in 67285ms
Starting structural reductions in SI_LTL mode, iteration 1 : 259/1329 places, 1420/2414 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68963 ms. Remains : 259/1329 places, 1420/2414 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-14
Stuttering criterion allowed to conclude after 74 steps with 1 reset in 1 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-14 finished in 69102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1329 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1329/1329 places, 2414/2414 transitions.
Graph (trivial) has 1380 edges and 1329 vertex of which 498 / 1329 are part of one of the 56 SCC in 0 ms
Free SCC test removed 442 places
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Graph (complete) has 4087 edges and 887 vertex of which 865 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 354 transitions
Trivial Post-agglo rules discarded 354 transitions
Performed 354 trivial Post agglomeration. Transition count delta: 354
Iterating post reduction 0 with 354 rules applied. Total rules applied 356 place count 864 transition count 1552
Reduce places removed 354 places and 0 transitions.
Iterating post reduction 1 with 354 rules applied. Total rules applied 710 place count 510 transition count 1552
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 710 place count 510 transition count 1486
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 842 place count 444 transition count 1486
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 852 place count 434 transition count 1476
Iterating global reduction 2 with 10 rules applied. Total rules applied 862 place count 434 transition count 1476
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 862 place count 434 transition count 1471
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 872 place count 429 transition count 1471
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 873 place count 428 transition count 1470
Iterating global reduction 2 with 1 rules applied. Total rules applied 874 place count 428 transition count 1470
Performed 137 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 137 places in 1 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 274 rules applied. Total rules applied 1148 place count 291 transition count 1329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1149 place count 291 transition count 1328
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1205 place count 263 transition count 1398
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1212 place count 263 transition count 1391
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1226 place count 256 transition count 1475
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 4 with 56 rules applied. Total rules applied 1282 place count 256 transition count 1419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1283 place count 255 transition count 1418
Applied a total of 1283 rules in 168 ms. Remains 255 /1329 variables (removed 1074) and now considering 1418/2414 (removed 996) transitions.
[2024-05-21 23:39:47] [INFO ] Flow matrix only has 1118 transitions (discarded 300 similar events)
// Phase 1: matrix 1118 rows 255 cols
[2024-05-21 23:39:47] [INFO ] Computed 7 invariants in 12 ms
[2024-05-21 23:39:47] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-21 23:39:47] [INFO ] Flow matrix only has 1118 transitions (discarded 300 similar events)
[2024-05-21 23:39:47] [INFO ] Invariant cache hit.
[2024-05-21 23:39:47] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-21 23:39:48] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2024-05-21 23:39:48] [INFO ] Redundant transitions in 893 ms returned []
Running 1361 sub problems to find dead transitions.
[2024-05-21 23:39:48] [INFO ] Flow matrix only has 1118 transitions (discarded 300 similar events)
[2024-05-21 23:39:48] [INFO ] Invariant cache hit.
[2024-05-21 23:39:48] [INFO ] State equation strengthened by 56 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s59 1.0)
(timeout
s60 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 248/1373 variables, and 7 constraints, problems are : Problem set: 0 solved, 1361 unsolved in 30349 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/255 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 1361/1361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1361 unsolved

BK_STOP 1716334827095

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-7b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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