Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r070-tall-171620506200595.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-5b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620506200595
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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 Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 15:44 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 1.5M 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-5b-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-5b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716329306181

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-5b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 22:08:27] [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 22:08:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:08:27] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2024-05-21 22:08:27] [INFO ] Transformed 1525 places.
[2024-05-21 22:08:27] [INFO ] Transformed 3132 transitions.
[2024-05-21 22:08:27] [INFO ] Found NUPN structural information;
[2024-05-21 22:08:27] [INFO ] Parsed PT model containing 1525 places and 3132 transitions and 24760 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-5b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1525 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1525/1525 places, 3132/3132 transitions.
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1519 transition count 3132
Discarding 405 places :
Symmetric choice reduction at 1 with 405 rule applications. Total rules 411 place count 1114 transition count 1714
Iterating global reduction 1 with 405 rules applied. Total rules applied 816 place count 1114 transition count 1714
Discarding 148 places :
Symmetric choice reduction at 1 with 148 rule applications. Total rules 964 place count 966 transition count 1566
Iterating global reduction 1 with 148 rules applied. Total rules applied 1112 place count 966 transition count 1566
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1129 place count 966 transition count 1549
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1144 place count 951 transition count 1534
Iterating global reduction 2 with 15 rules applied. Total rules applied 1159 place count 951 transition count 1534
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1160 place count 950 transition count 1533
Iterating global reduction 2 with 1 rules applied. Total rules applied 1161 place count 950 transition count 1533
Applied a total of 1161 rules in 420 ms. Remains 950 /1525 variables (removed 575) and now considering 1533/3132 (removed 1599) transitions.
// Phase 1: matrix 1533 rows 950 cols
[2024-05-21 22:08:28] [INFO ] Computed 15 invariants in 35 ms
[2024-05-21 22:08:28] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-21 22:08:28] [INFO ] Invariant cache hit.
[2024-05-21 22:08:29] [INFO ] Implicit Places using invariants and state equation in 982 ms returned [11, 20, 189, 199, 367, 375, 542, 551, 718, 728]
[2024-05-21 22:08:29] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1464 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 949/1525 places, 1533/3132 transitions.
Applied a total of 0 rules in 23 ms. Remains 949 /949 variables (removed 0) and now considering 1533/1533 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1923 ms. Remains : 949/1525 places, 1533/3132 transitions.
Support contains 26 out of 949 places after structural reductions.
[2024-05-21 22:08:30] [INFO ] Flatten gal took : 160 ms
[2024-05-21 22:08:30] [INFO ] Flatten gal took : 90 ms
[2024-05-21 22:08:30] [INFO ] Input system was already deterministic with 1533 transitions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (248 resets) in 1564 ms. (25 steps per ms) remains 4/14 properties
BEST_FIRST walk for 40004 steps (30 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (31 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (30 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (31 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
// Phase 1: matrix 1533 rows 949 cols
[2024-05-21 22:08:31] [INFO ] Computed 14 invariants in 9 ms
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 32/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 166/206 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 699/905 variables, 206/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 508/1413 variables, 213/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1413 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 454/1867 variables, 203/636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1867 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 412/2279 variables, 193/829 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2279 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 154/2433 variables, 104/933 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2433 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 34/2467 variables, 20/953 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2467 variables, 0/953 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 15/2482 variables, 10/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2482 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/2482 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2482/2482 variables, and 963 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1445 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 949/949 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 32/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 166/206 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 699/905 variables, 206/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 508/1413 variables, 213/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1413 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1413 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 454/1867 variables, 203/640 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1867 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 412/2279 variables, 193/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2279 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 154/2433 variables, 104/937 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2433 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 34/2467 variables, 20/957 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2467 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 15/2482 variables, 10/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2482 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/2482 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2482/2482 variables, and 967 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2002 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 949/949 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 3502ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 3 properties in 224 ms.
Support contains 2 out of 949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 1533/1533 transitions.
Graph (trivial) has 987 edges and 949 vertex of which 356 / 949 are part of one of the 40 SCC in 4 ms
Free SCC test removed 316 places
Drop transitions (Empty/Sink Transition effects.) removed 404 transitions
Reduce isomorphic transitions removed 404 transitions.
Graph (complete) has 2347 edges and 633 vertex of which 617 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.5 ms
Discarding 16 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 260 transitions
Trivial Post-agglo rules discarded 260 transitions
Performed 260 trivial Post agglomeration. Transition count delta: 260
Iterating post reduction 0 with 279 rules applied. Total rules applied 281 place count 617 transition count 850
Reduce places removed 260 places and 0 transitions.
Iterating post reduction 1 with 260 rules applied. Total rules applied 541 place count 357 transition count 850
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 541 place count 357 transition count 796
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 649 place count 303 transition count 796
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 662 place count 290 transition count 783
Iterating global reduction 2 with 13 rules applied. Total rules applied 675 place count 290 transition count 783
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 678 place count 290 transition count 780
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 678 place count 290 transition count 775
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 688 place count 285 transition count 775
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 854 place count 202 transition count 692
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 924 place count 167 transition count 902
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 959 place count 167 transition count 867
Drop transitions (Redundant composition of simpler transitions.) removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 4 with 155 rules applied. Total rules applied 1114 place count 167 transition count 712
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 1164 place count 167 transition count 642
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 140 transitions.
Graph (complete) has 903 edges and 117 vertex of which 116 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 191 rules applied. Total rules applied 1355 place count 116 transition count 502
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 1356 place count 116 transition count 501
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1360 place count 112 transition count 477
Iterating global reduction 6 with 4 rules applied. Total rules applied 1364 place count 112 transition count 477
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 6 with 75 rules applied. Total rules applied 1439 place count 112 transition count 402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1440 place count 111 transition count 401
Applied a total of 1440 rules in 306 ms. Remains 111 /949 variables (removed 838) and now considering 401/1533 (removed 1132) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 111/949 places, 401/1533 transitions.
RANDOM walk for 25884 steps (383 resets) in 220 ms. (117 steps per ms) remains 0/1 properties
Computed a total of 141 stabilizing places and 481 stable transitions
Graph (complete) has 2892 edges and 949 vertex of which 933 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.21 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(((p1 U G(!p1))||p0)))'
Support contains 2 out of 949 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 949/949 places, 1533/1533 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 935 transition count 1519
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 935 transition count 1519
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 935 transition count 1516
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 932 transition count 1513
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 932 transition count 1513
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 931 transition count 1512
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 931 transition count 1512
Applied a total of 39 rules in 168 ms. Remains 931 /949 variables (removed 18) and now considering 1512/1533 (removed 21) transitions.
// Phase 1: matrix 1512 rows 931 cols
[2024-05-21 22:08:35] [INFO ] Computed 14 invariants in 7 ms
[2024-05-21 22:08:36] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-21 22:08:36] [INFO ] Invariant cache hit.
[2024-05-21 22:08:37] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned [18, 184, 194, 360, 368, 533, 541, 706, 714]
[2024-05-21 22:08:37] [INFO ] Actually due to overlaps returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1259 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 930/949 places, 1512/1533 transitions.
Applied a total of 0 rules in 27 ms. Remains 930 /930 variables (removed 0) and now considering 1512/1512 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1454 ms. Remains : 930/949 places, 1512/1533 transitions.
Stuttering acceptance computed with spot in 269 ms :[p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), true]
Running random walk in product with property : CloudDeployment-PT-5b-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 595 ms.
Product exploration explored 100000 steps with 50000 reset in 464 ms.
Computed a total of 136 stabilizing places and 476 stable transitions
Graph (complete) has 2847 edges and 930 vertex of which 915 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.16 ms
Computed a total of 136 stabilizing places and 476 stable transitions
Detected a total of 136/930 stabilizing places and 476/1512 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 14 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-5b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-5b-LTLCardinality-03 finished in 2897 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 949 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 949/949 places, 1533/1533 transitions.
Graph (trivial) has 983 edges and 949 vertex of which 347 / 949 are part of one of the 39 SCC in 2 ms
Free SCC test removed 308 places
Ensure Unique test removed 352 transitions
Reduce isomorphic transitions removed 352 transitions.
Graph (complete) has 2488 edges and 641 vertex of which 625 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.5 ms
Discarding 16 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 254 transitions
Trivial Post-agglo rules discarded 254 transitions
Performed 254 trivial Post agglomeration. Transition count delta: 254
Iterating post reduction 0 with 254 rules applied. Total rules applied 256 place count 624 transition count 924
Reduce places removed 254 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 258 rules applied. Total rules applied 514 place count 370 transition count 920
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 519 place count 366 transition count 919
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 519 place count 366 transition count 867
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 623 place count 314 transition count 867
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 631 place count 306 transition count 859
Iterating global reduction 3 with 8 rules applied. Total rules applied 639 place count 306 transition count 859
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 642 place count 306 transition count 856
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 642 place count 306 transition count 855
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 644 place count 305 transition count 855
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 838 place count 208 transition count 758
Performed 25 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 888 place count 183 transition count 833
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 4 with 42 rules applied. Total rules applied 930 place count 183 transition count 791
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 940 place count 178 transition count 876
Drop transitions (Redundant composition of simpler transitions.) removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 4 with 64 rules applied. Total rules applied 1004 place count 178 transition count 812
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1005 place count 177 transition count 811
Applied a total of 1005 rules in 266 ms. Remains 177 /949 variables (removed 772) and now considering 811/1533 (removed 722) transitions.
[2024-05-21 22:08:38] [INFO ] Flow matrix only has 623 transitions (discarded 188 similar events)
// Phase 1: matrix 623 rows 177 cols
[2024-05-21 22:08:38] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 22:08:38] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-21 22:08:38] [INFO ] Flow matrix only has 623 transitions (discarded 188 similar events)
[2024-05-21 22:08:38] [INFO ] Invariant cache hit.
[2024-05-21 22:08:39] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 22:08:39] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2024-05-21 22:08:39] [INFO ] Redundant transitions in 579 ms returned []
Running 774 sub problems to find dead transitions.
[2024-05-21 22:08:39] [INFO ] Flow matrix only has 623 transitions (discarded 188 similar events)
[2024-05-21 22:08:39] [INFO ] Invariant cache hit.
[2024-05-21 22:08:39] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 2 (OVERLAPS) 622/793 variables, 171/176 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/793 variables, 31/207 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/793 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 5 (OVERLAPS) 6/799 variables, 6/213 constraints. Problems are: Problem set: 0 solved, 774 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/799 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 799/800 variables, and 213 constraints, problems are : Problem set: 0 solved, 774 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 774/774 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 774 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 2 (OVERLAPS) 622/793 variables, 171/176 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/793 variables, 31/207 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/793 variables, 27/234 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/793 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 6 (OVERLAPS) 6/799 variables, 6/240 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/799 variables, 747/987 constraints. Problems are: Problem set: 0 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 799/800 variables, and 987 constraints, problems are : Problem set: 0 solved, 774 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 774/774 constraints, Known Traps: 0/0 constraints]
After SMT, in 62649ms problems are : Problem set: 0 solved, 774 unsolved
Search for dead transitions found 0 dead transitions in 62681ms
Starting structural reductions in SI_LTL mode, iteration 1 : 177/949 places, 811/1533 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64022 ms. Remains : 177/949 places, 811/1533 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-5b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLCardinality-08 finished in 64081 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((p0||G((X(F(!p1)) U (p2&&G(!p0)))))))'
Support contains 5 out of 949 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 949/949 places, 1533/1533 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 937 transition count 1521
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 937 transition count 1521
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 937 transition count 1518
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 935 transition count 1516
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 935 transition count 1516
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 934 transition count 1515
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 934 transition count 1515
Applied a total of 33 rules in 86 ms. Remains 934 /949 variables (removed 15) and now considering 1515/1533 (removed 18) transitions.
// Phase 1: matrix 1515 rows 934 cols
[2024-05-21 22:09:42] [INFO ] Computed 14 invariants in 10 ms
[2024-05-21 22:09:42] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-21 22:09:42] [INFO ] Invariant cache hit.
[2024-05-21 22:09:43] [INFO ] Implicit Places using invariants and state equation in 931 ms returned [18, 186, 194, 359, 367, 534, 542, 709, 717]
[2024-05-21 22:09:43] [INFO ] Actually due to overlaps returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1151 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 933/949 places, 1515/1533 transitions.
Applied a total of 0 rules in 22 ms. Remains 933 /933 variables (removed 0) and now considering 1515/1515 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1259 ms. Remains : 933/949 places, 1515/1533 transitions.
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), p1, (OR (NOT p2) p0), (OR (NOT p2) p0), p0]
Running random walk in product with property : CloudDeployment-PT-5b-LTLCardinality-09
Product exploration explored 100000 steps with 623 reset in 252 ms.
Product exploration explored 100000 steps with 622 reset in 280 ms.
Computed a total of 136 stabilizing places and 476 stable transitions
Graph (complete) has 2849 edges and 933 vertex of which 918 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.6 ms
Computed a total of 136 stabilizing places and 476 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (OR p0 (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 133 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p2) p0), p1, (OR (NOT p2) p0), p0]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (254 resets) in 286 ms. (139 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (33 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (30 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (31 resets) in 198 ms. (201 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (30 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
// Phase 1: matrix 1515 rows 933 cols
[2024-05-21 22:09:45] [INFO ] Computed 13 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 34/50 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 176/226 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 110/336 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 53/389 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 731/1120 variables, 238/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1120 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 517/1637 variables, 223/526 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1637 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 427/2064 variables, 197/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2064 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 291/2355 variables, 150/873 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2355 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 89/2444 variables, 69/942 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2444 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 4/2448 variables, 4/946 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2448 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/2448 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2448/2448 variables, and 946 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1289 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 933/933 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 34/50 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 176/226 variables, 36/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 110/336 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 53/389 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 731/1120 variables, 238/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1120 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 517/1637 variables, 223/530 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1637 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 427/2064 variables, 197/727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2064 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 291/2355 variables, 150/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2355 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 89/2444 variables, 69/946 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2444 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 4/2448 variables, 4/950 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2448 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/2448 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2448/2448 variables, and 950 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1443 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 933/933 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2748ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 1166 steps, including 12 resets, run visited all 1 properties in 4 ms. (steps per millisecond=291 )
Parikh walk visited 4 properties in 102 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (OR p0 (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (OR p2 p1) (OR (NOT p0) p1)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND p2 (NOT p0)))), (F (NOT (AND p2 (NOT p0))))]
Knowledge based reduction with 10 factoid took 311 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) p0), p1, (OR (NOT p2) p0), p0]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) p0), p1, (OR (NOT p2) p0), p0]
Support contains 5 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 1515/1515 transitions.
Graph (trivial) has 964 edges and 933 vertex of which 336 / 933 are part of one of the 40 SCC in 1 ms
Free SCC test removed 296 places
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 336 transitions.
Graph (complete) has 2454 edges and 637 vertex of which 622 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.3 ms
Discarding 15 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 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 0 with 255 rules applied. Total rules applied 257 place count 621 transition count 921
Reduce places removed 255 places and 0 transitions.
Iterating post reduction 1 with 255 rules applied. Total rules applied 512 place count 366 transition count 921
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 512 place count 366 transition count 870
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 614 place count 315 transition count 870
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 615 place count 314 transition count 869
Iterating global reduction 2 with 1 rules applied. Total rules applied 616 place count 314 transition count 869
Performed 100 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 816 place count 214 transition count 768
Performed 29 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 874 place count 185 transition count 869
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 879 place count 185 transition count 864
Drop transitions (Redundant composition of simpler transitions.) removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 3 with 66 rules applied. Total rules applied 945 place count 185 transition count 798
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 953 place count 181 transition count 866
Drop transitions (Redundant composition of simpler transitions.) removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 3 with 64 rules applied. Total rules applied 1017 place count 181 transition count 802
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1018 place count 180 transition count 801
Applied a total of 1018 rules in 115 ms. Remains 180 /933 variables (removed 753) and now considering 801/1515 (removed 714) transitions.
[2024-05-21 22:09:48] [INFO ] Flow matrix only has 597 transitions (discarded 204 similar events)
// Phase 1: matrix 597 rows 180 cols
[2024-05-21 22:09:48] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 22:09:49] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-21 22:09:49] [INFO ] Flow matrix only has 597 transitions (discarded 204 similar events)
[2024-05-21 22:09:49] [INFO ] Invariant cache hit.
[2024-05-21 22:09:49] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 22:09:49] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2024-05-21 22:09:50] [INFO ] Redundant transitions in 588 ms returned []
Running 760 sub problems to find dead transitions.
[2024-05-21 22:09:50] [INFO ] Flow matrix only has 597 transitions (discarded 204 similar events)
[2024-05-21 22:09:50] [INFO ] Invariant cache hit.
[2024-05-21 22:09:50] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (OVERLAPS) 596/771 variables, 175/180 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/771 variables, 30/210 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/771 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 5 (OVERLAPS) 5/776 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 760 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/776 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 776/777 variables, and 215 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 180/180 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (OVERLAPS) 596/771 variables, 175/180 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/771 variables, 30/210 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/771 variables, 37/247 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/771 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 6 (OVERLAPS) 5/776 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 723/975 constraints. Problems are: Problem set: 0 solved, 760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 776/777 variables, and 975 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 180/180 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 0/0 constraints]
After SMT, in 61884ms problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 61892ms
Starting structural reductions in SI_LTL mode, iteration 1 : 180/933 places, 801/1515 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63208 ms. Remains : 180/933 places, 801/1515 transitions.
Computed a total of 52 stabilizing places and 504 stable transitions
Computed a total of 52 stabilizing places and 504 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (AND p2 (NOT p0))), (X (NOT (OR (NOT p2) p0))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1))))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (OR (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 101 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p2) p0), p1, (OR (NOT p2) p0), p0]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (1306 resets) in 779 ms. (51 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (80 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (80 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
[2024-05-21 22:10:52] [INFO ] Flow matrix only has 597 transitions (discarded 204 similar events)
[2024-05-21 22:10:52] [INFO ] Invariant cache hit.
[2024-05-21 22:10:52] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 57/77 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 515/592 variables, 58/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/592 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/601 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 9/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 150/751 variables, 84/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/751 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 25/776 variables, 13/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/776 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/776 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/776 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 776/777 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 219 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 180/180 constraints, ReadFeed: 30/30 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 57/77 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 515/592 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/592 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/592 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/601 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/601 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 150/751 variables, 84/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/751 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 25/776 variables, 13/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/776 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/776 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/776 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 776/777 variables, and 217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 296 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 180/180 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 523ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 25 ms.
Support contains 5 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 801/801 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 180 transition count 743
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 78 place count 170 transition count 823
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 88 place count 170 transition count 813
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 173 place count 170 transition count 728
Free-agglomeration rule applied 49 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 222 place count 170 transition count 659
Reduce places removed 49 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 92 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 127 transitions.
Graph (complete) has 907 edges and 121 vertex of which 120 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 2 with 177 rules applied. Total rules applied 399 place count 120 transition count 532
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 400 place count 120 transition count 531
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 402 place count 118 transition count 519
Iterating global reduction 4 with 2 rules applied. Total rules applied 404 place count 118 transition count 519
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 4 with 75 rules applied. Total rules applied 479 place count 118 transition count 444
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 481 place count 118 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 482 place count 118 transition count 443
Applied a total of 482 rules in 74 ms. Remains 118 /180 variables (removed 62) and now considering 443/801 (removed 358) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 118/180 places, 443/801 transitions.
RANDOM walk for 8377 steps (138 resets) in 21 ms. (380 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (AND p2 (NOT p0))), (X (NOT (OR (NOT p2) p0))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1))))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (OR (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2))), (F p0), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (OR (NOT p0) p1) (OR p2 p1))))]
Knowledge based reduction with 13 factoid took 304 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p2) p0), p1, (OR (NOT p2) p0), p0]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p2) p0), p1, (OR (NOT p2) p0), p0]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) p0), p1, (OR (NOT p2) p0), p0]
Stuttering criterion allowed to conclude after 7203 steps with 216 reset in 46 ms.
FORMULA CloudDeployment-PT-5b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLCardinality-09 finished in 71451 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) U X((!p1&&F(G(p1))))))'
Support contains 4 out of 949 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 949/949 places, 1533/1533 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 934 transition count 1518
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 934 transition count 1518
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 934 transition count 1515
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 930 transition count 1511
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 930 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 929 transition count 1510
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 929 transition count 1510
Applied a total of 43 rules in 86 ms. Remains 929 /949 variables (removed 20) and now considering 1510/1533 (removed 23) transitions.
// Phase 1: matrix 1510 rows 929 cols
[2024-05-21 22:10:54] [INFO ] Computed 14 invariants in 11 ms
[2024-05-21 22:10:54] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-21 22:10:54] [INFO ] Invariant cache hit.
[2024-05-21 22:10:55] [INFO ] Implicit Places using invariants and state equation in 941 ms returned [19, 185, 193, 358, 366, 531, 539, 704, 712]
[2024-05-21 22:10:55] [INFO ] Actually due to overlaps returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1122 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 928/949 places, 1510/1533 transitions.
Applied a total of 0 rules in 20 ms. Remains 928 /928 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1229 ms. Remains : 928/949 places, 1510/1533 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, (NOT p0), true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLCardinality-11
Stuttering criterion allowed to conclude after 197 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-5b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLCardinality-11 finished in 1499 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(p0)||F(X((F((X(!p1) U p2))||G(p2))))))'
Support contains 4 out of 949 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 949/949 places, 1533/1533 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 936 transition count 1520
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 936 transition count 1520
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 936 transition count 1517
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 932 transition count 1513
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 932 transition count 1513
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 931 transition count 1512
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 931 transition count 1512
Applied a total of 39 rules in 85 ms. Remains 931 /949 variables (removed 18) and now considering 1512/1533 (removed 21) transitions.
// Phase 1: matrix 1512 rows 931 cols
[2024-05-21 22:10:55] [INFO ] Computed 14 invariants in 6 ms
[2024-05-21 22:10:55] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-21 22:10:55] [INFO ] Invariant cache hit.
[2024-05-21 22:10:56] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned [18, 184, 192, 359, 367, 532, 540, 705, 713]
[2024-05-21 22:10:56] [INFO ] Actually due to overlaps returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1224 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 930/949 places, 1512/1533 transitions.
Applied a total of 0 rules in 25 ms. Remains 930 /930 variables (removed 0) and now considering 1512/1512 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1336 ms. Remains : 930/949 places, 1512/1533 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-5b-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 438 ms.
Product exploration explored 100000 steps with 50000 reset in 429 ms.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2848 edges and 930 vertex of which 915 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 23 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-5b-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-5b-LTLCardinality-12 finished in 2342 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((X(F(p0))||(p1&&G(p2)))))'
Support contains 6 out of 949 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 949/949 places, 1533/1533 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 936 transition count 1520
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 936 transition count 1520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 936 transition count 1519
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 932 transition count 1515
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 932 transition count 1515
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 931 transition count 1514
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 931 transition count 1514
Applied a total of 37 rules in 94 ms. Remains 931 /949 variables (removed 18) and now considering 1514/1533 (removed 19) transitions.
// Phase 1: matrix 1514 rows 931 cols
[2024-05-21 22:10:58] [INFO ] Computed 14 invariants in 13 ms
[2024-05-21 22:10:58] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-21 22:10:58] [INFO ] Invariant cache hit.
[2024-05-21 22:10:59] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned [18, 185, 193, 358, 366, 531, 539, 704, 714]
[2024-05-21 22:10:59] [INFO ] Actually due to overlaps returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1323 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 930/949 places, 1514/1533 transitions.
Applied a total of 0 rules in 24 ms. Remains 930 /930 variables (removed 0) and now considering 1514/1514 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1441 ms. Remains : 930/949 places, 1514/1533 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-5b-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 308 ms.
Product exploration explored 100000 steps with 33333 reset in 312 ms.
Computed a total of 134 stabilizing places and 474 stable transitions
Graph (complete) has 2850 edges and 930 vertex of which 915 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.11 ms
Computed a total of 134 stabilizing places and 474 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 13 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-5b-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-5b-LTLCardinality-13 finished in 2270 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 3 out of 949 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 949/949 places, 1533/1533 transitions.
Graph (trivial) has 986 edges and 949 vertex of which 356 / 949 are part of one of the 40 SCC in 1 ms
Free SCC test removed 316 places
Ensure Unique test removed 361 transitions
Reduce isomorphic transitions removed 361 transitions.
Graph (complete) has 2472 edges and 633 vertex of which 617 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 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 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 253 rules applied. Total rules applied 255 place count 616 transition count 916
Reduce places removed 253 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 254 rules applied. Total rules applied 509 place count 363 transition count 915
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 510 place count 362 transition count 915
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 510 place count 362 transition count 865
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 610 place count 312 transition count 865
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 618 place count 304 transition count 857
Iterating global reduction 3 with 8 rules applied. Total rules applied 626 place count 304 transition count 857
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 628 place count 304 transition count 855
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 628 place count 304 transition count 854
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 630 place count 303 transition count 854
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 822 place count 207 transition count 758
Performed 25 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 872 place count 182 transition count 833
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 912 place count 182 transition count 793
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 920 place count 178 transition count 861
Drop transitions (Redundant composition of simpler transitions.) removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 4 with 64 rules applied. Total rules applied 984 place count 178 transition count 797
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 985 place count 177 transition count 796
Applied a total of 985 rules in 116 ms. Remains 177 /949 variables (removed 772) and now considering 796/1533 (removed 737) transitions.
[2024-05-21 22:11:00] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
// Phase 1: matrix 612 rows 177 cols
[2024-05-21 22:11:00] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 22:11:00] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-21 22:11:00] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
[2024-05-21 22:11:00] [INFO ] Invariant cache hit.
[2024-05-21 22:11:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 22:11:00] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-05-21 22:11:01] [INFO ] Redundant transitions in 468 ms returned []
Running 755 sub problems to find dead transitions.
[2024-05-21 22:11:01] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
[2024-05-21 22:11:01] [INFO ] Invariant cache hit.
[2024-05-21 22:11:01] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 2 (OVERLAPS) 611/783 variables, 172/177 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 30/207 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 5 (OVERLAPS) 5/788 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/788 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 788/789 variables, and 212 constraints, problems are : Problem set: 0 solved, 755 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 755/755 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 755 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 2 (OVERLAPS) 611/783 variables, 172/177 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 30/207 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 25/232 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/783 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 6 (OVERLAPS) 5/788 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/788 variables, 730/967 constraints. Problems are: Problem set: 0 solved, 755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 788/789 variables, and 967 constraints, problems are : Problem set: 0 solved, 755 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 755/755 constraints, Known Traps: 0/0 constraints]
After SMT, in 62188ms problems are : Problem set: 0 solved, 755 unsolved
Search for dead transitions found 0 dead transitions in 62197ms
Starting structural reductions in SI_LTL mode, iteration 1 : 177/949 places, 796/1533 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63203 ms. Remains : 177/949 places, 796/1533 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLCardinality-15
Product exploration explored 100000 steps with 3081 reset in 340 ms.
Product exploration explored 100000 steps with 3027 reset in 332 ms.
Computed a total of 53 stabilizing places and 504 stable transitions
Computed a total of 53 stabilizing places and 504 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 34328 steps (1119 resets) in 139 ms. (245 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 796/796 transitions.
Applied a total of 0 rules in 17 ms. Remains 177 /177 variables (removed 0) and now considering 796/796 (removed 0) transitions.
[2024-05-21 22:12:04] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
[2024-05-21 22:12:04] [INFO ] Invariant cache hit.
[2024-05-21 22:12:04] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 22:12:04] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
[2024-05-21 22:12:04] [INFO ] Invariant cache hit.
[2024-05-21 22:12:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 22:12:04] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-05-21 22:12:05] [INFO ] Redundant transitions in 427 ms returned []
Running 755 sub problems to find dead transitions.
[2024-05-21 22:12:05] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
[2024-05-21 22:12:05] [INFO ] Invariant cache hit.
[2024-05-21 22:12:05] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 2 (OVERLAPS) 611/783 variables, 172/177 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 30/207 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 5 (OVERLAPS) 5/788 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/788 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 788/789 variables, and 212 constraints, problems are : Problem set: 0 solved, 755 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 755/755 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 755 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 2 (OVERLAPS) 611/783 variables, 172/177 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 30/207 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 25/232 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/783 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 6 (OVERLAPS) 5/788 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/788 variables, 730/967 constraints. Problems are: Problem set: 0 solved, 755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 788/789 variables, and 967 constraints, problems are : Problem set: 0 solved, 755 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 755/755 constraints, Known Traps: 0/0 constraints]
After SMT, in 62097ms problems are : Problem set: 0 solved, 755 unsolved
Search for dead transitions found 0 dead transitions in 62104ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62914 ms. Remains : 177/177 places, 796/796 transitions.
Computed a total of 53 stabilizing places and 504 stable transitions
Computed a total of 53 stabilizing places and 504 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1277 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (79 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1121371 steps, run timeout after 3001 ms. (steps per millisecond=373 ) properties seen :0 out of 1
Probabilistic random walk after 1121371 steps, saw 154629 distinct states, run finished after 3004 ms. (steps per millisecond=373 ) properties seen :0
[2024-05-21 22:13:10] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
[2024-05-21 22:13:10] [INFO ] Invariant cache hit.
[2024-05-21 22:13:10] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 213/223 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 450/673 variables, 102/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/673 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/674 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/674 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/674 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 101/775 variables, 54/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/775 variables, 15/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/775 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/788 variables, 7/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/788 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/788 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/788 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 788/789 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 30/30 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 213/223 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 450/673 variables, 102/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/673 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/673 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/674 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/674 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/674 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 101/775 variables, 54/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/775 variables, 15/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/775 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 13/788 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/788 variables, 10/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/788 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/788 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 788/789 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 194 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 367ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3070 reset in 351 ms.
Product exploration explored 100000 steps with 3068 reset in 338 ms.
Built C files in :
/tmp/ltsmin1798633161868434496
[2024-05-21 22:13:12] [INFO ] Computing symmetric may disable matrix : 796 transitions.
[2024-05-21 22:13:12] [INFO ] Computation of Complete disable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:13:12] [INFO ] Computing symmetric may enable matrix : 796 transitions.
[2024-05-21 22:13:12] [INFO ] Computation of Complete enable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:13:12] [INFO ] Computing Do-Not-Accords matrix : 796 transitions.
[2024-05-21 22:13:12] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:13:12] [INFO ] Built C files in 249ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1798633161868434496
Running compilation step : cd /tmp/ltsmin1798633161868434496;'/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/ltsmin1798633161868434496;'/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/ltsmin1798633161868434496;'/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 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 796/796 transitions.
Applied a total of 0 rules in 16 ms. Remains 177 /177 variables (removed 0) and now considering 796/796 (removed 0) transitions.
[2024-05-21 22:13:15] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
[2024-05-21 22:13:15] [INFO ] Invariant cache hit.
[2024-05-21 22:13:15] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 22:13:15] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
[2024-05-21 22:13:15] [INFO ] Invariant cache hit.
[2024-05-21 22:13:15] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 22:13:15] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-05-21 22:13:16] [INFO ] Redundant transitions in 471 ms returned []
Running 755 sub problems to find dead transitions.
[2024-05-21 22:13:16] [INFO ] Flow matrix only has 612 transitions (discarded 184 similar events)
[2024-05-21 22:13:16] [INFO ] Invariant cache hit.
[2024-05-21 22:13:16] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 2 (OVERLAPS) 611/783 variables, 172/177 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 30/207 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 5 (OVERLAPS) 5/788 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/788 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 788/789 variables, and 212 constraints, problems are : Problem set: 0 solved, 755 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 755/755 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 755 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 2 (OVERLAPS) 611/783 variables, 172/177 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 30/207 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 25/232 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/783 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 6 (OVERLAPS) 5/788 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/788 variables, 730/967 constraints. Problems are: Problem set: 0 solved, 755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 788/789 variables, and 967 constraints, problems are : Problem set: 0 solved, 755 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 755/755 constraints, Known Traps: 0/0 constraints]
After SMT, in 62098ms problems are : Problem set: 0 solved, 755 unsolved
Search for dead transitions found 0 dead transitions in 62106ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62972 ms. Remains : 177/177 places, 796/796 transitions.
Built C files in :
/tmp/ltsmin4533172163615620073
[2024-05-21 22:14:18] [INFO ] Computing symmetric may disable matrix : 796 transitions.
[2024-05-21 22:14:18] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:14:18] [INFO ] Computing symmetric may enable matrix : 796 transitions.
[2024-05-21 22:14:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:14:18] [INFO ] Computing Do-Not-Accords matrix : 796 transitions.
[2024-05-21 22:14:18] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:14:18] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4533172163615620073
Running compilation step : cd /tmp/ltsmin4533172163615620073;'/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'
Compilation finished in 2777 ms.
Running link step : cd /tmp/ltsmin4533172163615620073;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin4533172163615620073;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1189328701886175924.hoa' '--buchi-type=spotba'
LTSmin run took 5641 ms.
FORMULA CloudDeployment-PT-5b-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-5b-LTLCardinality-15 finished in 206942 ms.
All properties solved by simple procedures.
Total runtime 359790 ms.

BK_STOP 1716329667160

--------------------
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-5b"
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-5b, 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-171620506200595"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-5b.tgz
mv CloudDeployment-PT-5b 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 ;