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.r496-tall-171640602500027.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 ltsminxred
Input is FlexibleBarrier-PT-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602500027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 13 08:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 13 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K 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 FlexibleBarrier-PT-06b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717181878203

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:57:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 18:57:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:57:59] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-31 18:57:59] [INFO ] Transformed 542 places.
[2024-05-31 18:57:59] [INFO ] Transformed 621 transitions.
[2024-05-31 18:57:59] [INFO ] Found NUPN structural information;
[2024-05-31 18:57:59] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 621/621 transitions.
Discarding 181 places :
Symmetric choice reduction at 0 with 181 rule applications. Total rules 181 place count 361 transition count 440
Iterating global reduction 0 with 181 rules applied. Total rules applied 362 place count 361 transition count 440
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 434 place count 289 transition count 368
Iterating global reduction 0 with 72 rules applied. Total rules applied 506 place count 289 transition count 368
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 548 place count 247 transition count 326
Iterating global reduction 0 with 42 rules applied. Total rules applied 590 place count 247 transition count 326
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 608 place count 247 transition count 308
Applied a total of 608 rules in 100 ms. Remains 247 /542 variables (removed 295) and now considering 308/621 (removed 313) transitions.
// Phase 1: matrix 308 rows 247 cols
[2024-05-31 18:57:59] [INFO ] Computed 8 invariants in 22 ms
[2024-05-31 18:58:00] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-31 18:58:00] [INFO ] Invariant cache hit.
[2024-05-31 18:58:00] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-05-31 18:58:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-05-31 18:58:03] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 20 ms to minimize.
[2024-05-31 18:58:03] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-31 18:58:03] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/555 variables, 247/258 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 258 constraints, problems are : Problem set: 0 solved, 307 unsolved in 13644 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/555 variables, 247/258 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 307/565 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-05-31 18:58:17] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 5 ms to minimize.
[2024-05-31 18:58:18] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2024-05-31 18:58:19] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2024-05-31 18:58:20] [INFO ] Deduced a trap composed of 165 places in 71 ms of which 2 ms to minimize.
[2024-05-31 18:58:20] [INFO ] Deduced a trap composed of 167 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 5/570 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-05-31 18:58:22] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-31 18:58:23] [INFO ] Deduced a trap composed of 114 places in 82 ms of which 1 ms to minimize.
[2024-05-31 18:58:23] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-05-31 18:58:24] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-05-31 18:58:25] [INFO ] Deduced a trap composed of 169 places in 71 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 5/575 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-05-31 18:58:33] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/555 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-05-31 18:58:39] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-31 18:58:39] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 2/578 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 578 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 16/16 constraints]
After SMT, in 43804ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 43818ms
Starting structural reductions in LTL mode, iteration 1 : 247/542 places, 308/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44422 ms. Remains : 247/542 places, 308/621 transitions.
Support contains 21 out of 247 places after structural reductions.
[2024-05-31 18:58:44] [INFO ] Flatten gal took : 47 ms
[2024-05-31 18:58:44] [INFO ] Flatten gal took : 30 ms
[2024-05-31 18:58:44] [INFO ] Input system was already deterministic with 308 transitions.
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (755 resets) in 934 ms. (42 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (112 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (116 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (118 resets) in 140 ms. (283 steps per ms) remains 2/3 properties
[2024-05-31 18:58:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 102/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 141/247 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 308/555 variables, 247/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/555 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 255 constraints, problems are : Problem set: 0 solved, 2 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 247/247 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 102/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 141/247 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 308/555 variables, 247/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:58:45] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 258 constraints, problems are : Problem set: 0 solved, 2 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 534ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 90 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=22 )
Parikh walk visited 2 properties in 14 ms.
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 9 stabilizing places and 9 stable transitions
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 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 308/308 transitions.
Graph (trivial) has 223 edges and 247 vertex of which 37 / 247 are part of one of the 6 SCC in 6 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 215 transition count 243
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 183 transition count 243
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 65 place count 183 transition count 229
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 93 place count 169 transition count 229
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 114 place count 148 transition count 208
Iterating global reduction 2 with 21 rules applied. Total rules applied 135 place count 148 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 138 place count 148 transition count 205
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 148 transition count 204
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 147 transition count 204
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 144 place count 143 transition count 200
Iterating global reduction 3 with 4 rules applied. Total rules applied 148 place count 143 transition count 200
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 152 place count 143 transition count 196
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 226 place count 106 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 232 place count 106 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 234 place count 104 transition count 151
Applied a total of 234 rules in 109 ms. Remains 104 /247 variables (removed 143) and now considering 151/308 (removed 157) transitions.
[2024-05-31 18:58:45] [INFO ] Flow matrix only has 140 transitions (discarded 11 similar events)
// Phase 1: matrix 140 rows 104 cols
[2024-05-31 18:58:45] [INFO ] Computed 8 invariants in 3 ms
[2024-05-31 18:58:45] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 18:58:45] [INFO ] Flow matrix only has 140 transitions (discarded 11 similar events)
[2024-05-31 18:58:45] [INFO ] Invariant cache hit.
[2024-05-31 18:58:45] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-31 18:58:45] [INFO ] Redundant transitions in 4 ms returned []
Running 83 sub problems to find dead transitions.
[2024-05-31 18:58:45] [INFO ] Flow matrix only has 140 transitions (discarded 11 similar events)
[2024-05-31 18:58:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 6/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-31 18:58:46] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-05-31 18:58:46] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 139/243 variables, 104/114 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/244 variables, and 114 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1815 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 6/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 139/243 variables, 104/114 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 83/197 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/243 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/244 variables, and 197 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1978 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 2/2 constraints]
After SMT, in 3829ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 3831ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/247 places, 151/308 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4131 ms. Remains : 104/247 places, 151/308 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLCardinality-06 finished in 4336 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(X(F(p0)))))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 308/308 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 234 transition count 295
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 234 transition count 295
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 234 transition count 292
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 228 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 228 transition count 286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 228 transition count 284
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 226 transition count 282
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 226 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 226 transition count 280
Applied a total of 49 rules in 21 ms. Remains 226 /247 variables (removed 21) and now considering 280/308 (removed 28) transitions.
// Phase 1: matrix 280 rows 226 cols
[2024-05-31 18:58:49] [INFO ] Computed 8 invariants in 2 ms
[2024-05-31 18:58:50] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 18:58:50] [INFO ] Invariant cache hit.
[2024-05-31 18:58:50] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2024-05-31 18:58:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 280/506 variables, 226/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (OVERLAPS) 0/506 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 234 constraints, problems are : Problem set: 0 solved, 279 unsolved in 8351 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 280/506 variables, 226/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 279/513 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-31 18:59:01] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2024-05-31 18:59:02] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2024-05-31 18:59:02] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 2 ms to minimize.
[2024-05-31 18:59:02] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-31 18:59:03] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-31 18:59:03] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-05-31 18:59:04] [INFO ] Deduced a trap composed of 158 places in 65 ms of which 2 ms to minimize.
[2024-05-31 18:59:04] [INFO ] Deduced a trap composed of 158 places in 65 ms of which 1 ms to minimize.
[2024-05-31 18:59:04] [INFO ] Deduced a trap composed of 158 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 9/522 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-31 18:59:10] [INFO ] Deduced a trap composed of 105 places in 79 ms of which 2 ms to minimize.
[2024-05-31 18:59:10] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/506 variables, 2/524 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-31 18:59:17] [INFO ] Deduced a trap composed of 158 places in 73 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 10 (OVERLAPS) 0/506 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 525 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 12/12 constraints]
After SMT, in 38429ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 38432ms
Starting structural reductions in LTL mode, iteration 1 : 226/247 places, 280/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38652 ms. Remains : 226/247 places, 280/308 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLCardinality-07
Product exploration explored 100000 steps with 25000 reset in 205 ms.
Product exploration explored 100000 steps with 25000 reset in 118 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (718 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (113 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 481695 steps, run visited all 1 properties in 826 ms. (steps per millisecond=583 )
Probabilistic random walk after 481695 steps, saw 132430 distinct states, run finished after 830 ms. (steps per millisecond=580 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 280/280 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-05-31 18:59:30] [INFO ] Invariant cache hit.
[2024-05-31 18:59:30] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 18:59:30] [INFO ] Invariant cache hit.
[2024-05-31 18:59:30] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2024-05-31 18:59:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 280/506 variables, 226/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (OVERLAPS) 0/506 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 234 constraints, problems are : Problem set: 0 solved, 279 unsolved in 8482 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 280/506 variables, 226/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 279/513 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-31 18:59:42] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 2 ms to minimize.
[2024-05-31 18:59:42] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-05-31 18:59:43] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-31 18:59:43] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 4 ms to minimize.
[2024-05-31 18:59:44] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-05-31 18:59:44] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-05-31 18:59:44] [INFO ] Deduced a trap composed of 158 places in 68 ms of which 4 ms to minimize.
[2024-05-31 18:59:44] [INFO ] Deduced a trap composed of 158 places in 64 ms of which 1 ms to minimize.
[2024-05-31 18:59:44] [INFO ] Deduced a trap composed of 158 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 9/522 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-31 18:59:51] [INFO ] Deduced a trap composed of 105 places in 81 ms of which 2 ms to minimize.
[2024-05-31 18:59:51] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/506 variables, 2/524 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-31 18:59:58] [INFO ] Deduced a trap composed of 158 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 10 (OVERLAPS) 0/506 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 525 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 12/12 constraints]
After SMT, in 38548ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 38551ms
Finished structural reductions in LTL mode , in 1 iterations and 38754 ms. Remains : 226/226 places, 280/280 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (729 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (115 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 481695 steps, run visited all 1 properties in 770 ms. (steps per millisecond=625 )
Probabilistic random walk after 481695 steps, saw 132430 distinct states, run finished after 770 ms. (steps per millisecond=625 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 88 ms.
Product exploration explored 100000 steps with 25000 reset in 91 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 280/280 transitions.
Graph (trivial) has 202 edges and 226 vertex of which 37 / 226 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 195 transition count 248
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 25 place count 195 transition count 248
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 41 place count 195 transition count 248
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 68 place count 168 transition count 221
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 95 place count 168 transition count 221
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 168 transition count 231
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 145 place count 152 transition count 215
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 161 place count 152 transition count 215
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 167 place count 152 transition count 227
Deduced a syphon composed of 48 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 179 place count 152 transition count 215
Deduced a syphon composed of 48 places in 0 ms
Applied a total of 179 rules in 52 ms. Remains 152 /226 variables (removed 74) and now considering 215/280 (removed 65) transitions.
[2024-05-31 19:00:11] [INFO ] Redundant transitions in 7 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-31 19:00:11] [INFO ] Flow matrix only has 204 transitions (discarded 11 similar events)
// Phase 1: matrix 204 rows 152 cols
[2024-05-31 19:00:11] [INFO ] Computed 8 invariants in 2 ms
[2024-05-31 19:00:11] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 19:00:12] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
[2024-05-31 19:00:12] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
[2024-05-31 19:00:13] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
[2024-05-31 19:00:13] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-05-31 19:00:13] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
[2024-05-31 19:00:13] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
[2024-05-31 19:00:13] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
[2024-05-31 19:00:13] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
Problem TDEAD176 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD212 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 8/16 constraints. Problems are: Problem set: 64 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/16 constraints. Problems are: Problem set: 64 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 203/355 variables, 152/168 constraints. Problems are: Problem set: 64 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 45/213 constraints. Problems are: Problem set: 64 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/213 constraints. Problems are: Problem set: 64 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/356 variables, 1/214 constraints. Problems are: Problem set: 64 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/214 constraints. Problems are: Problem set: 64 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/356 variables, 0/214 constraints. Problems are: Problem set: 64 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 214 constraints, problems are : Problem set: 64 solved, 150 unsolved in 6468 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 64 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 64 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 49/152 variables, 8/8 constraints. Problems are: Problem set: 64 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 8/16 constraints. Problems are: Problem set: 64 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/16 constraints. Problems are: Problem set: 64 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 203/355 variables, 152/168 constraints. Problems are: Problem set: 64 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 45/213 constraints. Problems are: Problem set: 64 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 150/363 constraints. Problems are: Problem set: 64 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/363 constraints. Problems are: Problem set: 64 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 1/356 variables, 1/364 constraints. Problems are: Problem set: 64 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/364 constraints. Problems are: Problem set: 64 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/356 variables, 0/364 constraints. Problems are: Problem set: 64 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 364 constraints, problems are : Problem set: 64 solved, 150 unsolved in 7150 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 150/214 constraints, Known Traps: 8/8 constraints]
After SMT, in 13686ms problems are : Problem set: 64 solved, 150 unsolved
Search for dead transitions found 64 dead transitions in 13688ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 152/226 places, 151/280 transitions.
Graph (complete) has 403 edges and 152 vertex of which 104 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.4 ms
Discarding 48 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 104 /152 variables (removed 48) and now considering 151/151 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 104/226 places, 151/280 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13772 ms. Remains : 104/226 places, 151/280 transitions.
Support contains 2 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 280/280 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 280/280 (removed 0) transitions.
// Phase 1: matrix 280 rows 226 cols
[2024-05-31 19:00:25] [INFO ] Computed 8 invariants in 3 ms
[2024-05-31 19:00:25] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 19:00:25] [INFO ] Invariant cache hit.
[2024-05-31 19:00:25] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2024-05-31 19:00:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 280/506 variables, 226/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (OVERLAPS) 0/506 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 234 constraints, problems are : Problem set: 0 solved, 279 unsolved in 8563 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 280/506 variables, 226/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 279/513 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-31 19:00:37] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:00:37] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-05-31 19:00:38] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 2 ms to minimize.
[2024-05-31 19:00:38] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-31 19:00:38] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 3 ms to minimize.
[2024-05-31 19:00:39] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-31 19:00:39] [INFO ] Deduced a trap composed of 158 places in 68 ms of which 1 ms to minimize.
[2024-05-31 19:00:39] [INFO ] Deduced a trap composed of 158 places in 70 ms of which 1 ms to minimize.
[2024-05-31 19:00:39] [INFO ] Deduced a trap composed of 158 places in 64 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 9/522 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-31 19:00:45] [INFO ] Deduced a trap composed of 105 places in 71 ms of which 1 ms to minimize.
[2024-05-31 19:00:46] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/506 variables, 2/524 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-31 19:00:53] [INFO ] Deduced a trap composed of 158 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 10 (OVERLAPS) 0/506 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 525 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 12/12 constraints]
After SMT, in 38626ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 38629ms
Finished structural reductions in LTL mode , in 1 iterations and 38845 ms. Remains : 226/226 places, 280/280 transitions.
Treatment of property FlexibleBarrier-PT-06b-LTLCardinality-07 finished in 134330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 4 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 308/308 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 236 transition count 297
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 236 transition count 297
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 236 transition count 294
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 233 transition count 291
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 233 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 233 transition count 289
Applied a total of 33 rules in 16 ms. Remains 233 /247 variables (removed 14) and now considering 289/308 (removed 19) transitions.
// Phase 1: matrix 289 rows 233 cols
[2024-05-31 19:01:04] [INFO ] Computed 8 invariants in 1 ms
[2024-05-31 19:01:04] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-31 19:01:04] [INFO ] Invariant cache hit.
[2024-05-31 19:01:04] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2024-05-31 19:01:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-31 19:01:06] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/522 variables, 233/242 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (OVERLAPS) 0/522 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 242 constraints, problems are : Problem set: 0 solved, 288 unsolved in 11280 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/522 variables, 233/242 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 288/530 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-31 19:01:23] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/522 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-31 19:01:34] [INFO ] Deduced a trap composed of 160 places in 59 ms of which 2 ms to minimize.
[2024-05-31 19:01:34] [INFO ] Deduced a trap composed of 161 places in 71 ms of which 1 ms to minimize.
[2024-05-31 19:01:34] [INFO ] Deduced a trap composed of 160 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/522 variables, 3/534 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-31 19:01:39] [INFO ] Deduced a trap composed of 164 places in 72 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/522 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-31 19:01:43] [INFO ] Deduced a trap composed of 160 places in 74 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/522 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/522 variables, and 536 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 7/7 constraints]
After SMT, in 41354ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 41357ms
Starting structural reductions in LTL mode, iteration 1 : 233/247 places, 289/308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41631 ms. Remains : 233/247 places, 289/308 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLCardinality-09 finished in 41789 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||G(p1)))))'
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 308/308 transitions.
Graph (trivial) has 223 edges and 247 vertex of which 37 / 247 are part of one of the 6 SCC in 2 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 215 transition count 243
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 183 transition count 243
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 65 place count 183 transition count 230
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 91 place count 170 transition count 230
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 114 place count 147 transition count 207
Iterating global reduction 2 with 23 rules applied. Total rules applied 137 place count 147 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 140 place count 147 transition count 204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 140 place count 147 transition count 203
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 146 transition count 203
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 146 place count 142 transition count 199
Iterating global reduction 3 with 4 rules applied. Total rules applied 150 place count 142 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 153 place count 142 transition count 196
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 227 place count 105 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 233 place count 105 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 103 transition count 151
Applied a total of 235 rules in 45 ms. Remains 103 /247 variables (removed 144) and now considering 151/308 (removed 157) transitions.
[2024-05-31 19:01:46] [INFO ] Flow matrix only has 141 transitions (discarded 10 similar events)
// Phase 1: matrix 141 rows 103 cols
[2024-05-31 19:01:46] [INFO ] Computed 8 invariants in 1 ms
[2024-05-31 19:01:46] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 19:01:46] [INFO ] Flow matrix only has 141 transitions (discarded 10 similar events)
[2024-05-31 19:01:46] [INFO ] Invariant cache hit.
[2024-05-31 19:01:46] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-31 19:01:46] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-31 19:01:46] [INFO ] Flow matrix only has 141 transitions (discarded 10 similar events)
[2024-05-31 19:01:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 140/243 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/244 variables, and 111 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1412 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 140/243 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 82/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/244 variables, and 193 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1526 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
After SMT, in 2964ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 2965ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/247 places, 151/308 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3147 ms. Remains : 103/247 places, 151/308 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLCardinality-13
Stuttering criterion allowed to conclude after 73 steps with 5 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLCardinality-13 finished in 3289 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))||G(p1)))'
Support contains 4 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 308/308 transitions.
Graph (trivial) has 223 edges and 247 vertex of which 37 / 247 are part of one of the 6 SCC in 0 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 215 transition count 242
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 182 transition count 242
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 67 place count 182 transition count 228
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 95 place count 168 transition count 228
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 116 place count 147 transition count 207
Iterating global reduction 2 with 21 rules applied. Total rules applied 137 place count 147 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 147 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 147 transition count 205
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 146 transition count 205
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 144 place count 142 transition count 201
Iterating global reduction 3 with 4 rules applied. Total rules applied 148 place count 142 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 152 place count 142 transition count 197
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 224 place count 106 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 230 place count 106 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 231 place count 106 transition count 155
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 104 transition count 153
Applied a total of 233 rules in 80 ms. Remains 104 /247 variables (removed 143) and now considering 153/308 (removed 155) transitions.
[2024-05-31 19:01:49] [INFO ] Flow matrix only has 142 transitions (discarded 11 similar events)
// Phase 1: matrix 142 rows 104 cols
[2024-05-31 19:01:49] [INFO ] Computed 8 invariants in 1 ms
[2024-05-31 19:01:49] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 19:01:49] [INFO ] Flow matrix only has 142 transitions (discarded 11 similar events)
[2024-05-31 19:01:49] [INFO ] Invariant cache hit.
[2024-05-31 19:01:49] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-31 19:01:49] [INFO ] Redundant transitions in 1 ms returned []
Running 83 sub problems to find dead transitions.
[2024-05-31 19:01:49] [INFO ] Flow matrix only has 142 transitions (discarded 11 similar events)
[2024-05-31 19:01:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 6/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 141/245 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/245 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/246 variables, and 112 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1439 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 6/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 141/245 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 83/195 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/245 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/246 variables, and 195 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1555 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 3016ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 3017ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/247 places, 153/308 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3264 ms. Remains : 104/247 places, 153/308 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLCardinality-14
Product exploration explored 100000 steps with 7841 reset in 297 ms.
Product exploration explored 100000 steps with 7776 reset in 252 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3303 resets) in 486 ms. (82 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (158 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1073921 steps, run visited all 1 properties in 1061 ms. (steps per millisecond=1012 )
Probabilistic random walk after 1073921 steps, saw 225115 distinct states, run finished after 1061 ms. (steps per millisecond=1012 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 221 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 153/153 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 153/153 (removed 0) transitions.
[2024-05-31 19:01:55] [INFO ] Flow matrix only has 142 transitions (discarded 11 similar events)
[2024-05-31 19:01:55] [INFO ] Invariant cache hit.
[2024-05-31 19:01:55] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 19:01:55] [INFO ] Flow matrix only has 142 transitions (discarded 11 similar events)
[2024-05-31 19:01:55] [INFO ] Invariant cache hit.
[2024-05-31 19:01:55] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-31 19:01:55] [INFO ] Redundant transitions in 1 ms returned []
Running 83 sub problems to find dead transitions.
[2024-05-31 19:01:55] [INFO ] Flow matrix only has 142 transitions (discarded 11 similar events)
[2024-05-31 19:01:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 6/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 141/245 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/245 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/246 variables, and 112 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1330 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 6/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 141/245 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 83/195 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/245 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/246 variables, and 195 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1497 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 2847ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 2847ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2987 ms. Remains : 104/104 places, 153/153 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 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 (3292 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (154 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1073921 steps, run visited all 1 properties in 1031 ms. (steps per millisecond=1041 )
Probabilistic random walk after 1073921 steps, saw 225115 distinct states, run finished after 1031 ms. (steps per millisecond=1041 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7810 reset in 194 ms.
Product exploration explored 100000 steps with 7841 reset in 201 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 153/153 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 102 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 102 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 102 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 101 transition count 149
Applied a total of 7 rules in 8 ms. Remains 101 /104 variables (removed 3) and now considering 149/153 (removed 4) transitions.
[2024-05-31 19:02:00] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
// Phase 1: matrix 138 rows 101 cols
[2024-05-31 19:02:00] [INFO ] Computed 8 invariants in 2 ms
[2024-05-31 19:02:00] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 19:02:00] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2024-05-31 19:02:00] [INFO ] Invariant cache hit.
[2024-05-31 19:02:00] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-31 19:02:00] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-31 19:02:00] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2024-05-31 19:02:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 6/101 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 137/238 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/238 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/239 variables, and 109 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1301 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 6/101 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 137/238 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 80/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/238 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/239 variables, and 189 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1472 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 2794ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 2796ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/104 places, 149/153 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2958 ms. Remains : 101/104 places, 149/153 transitions.
Treatment of property FlexibleBarrier-PT-06b-LTLCardinality-14 finished in 13768 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 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 308/308 transitions.
Graph (trivial) has 224 edges and 247 vertex of which 37 / 247 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 215 transition count 241
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 181 transition count 241
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 69 place count 181 transition count 228
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 95 place count 168 transition count 228
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 116 place count 147 transition count 207
Iterating global reduction 2 with 21 rules applied. Total rules applied 137 place count 147 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 140 place count 147 transition count 204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 140 place count 147 transition count 203
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 146 transition count 203
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 145 place count 143 transition count 200
Iterating global reduction 3 with 3 rules applied. Total rules applied 148 place count 143 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 150 place count 143 transition count 198
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 224 place count 106 transition count 161
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 225 place count 105 transition count 160
Iterating global reduction 4 with 1 rules applied. Total rules applied 226 place count 105 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 227 place count 105 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 233 place count 105 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 103 transition count 151
Applied a total of 235 rules in 29 ms. Remains 103 /247 variables (removed 144) and now considering 151/308 (removed 157) transitions.
[2024-05-31 19:02:03] [INFO ] Flow matrix only has 140 transitions (discarded 11 similar events)
// Phase 1: matrix 140 rows 103 cols
[2024-05-31 19:02:03] [INFO ] Computed 8 invariants in 1 ms
[2024-05-31 19:02:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 19:02:03] [INFO ] Flow matrix only has 140 transitions (discarded 11 similar events)
[2024-05-31 19:02:03] [INFO ] Invariant cache hit.
[2024-05-31 19:02:03] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-31 19:02:03] [INFO ] Redundant transitions in 0 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-31 19:02:03] [INFO ] Flow matrix only has 140 transitions (discarded 11 similar events)
[2024-05-31 19:02:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 0/242 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/243 variables, and 111 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1295 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 82/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-31 19:02:05] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/243 variables, and 194 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2002 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 1/1 constraints]
After SMT, in 3318ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3319ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/247 places, 151/308 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3491 ms. Remains : 103/247 places, 151/308 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLCardinality-15 finished in 3544 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(X(F(p0)))))'
Found a Shortening insensitive property : FlexibleBarrier-PT-06b-LTLCardinality-07
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 247/247 places, 308/308 transitions.
Graph (trivial) has 223 edges and 247 vertex of which 37 / 247 are part of one of the 6 SCC in 0 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 215 transition count 242
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 182 transition count 242
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 67 place count 182 transition count 228
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 95 place count 168 transition count 228
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 118 place count 145 transition count 205
Iterating global reduction 2 with 23 rules applied. Total rules applied 141 place count 145 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 144 place count 145 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 144 place count 145 transition count 201
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 144 transition count 201
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 150 place count 140 transition count 197
Iterating global reduction 3 with 4 rules applied. Total rules applied 154 place count 140 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 158 place count 140 transition count 193
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 228 place count 105 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 234 place count 105 transition count 152
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 235 place count 105 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 237 place count 103 transition count 150
Applied a total of 237 rules in 25 ms. Remains 103 /247 variables (removed 144) and now considering 150/308 (removed 158) transitions.
[2024-05-31 19:02:06] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
// Phase 1: matrix 139 rows 103 cols
[2024-05-31 19:02:06] [INFO ] Computed 8 invariants in 0 ms
[2024-05-31 19:02:06] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 19:02:06] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2024-05-31 19:02:06] [INFO ] Invariant cache hit.
[2024-05-31 19:02:07] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-31 19:02:07] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2024-05-31 19:02:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 138/241 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 0/241 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/242 variables, and 111 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1374 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 138/241 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 82/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/241 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/242 variables, and 193 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1479 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
After SMT, in 2871ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 2872ms
Starting structural reductions in LI_LTL mode, iteration 1 : 103/247 places, 150/308 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3028 ms. Remains : 103/247 places, 150/308 transitions.
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLCardinality-07
Product exploration explored 100000 steps with 25000 reset in 310 ms.
Product exploration explored 100000 steps with 25000 reset in 311 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3281 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (163 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 496204 steps, run visited all 1 properties in 478 ms. (steps per millisecond=1038 )
Probabilistic random walk after 496204 steps, saw 101899 distinct states, run finished after 478 ms. (steps per millisecond=1038 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 150/150 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-05-31 19:02:11] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2024-05-31 19:02:11] [INFO ] Invariant cache hit.
[2024-05-31 19:02:11] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 19:02:11] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2024-05-31 19:02:11] [INFO ] Invariant cache hit.
[2024-05-31 19:02:11] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-31 19:02:11] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2024-05-31 19:02:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 138/241 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 0/241 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/242 variables, and 111 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1379 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 138/241 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 82/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/241 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/242 variables, and 193 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1471 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
After SMT, in 2879ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 2880ms
Finished structural reductions in LTL mode , in 1 iterations and 3026 ms. Remains : 103/103 places, 150/150 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3266 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (163 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 496204 steps, run visited all 1 properties in 481 ms. (steps per millisecond=1031 )
Probabilistic random walk after 496204 steps, saw 101899 distinct states, run finished after 481 ms. (steps per millisecond=1031 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 202 ms.
Product exploration explored 100000 steps with 25000 reset in 211 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 150/150 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-05-31 19:02:16] [INFO ] Redundant transitions in 0 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-31 19:02:16] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2024-05-31 19:02:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 138/241 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 0/241 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/242 variables, and 111 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 138/241 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 82/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/241 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/242 variables, and 193 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1423 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
After SMT, in 2799ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 2801ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2812 ms. Remains : 103/103 places, 150/150 transitions.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 150/150 transitions.
Applied a total of 0 rules in 0 ms. Remains 103 /103 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-05-31 19:02:19] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2024-05-31 19:02:19] [INFO ] Invariant cache hit.
[2024-05-31 19:02:19] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 19:02:19] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2024-05-31 19:02:19] [INFO ] Invariant cache hit.
[2024-05-31 19:02:19] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-31 19:02:19] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2024-05-31 19:02:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 138/241 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 0/241 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/242 variables, and 111 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1364 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 138/241 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 82/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/241 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/242 variables, and 193 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1458 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
After SMT, in 2841ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 2841ms
Finished structural reductions in LTL mode , in 1 iterations and 2974 ms. Remains : 103/103 places, 150/150 transitions.
Treatment of property FlexibleBarrier-PT-06b-LTLCardinality-07 finished in 15796 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))||G(p1)))'
[2024-05-31 19:02:22] [INFO ] Flatten gal took : 18 ms
[2024-05-31 19:02:22] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-31 19:02:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 247 places, 308 transitions and 835 arcs took 4 ms.
Total runtime 263255 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717182143007

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name FlexibleBarrier-PT-06b-LTLCardinality-07
ltl formula formula --ltl=/tmp/1495/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 247 places, 308 transitions and 835 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1495/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1495/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1495/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1495/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 249 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 248, there are 315 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 9
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 4
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 20
pnml2lts-mc( 0/ 4): - cum. max stack depth: 13
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20 states 29 transitions, fanout: 1.450
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 65.8 B/state, compr.: 6.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 311 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name FlexibleBarrier-PT-06b-LTLCardinality-14
ltl formula formula --ltl=/tmp/1495/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 247 places, 308 transitions and 835 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1495/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1495/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1495/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1495/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 249 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 248, there are 338 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~86!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 659
pnml2lts-mc( 0/ 4): unique states count: 1338
pnml2lts-mc( 0/ 4): unique transitions count: 3133
pnml2lts-mc( 0/ 4): - self-loop count: 223
pnml2lts-mc( 0/ 4): - claim dead count: 481
pnml2lts-mc( 0/ 4): - claim found count: 302
pnml2lts-mc( 0/ 4): - claim success count: 1347
pnml2lts-mc( 0/ 4): - cum. max stack depth: 311
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1347 states 3155 transitions, fanout: 2.342
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 67350, Transitions per second: 157750
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 16.2 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 311 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="FlexibleBarrier-PT-06b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FlexibleBarrier-PT-06b, 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 r496-tall-171640602500027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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