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-171640602600099.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-16a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602600099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.6K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 11:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 11:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 10:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 10:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 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 214K 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-16a-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-16a-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-16a-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-16a-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-16a-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-16a-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-16a-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-16a-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-16a-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-16a-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-16a-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-16a-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-16a-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-16a-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-16a-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-16a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717182983163

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-16a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:16:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:16:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:16:24] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-05-31 19:16:24] [INFO ] Transformed 195 places.
[2024-05-31 19:16:24] [INFO ] Transformed 724 transitions.
[2024-05-31 19:16:24] [INFO ] Found NUPN structural information;
[2024-05-31 19:16:24] [INFO ] Parsed PT model containing 195 places and 724 transitions and 3489 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 226 transitions
Reduce redundant transitions removed 226 transitions.
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 498/498 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 195 transition count 482
Applied a total of 16 rules in 34 ms. Remains 195 /195 variables (removed 0) and now considering 482/498 (removed 16) transitions.
// Phase 1: matrix 482 rows 195 cols
[2024-05-31 19:16:24] [INFO ] Computed 18 invariants in 19 ms
[2024-05-31 19:16:25] [INFO ] Implicit Places using invariants in 440 ms returned [193, 194]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 481 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/195 places, 482/498 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 540 ms. Remains : 193/195 places, 482/498 transitions.
Support contains 24 out of 193 places after structural reductions.
[2024-05-31 19:16:25] [INFO ] Flatten gal took : 51 ms
[2024-05-31 19:16:25] [INFO ] Flatten gal took : 25 ms
[2024-05-31 19:16:25] [INFO ] Input system was already deterministic with 482 transitions.
RANDOM walk for 6361 steps (0 resets) in 321 ms. (19 steps per ms) remains 0/17 properties
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(G((F(p1)||p0)))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 482/482 transitions.
Graph (trivial) has 246 edges and 193 vertex of which 175 / 193 are part of one of the 17 SCC in 2 ms
Free SCC test removed 158 places
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 35 transition count 175
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 31 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 30 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 30 transition count 173
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 2 with 2 rules applied. Total rules applied 13 place count 30 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 29 transition count 171
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 18 place count 27 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 137 transitions
Redundant transition composition rules discarded 137 transitions
Iterating global reduction 4 with 137 rules applied. Total rules applied 155 place count 27 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 157 place count 27 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 159 place count 25 transition count 30
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 170 place count 14 transition count 19
Iterating global reduction 6 with 11 rules applied. Total rules applied 181 place count 14 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 182 place count 14 transition count 19
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 183 place count 13 transition count 18
Iterating global reduction 6 with 1 rules applied. Total rules applied 184 place count 13 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 13 transition count 17
Applied a total of 185 rules in 55 ms. Remains 13 /193 variables (removed 180) and now considering 17/482 (removed 465) transitions.
[2024-05-31 19:16:26] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 13 cols
[2024-05-31 19:16:26] [INFO ] Computed 5 invariants in 1 ms
[2024-05-31 19:16:26] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 19:16:26] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2024-05-31 19:16:26] [INFO ] Invariant cache hit.
[2024-05-31 19:16:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:16:26] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-31 19:16:26] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-31 19:16:26] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2024-05-31 19:16:26] [INFO ] Invariant cache hit.
[2024-05-31 19:16:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 12/25 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/26 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 19 constraints, problems are : Problem set: 0 solved, 16 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 12/25 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 1/26 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/26 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 35 constraints, problems are : Problem set: 0 solved, 16 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 482ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 487ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/193 places, 17/482 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 652 ms. Remains : 13/193 places, 17/482 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-16a-LTLCardinality-00
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16a-LTLCardinality-00 finished in 893 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((G(F(p1))||G(p2)))&&p0)))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 482/482 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 193 cols
[2024-05-31 19:16:26] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 19:16:26] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 19:16:26] [INFO ] Invariant cache hit.
[2024-05-31 19:16:27] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2024-05-31 19:16:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 16/208 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/675 variables, 193/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (OVERLAPS) 0/675 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 402 constraints, problems are : Problem set: 0 solved, 481 unsolved in 16702 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 16/208 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/675 variables, 193/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 481/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 0/675 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Int declared 675/675 variables, and 883 constraints, problems are : Problem set: 0 solved, 481 unsolved in 22499 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
After SMT, in 39607ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 39629ms
Finished structural reductions in LTL mode , in 1 iterations and 39819 ms. Remains : 193/193 places, 482/482 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-16a-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16a-LTLCardinality-01 finished in 40031 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(X(p0)) U p1)))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 482/482 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2024-05-31 19:17:06] [INFO ] Invariant cache hit.
[2024-05-31 19:17:06] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 19:17:06] [INFO ] Invariant cache hit.
[2024-05-31 19:17:07] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2024-05-31 19:17:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 16/208 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/675 variables, 193/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (OVERLAPS) 0/675 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 402 constraints, problems are : Problem set: 0 solved, 481 unsolved in 16164 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 16/208 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/675 variables, 193/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 481/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 0/675 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Int declared 675/675 variables, and 883 constraints, problems are : Problem set: 0 solved, 481 unsolved in 22001 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
After SMT, in 38455ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 38461ms
Finished structural reductions in LTL mode , in 1 iterations and 38657 ms. Remains : 193/193 places, 482/482 transitions.
Stuttering acceptance computed with spot in 198 ms :[p0, (NOT p1), true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : FlexibleBarrier-PT-16a-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 665 ms.
Product exploration explored 100000 steps with 50000 reset in 425 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 (NOT p0) p1), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 19 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16a-LTLCardinality-02 finished in 40004 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 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 482/482 transitions.
Graph (trivial) has 253 edges and 193 vertex of which 188 / 193 are part of one of the 16 SCC in 0 ms
Free SCC test removed 172 places
Ensure Unique test removed 339 transitions
Reduce isomorphic transitions removed 339 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 134 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 150 rules applied. Total rules applied 151 place count 5 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 153 place count 4 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 3 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 156 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 157 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 2 transition count 3
Applied a total of 158 rules in 4 ms. Remains 2 /193 variables (removed 191) and now considering 3/482 (removed 479) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-31 19:17:46] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 19:17:46] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-31 19:17:46] [INFO ] Invariant cache hit.
[2024-05-31 19:17:46] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-31 19:17:46] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-31 19:17:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 19 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 44ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/193 places, 3/482 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 2/193 places, 3/482 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16a-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16a-LTLCardinality-07 finished in 133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(((G(p0)||p1) U X(p2)))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 482/482 transitions.
Applied a total of 0 rules in 10 ms. Remains 193 /193 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 193 cols
[2024-05-31 19:17:47] [INFO ] Computed 16 invariants in 7 ms
[2024-05-31 19:17:47] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 19:17:47] [INFO ] Invariant cache hit.
[2024-05-31 19:17:47] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2024-05-31 19:17:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 16/208 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/675 variables, 193/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (OVERLAPS) 0/675 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 402 constraints, problems are : Problem set: 0 solved, 481 unsolved in 16679 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 16/208 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/675 variables, 193/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 481/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 0/675 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Int declared 675/675 variables, and 883 constraints, problems are : Problem set: 0 solved, 481 unsolved in 22458 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
After SMT, in 39383ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 39388ms
Finished structural reductions in LTL mode , in 1 iterations and 39592 ms. Remains : 193/193 places, 482/482 transitions.
Stuttering acceptance computed with spot in 348 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16a-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 359 ms.
Product exploration explored 100000 steps with 33333 reset in 364 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 p0 p1 p2), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 23 ms. Reduced automaton from 9 states, 22 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16a-LTLCardinality-08 finished in 40722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 482/482 transitions.
Graph (trivial) has 249 edges and 193 vertex of which 183 / 193 are part of one of the 17 SCC in 1 ms
Free SCC test removed 166 places
Ensure Unique test removed 329 transitions
Reduce isomorphic transitions removed 329 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 129 transitions
Reduce isomorphic transitions removed 129 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 143 rules applied. Total rules applied 144 place count 13 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 1 with 2 rules applied. Total rules applied 146 place count 12 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 147 place count 11 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 147 place count 11 transition count 20
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 149 place count 10 transition count 20
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 151 place count 9 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 160 place count 9 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 160 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 166 place count 6 transition count 7
Applied a total of 166 rules in 12 ms. Remains 6 /193 variables (removed 187) and now considering 7/482 (removed 475) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-05-31 19:18:27] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 19:18:27] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-31 19:18:27] [INFO ] Invariant cache hit.
[2024-05-31 19:18:27] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-31 19:18:27] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-31 19:18:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/6 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/12 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 15 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[Domain max(s): 6/6 constraints, 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, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/6 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/12 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/12 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 18 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[Domain max(s): 6/6 constraints, 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 66ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 66ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/193 places, 7/482 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 6/193 places, 7/482 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-16a-LTLCardinality-09
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16a-LTLCardinality-09 finished in 222 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(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 482/482 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 193 cols
[2024-05-31 19:18:27] [INFO ] Computed 16 invariants in 3 ms
[2024-05-31 19:18:28] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 19:18:28] [INFO ] Invariant cache hit.
[2024-05-31 19:18:28] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2024-05-31 19:18:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 16/208 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/675 variables, 193/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (OVERLAPS) 0/675 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 402 constraints, problems are : Problem set: 0 solved, 481 unsolved in 16601 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 16/208 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/675 variables, 193/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 481/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 0/675 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Int declared 675/675 variables, and 883 constraints, problems are : Problem set: 0 solved, 481 unsolved in 22657 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
After SMT, in 39558ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 39565ms
Finished structural reductions in LTL mode , in 1 iterations and 39770 ms. Remains : 193/193 places, 482/482 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16a-LTLCardinality-12
Product exploration explored 100000 steps with 33333 reset in 361 ms.
Product exploration explored 100000 steps with 33333 reset in 337 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16a-LTLCardinality-12 finished in 40646 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 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 482/482 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2024-05-31 19:19:08] [INFO ] Invariant cache hit.
[2024-05-31 19:19:08] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 19:19:08] [INFO ] Invariant cache hit.
[2024-05-31 19:19:08] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2024-05-31 19:19:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 16/208 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/675 variables, 193/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (OVERLAPS) 0/675 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 402 constraints, problems are : Problem set: 0 solved, 481 unsolved in 16388 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 16/208 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/675 variables, 193/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 481/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 0/675 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Int declared 675/675 variables, and 883 constraints, problems are : Problem set: 0 solved, 481 unsolved in 22424 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
After SMT, in 39051ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 39057ms
Finished structural reductions in LTL mode , in 1 iterations and 39255 ms. Remains : 193/193 places, 482/482 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16a-LTLCardinality-13
Product exploration explored 100000 steps with 25000 reset in 403 ms.
Product exploration explored 100000 steps with 25000 reset in 408 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 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 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1293 steps (0 resets) in 14 ms. (86 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 128 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 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 482/482 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2024-05-31 19:19:49] [INFO ] Invariant cache hit.
[2024-05-31 19:19:49] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 19:19:49] [INFO ] Invariant cache hit.
[2024-05-31 19:19:49] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2024-05-31 19:19:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 16/208 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/675 variables, 193/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (OVERLAPS) 0/675 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 402 constraints, problems are : Problem set: 0 solved, 481 unsolved in 16512 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 16/208 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/675 variables, 193/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 481/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 0/675 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Int declared 675/675 variables, and 883 constraints, problems are : Problem set: 0 solved, 481 unsolved in 22614 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
After SMT, in 39414ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 39421ms
Finished structural reductions in LTL mode , in 1 iterations and 39631 ms. Remains : 193/193 places, 482/482 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 86 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 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1195 steps (0 resets) in 18 ms. (62 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 80 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 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 387 ms.
Product exploration explored 100000 steps with 25000 reset in 395 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 482/482 transitions.
Graph (trivial) has 253 edges and 193 vertex of which 188 / 193 are part of one of the 18 SCC in 0 ms
Free SCC test removed 170 places
Ensure Unique test removed 335 transitions
Reduce isomorphic transitions removed 335 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 23 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 23 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 22 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 22 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 1 with 120 rules applied. Total rules applied 125 place count 22 transition count 27
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 139 place count 8 transition count 13
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 153 place count 8 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 153 rules in 17 ms. Remains 8 /193 variables (removed 185) and now considering 13/482 (removed 469) transitions.
[2024-05-31 19:20:31] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-31 19:20:31] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2024-05-31 19:20:31] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 19:20:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 19:20:31] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 5 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 9/17 variables, 8/11 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/18 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 12 constraints, problems are : Problem set: 2 solved, 10 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 9/17 variables, 8/11 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 10/21 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/18 variables, 1/22 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 22 constraints, problems are : Problem set: 2 solved, 10 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 208ms problems are : Problem set: 2 solved, 10 unsolved
Search for dead transitions found 2 dead transitions in 208ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 8/193 places, 11/482 transitions.
Graph (complete) has 12 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 7 /8 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/193 places, 11/482 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 240 ms. Remains : 7/193 places, 11/482 transitions.
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 482/482 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 193 cols
[2024-05-31 19:20:31] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 19:20:31] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-31 19:20:31] [INFO ] Invariant cache hit.
[2024-05-31 19:20:31] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2024-05-31 19:20:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 16/208 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/675 variables, 193/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (OVERLAPS) 0/675 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 402 constraints, problems are : Problem set: 0 solved, 481 unsolved in 16628 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 16/208 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/675 variables, 193/402 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 481/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 0/675 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Int declared 675/675 variables, and 883 constraints, problems are : Problem set: 0 solved, 481 unsolved in 22388 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
After SMT, in 39259ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 39268ms
Finished structural reductions in LTL mode , in 1 iterations and 39475 ms. Remains : 193/193 places, 482/482 transitions.
Treatment of property FlexibleBarrier-PT-16a-LTLCardinality-13 finished in 122437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 482/482 transitions.
Graph (trivial) has 250 edges and 193 vertex of which 181 / 193 are part of one of the 17 SCC in 0 ms
Free SCC test removed 164 places
Ensure Unique test removed 313 transitions
Reduce isomorphic transitions removed 313 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Graph (trivial) has 15 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
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 160 rules applied. Total rules applied 161 place count 13 transition count 23
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 166 place count 12 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 168 place count 10 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 168 place count 10 transition count 18
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 170 place count 9 transition count 18
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 8 transition count 16
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 8 transition count 16
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 174 place count 8 transition count 14
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 176 place count 7 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 177 place count 6 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 183 place count 6 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 184 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 185 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 185 place count 5 transition count 5
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 187 place count 4 transition count 5
Applied a total of 187 rules in 4 ms. Remains 4 /193 variables (removed 189) and now considering 5/482 (removed 477) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-05-31 19:21:11] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 19:21:11] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-31 19:21:11] [INFO ] Invariant cache hit.
[2024-05-31 19:21:11] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-31 19:21:11] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-31 19:21:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 46ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 46ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/193 places, 5/482 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 ms. Remains : 4/193 places, 5/482 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16a-LTLCardinality-14
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16a-LTLCardinality-14 finished in 215 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-16a-LTLCardinality-13
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 193/193 places, 482/482 transitions.
Graph (trivial) has 253 edges and 193 vertex of which 188 / 193 are part of one of the 18 SCC in 1 ms
Free SCC test removed 170 places
Ensure Unique test removed 335 transitions
Reduce isomorphic transitions removed 335 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 134 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 150 rules applied. Total rules applied 151 place count 7 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 152 place count 6 transition count 11
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 2 with 2 rules applied. Total rules applied 154 place count 5 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 157 place count 5 transition count 7
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 2 with 1 rules applied. Total rules applied 158 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 159 place count 4 transition count 6
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 160 place count 3 transition count 5
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 3 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 162 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 162 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 164 place count 2 transition count 3
Applied a total of 164 rules in 18 ms. Remains 2 /193 variables (removed 191) and now considering 3/482 (removed 479) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-31 19:21:11] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 19:21:11] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-31 19:21:11] [INFO ] Invariant cache hit.
[2024-05-31 19:21:11] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2024-05-31 19:21:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 54ms
Starting structural reductions in LI_LTL mode, iteration 1 : 2/193 places, 3/482 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 115 ms. Remains : 2/193 places, 3/482 transitions.
Running random walk in product with property : FlexibleBarrier-PT-16a-LTLCardinality-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
Treatment of property FlexibleBarrier-PT-16a-LTLCardinality-13 finished in 401 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-31 19:21:11] [INFO ] Flatten gal took : 19 ms
[2024-05-31 19:21:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 19:21:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 193 places, 482 transitions and 1429 arcs took 7 ms.
Total runtime 287404 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717183272002

--------------------
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-16a-LTLCardinality-13
ltl formula formula --ltl=/tmp/1046/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 193 places, 482 transitions and 1429 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.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1046/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1046/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1046/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1046/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 195 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 194, there are 487 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: 169
pnml2lts-mc( 0/ 4): unique states count: 169
pnml2lts-mc( 0/ 4): unique transitions count: 498
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 382
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 189
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 189 states 763 transitions, fanout: 4.037
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 18900, Transitions per second: 76300
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, 19.2 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 494 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-16a"
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-16a, 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-171640602600099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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