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.r180-tall-171640602400003.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is FlexibleBarrier-PT-04a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602400003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 24K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Apr 13 08:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 13 08:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 08:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Apr 13 08:40 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 23K 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-04a-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716415967278

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 22:12:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 22:12:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:12:48] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-22 22:12:48] [INFO ] Transformed 51 places.
[2024-05-22 22:12:48] [INFO ] Transformed 88 transitions.
[2024-05-22 22:12:48] [INFO ] Found NUPN structural information;
[2024-05-22 22:12:48] [INFO ] Parsed PT model containing 51 places and 88 transitions and 309 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 78/78 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 74
Applied a total of 4 rules in 21 ms. Remains 51 /51 variables (removed 0) and now considering 74/78 (removed 4) transitions.
// Phase 1: matrix 74 rows 51 cols
[2024-05-22 22:12:48] [INFO ] Computed 6 invariants in 11 ms
[2024-05-22 22:12:49] [INFO ] Implicit Places using invariants in 215 ms returned [49, 50]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 247 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/51 places, 74/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 285 ms. Remains : 49/51 places, 74/78 transitions.
Support contains 16 out of 49 places after structural reductions.
[2024-05-22 22:12:49] [INFO ] Flatten gal took : 25 ms
[2024-05-22 22:12:49] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:12:49] [INFO ] Input system was already deterministic with 74 transitions.
RANDOM walk for 599 steps (0 resets) in 84 ms. (7 steps per ms) remains 0/10 properties
Computed a total of 1 stabilizing places and 1 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' '!(X(G(p0)))'
Support contains 2 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 49 cols
[2024-05-22 22:12:49] [INFO ] Computed 4 invariants in 2 ms
[2024-05-22 22:12:49] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 22:12:49] [INFO ] Invariant cache hit.
[2024-05-22 22:12:49] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-22 22:12:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/123 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 102 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1201 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/123 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 73/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 175 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1030 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2278ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2287ms
Finished structural reductions in LTL mode , in 1 iterations and 2378 ms. Remains : 49/49 places, 74/74 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-03 finished in 2680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 74/74 transitions.
Graph (trivial) has 56 edges and 49 vertex of which 35 / 49 are part of one of the 5 SCC in 4 ms
Free SCC test removed 30 places
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 18 edges and 17 vertex of which 2 / 17 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 16 transition count 29
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 14 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 13 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 12 transition count 24
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 12 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 18 place count 12 transition count 22
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 20 place count 11 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 21 place count 10 transition count 21
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 6 with 2 rules applied. Total rules applied 23 place count 9 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 33 place count 9 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 35 place count 9 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 37 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 37 place count 7 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 39 place count 6 transition count 7
Applied a total of 39 rules in 50 ms. Remains 6 /49 variables (removed 43) and now considering 7/74 (removed 67) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-05-22 22:12:52] [INFO ] Computed 3 invariants in 0 ms
[2024-05-22 22:12:52] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-22 22:12:52] [INFO ] Invariant cache hit.
[2024-05-22 22:12:52] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-22 22:12:52] [INFO ] Redundant transitions in 1 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-22 22:12:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 79ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 79ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/49 places, 7/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 6/49 places, 7/74 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-06 finished in 303 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(((X(F(p0))&&G(p1))||G(F(p0)))))'
Support contains 2 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 49 cols
[2024-05-22 22:12:52] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 22:12:52] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 22:12:52] [INFO ] Invariant cache hit.
[2024-05-22 22:12:52] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-22 22:12:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/123 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 102 constraints, problems are : Problem set: 0 solved, 73 unsolved in 786 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/123 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 73/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 175 constraints, problems are : Problem set: 0 solved, 73 unsolved in 833 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 1640ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 1642ms
Finished structural reductions in LTL mode , in 1 iterations and 1720 ms. Remains : 49/49 places, 74/74 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-09
Product exploration explored 100000 steps with 7327 reset in 324 ms.
Stack based approach found an accepted trace after 9033 steps with 638 reset with depth 21 and stack size 21 in 15 ms.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-09 finished in 2194 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(F(p0)))'
Support contains 2 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-22 22:12:54] [INFO ] Invariant cache hit.
[2024-05-22 22:12:54] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 22:12:54] [INFO ] Invariant cache hit.
[2024-05-22 22:12:54] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-22 22:12:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/123 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 102 constraints, problems are : Problem set: 0 solved, 73 unsolved in 741 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/123 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 73/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 175 constraints, problems are : Problem set: 0 solved, 73 unsolved in 800 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 1552ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 1560ms
Finished structural reductions in LTL mode , in 1 iterations and 1637 ms. Remains : 49/49 places, 74/74 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-10
Product exploration explored 100000 steps with 18965 reset in 113 ms.
Stack based approach found an accepted trace after 22 steps with 2 reset with depth 10 and stack size 10 in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-10 finished in 1835 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((G((p0&&X(p1))) U (p2&&X(p3)))))))'
Support contains 7 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-22 22:12:56] [INFO ] Invariant cache hit.
[2024-05-22 22:12:56] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 22:12:56] [INFO ] Invariant cache hit.
[2024-05-22 22:12:56] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-22 22:12:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/123 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 102 constraints, problems are : Problem set: 0 solved, 73 unsolved in 784 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/123 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 73/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 175 constraints, problems are : Problem set: 0 solved, 73 unsolved in 864 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 1657ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 1659ms
Finished structural reductions in LTL mode , in 1 iterations and 1732 ms. Remains : 49/49 places, 74/74 transitions.
Stuttering acceptance computed with spot in 411 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-12
Product exploration explored 100000 steps with 20000 reset in 97 ms.
Product exploration explored 100000 steps with 20000 reset in 94 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 p1 p3)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (8 resets) in 532 ms. (75 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 1/1 properties
[2024-05-22 22:12:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 42/49 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 74/123 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 49/123 variables, and 11 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Domain max(s): 7/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/49 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 75ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1 p3), (G (OR (NOT p0) (NOT p1) p2 p3))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F (NOT (AND p0 p2))), (F (NOT (AND p0 p1))), (F (NOT (AND (OR p0 p3) (OR p1 p3)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 2 factoid took 467 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 496 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Support contains 7 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-22 22:13:01] [INFO ] Invariant cache hit.
[2024-05-22 22:13:01] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 22:13:01] [INFO ] Invariant cache hit.
[2024-05-22 22:13:01] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-22 22:13:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/123 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 102 constraints, problems are : Problem set: 0 solved, 73 unsolved in 787 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/123 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 73/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 175 constraints, problems are : Problem set: 0 solved, 73 unsolved in 837 ms.
Refiners :[Domain max(s): 49/49 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 1637ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 1640ms
Finished structural reductions in LTL mode , in 1 iterations and 1727 ms. Remains : 49/49 places, 74/74 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2 p1 p3)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 121 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 1935 steps (0 resets) in 22 ms. (84 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 p2 p1 p3)]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (AND (OR p0 p3) (OR p1 p3)))), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F (NOT p3)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 396 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 376 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 20000 reset in 89 ms.
Product exploration explored 100000 steps with 20000 reset in 110 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 566 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3)]
Support contains 7 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 74/74 transitions.
Graph (trivial) has 46 edges and 49 vertex of which 29 / 49 are part of one of the 5 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 25 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 25 transition count 43
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 25 transition count 43
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 24 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 24 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 24 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 24 transition count 41
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 23 transition count 40
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 23 transition count 40
Deduced a syphon composed of 6 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 22 place count 23 transition count 31
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 22 rules in 10 ms. Remains 23 /49 variables (removed 26) and now considering 31/74 (removed 43) transitions.
[2024-05-22 22:13:05] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-22 22:13:05] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
// Phase 1: matrix 28 rows 23 cols
[2024-05-22 22:13:05] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 22:13:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-22 22:13:05] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 5 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-22 22:13:05] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-22 22:13:05] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-05-22 22:13:05] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 4/8 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 27/50 variables, 23/31 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/31 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 1/51 variables, 1/32 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/32 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/32 constraints. Problems are: Problem set: 7 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 32 constraints, problems are : Problem set: 7 solved, 23 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 7 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 7/23 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 4/8 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 27/50 variables, 23/31 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 23/54 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/54 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 1/51 variables, 1/55 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/55 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/51 variables, 0/55 constraints. Problems are: Problem set: 7 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 55 constraints, problems are : Problem set: 7 solved, 23 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/30 constraints, Known Traps: 4/4 constraints]
After SMT, in 530ms problems are : Problem set: 7 solved, 23 unsolved
Search for dead transitions found 7 dead transitions in 530ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 23/49 places, 24/74 transitions.
Graph (complete) has 27 edges and 23 vertex of which 17 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 17 /23 variables (removed 6) and now considering 24/24 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/49 places, 24/74 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 550 ms. Remains : 17/49 places, 24/74 transitions.
Built C files in :
/tmp/ltsmin16662722786860442018
[2024-05-22 22:13:06] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16662722786860442018
Running compilation step : cd /tmp/ltsmin16662722786860442018;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 299 ms.
Running link step : cd /tmp/ltsmin16662722786860442018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16662722786860442018;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1867003418437040472.hoa' '--buchi-type=spotba'
LTSmin run took 195 ms.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-12 finished in 10331 ms.
All properties solved by simple procedures.
Total runtime 18385 ms.

BK_STOP 1716415986952

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-04a, 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 r180-tall-171640602400003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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