Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r070-tall-171620505500251.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CSRepetitions-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505500251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 50K Apr 12 09:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 208K Apr 12 09:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 78K Apr 12 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 340K Apr 12 09:24 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 35K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 34K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 111K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Apr 12 09:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 361K Apr 12 09:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 140K Apr 12 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 598K Apr 12 09:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 162K 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 CSRepetitions-PT-05-LTLCardinality-00
FORMULA_NAME CSRepetitions-PT-05-LTLCardinality-01
FORMULA_NAME CSRepetitions-PT-05-LTLCardinality-02
FORMULA_NAME CSRepetitions-PT-05-LTLCardinality-03
FORMULA_NAME CSRepetitions-PT-05-LTLCardinality-04
FORMULA_NAME CSRepetitions-PT-05-LTLCardinality-05
FORMULA_NAME CSRepetitions-PT-05-LTLCardinality-06
FORMULA_NAME CSRepetitions-PT-05-LTLCardinality-07
FORMULA_NAME CSRepetitions-PT-05-LTLCardinality-08
FORMULA_NAME CSRepetitions-PT-05-LTLCardinality-09
FORMULA_NAME CSRepetitions-PT-05-LTLCardinality-10
FORMULA_NAME CSRepetitions-PT-05-LTLCardinality-11
FORMULA_NAME CSRepetitions-PT-05-LTLCardinality-12
FORMULA_NAME CSRepetitions-PT-05-LTLCardinality-13
FORMULA_NAME CSRepetitions-PT-05-LTLCardinality-14
FORMULA_NAME CSRepetitions-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716275243162

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 07:07:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 07:07:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:07:24] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-21 07:07:24] [INFO ] Transformed 206 places.
[2024-05-21 07:07:24] [INFO ] Transformed 325 transitions.
[2024-05-21 07:07:24] [INFO ] Parsed PT model containing 206 places and 325 transitions and 1175 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CSRepetitions-PT-05-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-05-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 181 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 20 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2024-05-21 07:07:24] [INFO ] Computed 30 invariants in 10 ms
[2024-05-21 07:07:24] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 07:07:24] [INFO ] Invariant cache hit.
[2024-05-21 07:07:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 07:07:25] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-21 07:07:25] [INFO ] Invariant cache hit.
[2024-05-21 07:07:25] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 10352 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 11826 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 22508ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 22530ms
Finished structural reductions in LTL mode , in 1 iterations and 22922 ms. Remains : 206/206 places, 325/325 transitions.
Support contains 181 out of 206 places after structural reductions.
[2024-05-21 07:07:47] [INFO ] Flatten gal took : 51 ms
[2024-05-21 07:07:47] [INFO ] Flatten gal took : 24 ms
[2024-05-21 07:07:47] [INFO ] Input system was already deterministic with 325 transitions.
RANDOM walk for 40004 steps (634 resets) in 1427 ms. (28 steps per ms) remains 5/28 properties
BEST_FIRST walk for 40004 steps (24 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (23 resets) in 203 ms. (196 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (22 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (23 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (24 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
[2024-05-21 07:07:48] [INFO ] Invariant cache hit.
[2024-05-21 07:07:48] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
After SMT solving in domain Real declared 56/531 variables, and 4 constraints, problems are : Problem set: 5 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 4/30 constraints, State Equation: 0/206 constraints, ReadFeed: 0/25 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
FORMULA CSRepetitions-PT-05-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-05-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 25 stable transitions
FORMULA CSRepetitions-PT-05-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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&&G(p1)&&X(p0)))))'
Support contains 51 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 8 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-21 07:07:48] [INFO ] Invariant cache hit.
[2024-05-21 07:07:49] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 07:07:49] [INFO ] Invariant cache hit.
[2024-05-21 07:07:49] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 07:07:49] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-21 07:07:49] [INFO ] Invariant cache hit.
[2024-05-21 07:07:49] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 9913 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 11378 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 21501ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21507ms
Finished structural reductions in LTL mode , in 1 iterations and 21821 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 344 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-05-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLCardinality-00 finished in 22229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(F(p1))))))'
Support contains 131 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-21 07:08:11] [INFO ] Invariant cache hit.
[2024-05-21 07:08:11] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 07:08:11] [INFO ] Invariant cache hit.
[2024-05-21 07:08:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 07:08:11] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-21 07:08:11] [INFO ] Invariant cache hit.
[2024-05-21 07:08:11] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 9728 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 11289 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 21213ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21218ms
Finished structural reductions in LTL mode , in 1 iterations and 21419 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-05-LTLCardinality-01
Product exploration explored 100000 steps with 24796 reset in 520 ms.
Product exploration explored 100000 steps with 24811 reset in 337 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 308 steps (3 resets) in 15 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 104 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 156 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 6 out of 206 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 8 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-21 07:08:34] [INFO ] Invariant cache hit.
[2024-05-21 07:08:34] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 07:08:34] [INFO ] Invariant cache hit.
[2024-05-21 07:08:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 07:08:34] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-21 07:08:34] [INFO ] Invariant cache hit.
[2024-05-21 07:08:34] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 10103 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 11554 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 21845ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21863ms
Finished structural reductions in LTL mode , in 1 iterations and 22079 ms. Remains : 206/206 places, 325/325 transitions.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 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 p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 297 steps (4 resets) in 13 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 89 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 140 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 24759 reset in 316 ms.
Product exploration explored 100000 steps with 24764 reset in 270 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 6 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 30 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-21 07:08:58] [INFO ] Redundant transitions in 16 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-21 07:08:58] [INFO ] Invariant cache hit.
[2024-05-21 07:08:58] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 9897 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 11634 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 21730ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21733ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21787 ms. Remains : 206/206 places, 325/325 transitions.
Built C files in :
/tmp/ltsmin13935338425104966547
[2024-05-21 07:09:20] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13935338425104966547
Running compilation step : cd /tmp/ltsmin13935338425104966547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 683 ms.
Running link step : cd /tmp/ltsmin13935338425104966547;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin13935338425104966547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased378906831308293614.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-21 07:09:35] [INFO ] Invariant cache hit.
[2024-05-21 07:09:35] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-21 07:09:35] [INFO ] Invariant cache hit.
[2024-05-21 07:09:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 07:09:35] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-21 07:09:35] [INFO ] Invariant cache hit.
[2024-05-21 07:09:35] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 9721 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 11189 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 21090ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21094ms
Finished structural reductions in LTL mode , in 1 iterations and 21405 ms. Remains : 206/206 places, 325/325 transitions.
Built C files in :
/tmp/ltsmin14078299010099546568
[2024-05-21 07:09:56] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14078299010099546568
Running compilation step : cd /tmp/ltsmin14078299010099546568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 553 ms.
Running link step : cd /tmp/ltsmin14078299010099546568;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14078299010099546568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13755221326219648078.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 07:10:11] [INFO ] Flatten gal took : 20 ms
[2024-05-21 07:10:11] [INFO ] Flatten gal took : 19 ms
[2024-05-21 07:10:11] [INFO ] Time to serialize gal into /tmp/LTL16269569783756746508.gal : 6 ms
[2024-05-21 07:10:11] [INFO ] Time to serialize properties into /tmp/LTL4245585652530826976.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16269569783756746508.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3024467073079094936.hoa' '-atoms' '/tmp/LTL4245585652530826976.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4245585652530826976.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3024467073079094936.hoa
Detected timeout of ITS tools.
[2024-05-21 07:10:26] [INFO ] Flatten gal took : 17 ms
[2024-05-21 07:10:26] [INFO ] Flatten gal took : 16 ms
[2024-05-21 07:10:26] [INFO ] Time to serialize gal into /tmp/LTL8674690929894328581.gal : 4 ms
[2024-05-21 07:10:26] [INFO ] Time to serialize properties into /tmp/LTL4691038840606728244.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8674690929894328581.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4691038840606728244.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(("((((((((Server_Anwering_23_4+Server_Anwering_21_5)+(Server_Anwering_25_4+Server_Anwering_7_5))+((Server_Anwering_11_3+Server_An...2994
Formula 0 simplified : X(!"((((((((Server_Anwering_23_4+Server_Anwering_21_5)+(Server_Anwering_25_4+Server_Anwering_7_5))+((Server_Anwering_11_3+Server_Anw...2984
Detected timeout of ITS tools.
[2024-05-21 07:10:42] [INFO ] Flatten gal took : 16 ms
[2024-05-21 07:10:42] [INFO ] Applying decomposition
[2024-05-21 07:10:42] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14370534499463323136.txt' '-o' '/tmp/graph14370534499463323136.bin' '-w' '/tmp/graph14370534499463323136.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14370534499463323136.bin' '-l' '-1' '-v' '-w' '/tmp/graph14370534499463323136.weights' '-q' '0' '-e' '0.001'
[2024-05-21 07:10:42] [INFO ] Decomposing Gal with order
[2024-05-21 07:10:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 07:10:42] [INFO ] Removed a total of 220 redundant transitions.
[2024-05-21 07:10:42] [INFO ] Flatten gal took : 255 ms
[2024-05-21 07:10:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-21 07:10:42] [INFO ] Time to serialize gal into /tmp/LTL11744805538099334836.gal : 5 ms
[2024-05-21 07:10:42] [INFO ] Time to serialize properties into /tmp/LTL1182819948268191380.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11744805538099334836.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1182819948268191380.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(("((((((((gu1.Server_Anwering_23_4+gu1.Server_Anwering_21_5)+(gu1.Server_Anwering_25_4+gu1.Server_Anwering_7_5))+((gu1.Server_Anw...3548
Formula 0 simplified : X(!"((((((((gu1.Server_Anwering_23_4+gu1.Server_Anwering_21_5)+(gu1.Server_Anwering_25_4+gu1.Server_Anwering_7_5))+((gu1.Server_Anwe...3538
Detected timeout of ITS tools.
Treatment of property CSRepetitions-PT-05-LTLCardinality-01 finished in 166433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||(p2&&G(!p1))))))'
Support contains 156 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-21 07:10:57] [INFO ] Invariant cache hit.
[2024-05-21 07:10:57] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 07:10:57] [INFO ] Invariant cache hit.
[2024-05-21 07:10:57] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 07:10:57] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-21 07:10:57] [INFO ] Invariant cache hit.
[2024-05-21 07:10:57] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 10132 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 11294 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 21592ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21595ms
Finished structural reductions in LTL mode , in 1 iterations and 21805 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p2)), false, p1, (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : CSRepetitions-PT-05-LTLCardinality-02
Product exploration explored 100000 steps with 4455 reset in 1263 ms.
Stack based approach found an accepted trace after 3731 steps with 172 reset with depth 7 and stack size 7 in 53 ms.
FORMULA CSRepetitions-PT-05-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLCardinality-02 finished in 23370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0)) U G((p1||F(p2))))))'
Support contains 180 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-21 07:11:20] [INFO ] Invariant cache hit.
[2024-05-21 07:11:21] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 07:11:21] [INFO ] Invariant cache hit.
[2024-05-21 07:11:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 07:11:21] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-21 07:11:21] [INFO ] Invariant cache hit.
[2024-05-21 07:11:21] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 9992 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 11192 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 21377ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21380ms
Finished structural reductions in LTL mode , in 1 iterations and 21565 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-05-LTLCardinality-03
Stuttering criterion allowed to conclude after 3974 steps with 149 reset in 26 ms.
FORMULA CSRepetitions-PT-05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLCardinality-03 finished in 21829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 175 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 14 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-21 07:11:42] [INFO ] Invariant cache hit.
[2024-05-21 07:11:42] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-21 07:11:42] [INFO ] Invariant cache hit.
[2024-05-21 07:11:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 07:11:43] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-21 07:11:43] [INFO ] Redundant transitions in 4 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-21 07:11:43] [INFO ] Invariant cache hit.
[2024-05-21 07:11:43] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 9829 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 11370 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 21401ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21407ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21767 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLCardinality-04
Product exploration explored 100000 steps with 1449 reset in 755 ms.
Stack based approach found an accepted trace after 8286 steps with 117 reset with depth 32 and stack size 32 in 64 ms.
FORMULA CSRepetitions-PT-05-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLCardinality-04 finished in 22639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 156 transition count 300
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 195 place count 36 transition count 180
Iterating global reduction 0 with 120 rules applied. Total rules applied 315 place count 36 transition count 180
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 336 place count 15 transition count 54
Iterating global reduction 0 with 21 rules applied. Total rules applied 357 place count 15 transition count 54
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 378 place count 15 transition count 33
Applied a total of 378 rules in 30 ms. Remains 15 /206 variables (removed 191) and now considering 33/325 (removed 292) transitions.
// Phase 1: matrix 33 rows 15 cols
[2024-05-21 07:12:05] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 07:12:05] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 07:12:05] [INFO ] Invariant cache hit.
[2024-05-21 07:12:05] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-21 07:12:05] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
[2024-05-21 07:12:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 33/47 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 1/48 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 20 constraints, problems are : Problem set: 0 solved, 29 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 33/47 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 1/48 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 29/49 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 49 constraints, problems are : Problem set: 0 solved, 29 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 401ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 401ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/206 places, 33/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 489 ms. Remains : 15/206 places, 33/325 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLCardinality-05
Stuttering criterion allowed to conclude after 65 steps with 1 reset in 11 ms.
FORMULA CSRepetitions-PT-05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLCardinality-05 finished in 570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0||G(p1))) U G(!p2))))'
Support contains 31 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 9 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2024-05-21 07:12:05] [INFO ] Computed 30 invariants in 3 ms
[2024-05-21 07:12:06] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 07:12:06] [INFO ] Invariant cache hit.
[2024-05-21 07:12:06] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 07:12:06] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-21 07:12:06] [INFO ] Invariant cache hit.
[2024-05-21 07:12:06] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 9882 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 11310 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 21354ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21357ms
Finished structural reductions in LTL mode , in 1 iterations and 21648 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 160 ms :[p2, p2, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-05-LTLCardinality-06
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 2 ms.
FORMULA CSRepetitions-PT-05-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLCardinality-06 finished in 21830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 126 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 156 transition count 300
Applied a total of 75 rules in 26 ms. Remains 156 /206 variables (removed 50) and now considering 300/325 (removed 25) transitions.
// Phase 1: matrix 300 rows 156 cols
[2024-05-21 07:12:27] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 07:12:27] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 07:12:27] [INFO ] Invariant cache hit.
[2024-05-21 07:12:27] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-21 07:12:27] [INFO ] Redundant transitions in 4 ms returned []
Running 275 sub problems to find dead transitions.
[2024-05-21 07:12:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 300/455 variables, 155/160 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 1/456 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/456 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 161 constraints, problems are : Problem set: 0 solved, 275 unsolved in 7970 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 300/455 variables, 155/160 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 1/456 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 275/436 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/456 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 436 constraints, problems are : Problem set: 0 solved, 275 unsolved in 8224 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints]
After SMT, in 16302ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 16306ms
Starting structural reductions in SI_LTL mode, iteration 1 : 156/206 places, 300/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16498 ms. Remains : 156/206 places, 300/325 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-05-LTLCardinality-07
Product exploration explored 100000 steps with 10283 reset in 421 ms.
Stack based approach found an accepted trace after 1796 steps with 185 reset with depth 4 and stack size 4 in 7 ms.
FORMULA CSRepetitions-PT-05-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLCardinality-07 finished in 17069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X((G(p1) U p0))) U X(p2)))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2024-05-21 07:12:44] [INFO ] Computed 30 invariants in 5 ms
[2024-05-21 07:12:44] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 07:12:45] [INFO ] Invariant cache hit.
[2024-05-21 07:12:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 07:12:45] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-21 07:12:45] [INFO ] Invariant cache hit.
[2024-05-21 07:12:45] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 10046 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 11255 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 21473ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21476ms
Finished structural reductions in LTL mode , in 1 iterations and 21804 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 19 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-05-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-05-LTLCardinality-09 finished in 22450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((F(G(p1))||G(p2)))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-21 07:13:07] [INFO ] Invariant cache hit.
[2024-05-21 07:13:07] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 07:13:07] [INFO ] Invariant cache hit.
[2024-05-21 07:13:07] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 07:13:07] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-21 07:13:07] [INFO ] Invariant cache hit.
[2024-05-21 07:13:07] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 261 constraints, problems are : Problem set: 0 solved, 300 unsolved in 10155 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 25/206 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 325/531 variables, 206/236 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 300/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 561 constraints, problems are : Problem set: 0 solved, 300 unsolved in 11299 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 206/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 21637ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 21641ms
Finished structural reductions in LTL mode , in 1 iterations and 21927 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-05-LTLCardinality-11
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-05-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLCardinality-11 finished in 22141 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 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 156 transition count 300
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 194 place count 37 transition count 181
Iterating global reduction 0 with 119 rules applied. Total rules applied 313 place count 37 transition count 181
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 333 place count 17 transition count 61
Iterating global reduction 0 with 20 rules applied. Total rules applied 353 place count 17 transition count 61
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 373 place count 17 transition count 41
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 387 place count 8 transition count 36
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 402 place count 8 transition count 21
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 404 place count 6 transition count 15
Iterating global reduction 2 with 2 rules applied. Total rules applied 406 place count 6 transition count 15
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 408 place count 6 transition count 13
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 410 place count 6 transition count 11
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 411 place count 5 transition count 9
Iterating global reduction 3 with 1 rules applied. Total rules applied 412 place count 5 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 413 place count 5 transition count 8
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 414 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 415 place count 5 transition count 7
Applied a total of 415 rules in 26 ms. Remains 5 /206 variables (removed 201) and now considering 7/325 (removed 318) transitions.
// Phase 1: matrix 7 rows 5 cols
[2024-05-21 07:13:29] [INFO ] Computed 1 invariants in 0 ms
[2024-05-21 07:13:29] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 07:13:29] [INFO ] Invariant cache hit.
[2024-05-21 07:13:29] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-21 07:13:29] [INFO ] Redundant transitions in 11 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-21 07:13:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/12 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 6 constraints, problems are : Problem set: 0 solved, 5 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/12 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 117ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/206 places, 7/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 5/206 places, 7/325 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLCardinality-14
Product exploration explored 100000 steps with 1643 reset in 172 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA CSRepetitions-PT-05-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLCardinality-14 finished in 440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(F(p1))))))'
[2024-05-21 07:13:30] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin788463846320915827
[2024-05-21 07:13:30] [INFO ] Applying decomposition
[2024-05-21 07:13:30] [INFO ] Computing symmetric may disable matrix : 325 transitions.
[2024-05-21 07:13:30] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:13:30] [INFO ] Computing symmetric may enable matrix : 325 transitions.
[2024-05-21 07:13:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:13:30] [INFO ] Flatten gal took : 29 ms
[2024-05-21 07:13:30] [INFO ] Computing Do-Not-Accords matrix : 325 transitions.
[2024-05-21 07:13:30] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:13:30] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin788463846320915827
Running compilation step : cd /tmp/ltsmin788463846320915827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10379919007788758100.txt' '-o' '/tmp/graph10379919007788758100.bin' '-w' '/tmp/graph10379919007788758100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10379919007788758100.bin' '-l' '-1' '-v' '-w' '/tmp/graph10379919007788758100.weights' '-q' '0' '-e' '0.001'
[2024-05-21 07:13:30] [INFO ] Decomposing Gal with order
[2024-05-21 07:13:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 07:13:30] [INFO ] Removed a total of 220 redundant transitions.
[2024-05-21 07:13:30] [INFO ] Flatten gal took : 117 ms
[2024-05-21 07:13:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 07:13:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality4023356619992380612.gal : 3 ms
[2024-05-21 07:13:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality15510543745737981368.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4023356619992380612.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15510543745737981368.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(("((((((((gu0.Server_Anwering_23_4+gu0.Server_Anwering_21_5)+(gu0.Server_Anwering_25_4+gu0.Server_Anwering_7_5))+((gu0.Server_Anw...3548
Formula 0 simplified : X(!"((((((((gu0.Server_Anwering_23_4+gu0.Server_Anwering_21_5)+(gu0.Server_Anwering_25_4+gu0.Server_Anwering_7_5))+((gu0.Server_Anwe...3538
Compilation finished in 796 ms.
Running link step : cd /tmp/ltsmin788463846320915827;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin788463846320915827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)||X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.020: LTL layer: formula: X(((LTLAPp0==true)||X(X(<>((LTLAPp1==true))))))
pins2lts-mc-linux64( 1/ 8), 0.021: "X(((LTLAPp0==true)||X(X(<>((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.021: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.056: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.150: DFS-FIFO for weak LTL, using special progress label 328
pins2lts-mc-linux64( 0/ 8), 0.150: There are 329 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.150: State length is 207, there are 329 groups
pins2lts-mc-linux64( 0/ 8), 0.150: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.150: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.150: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.150: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.201: ~2 levels ~960 states ~1000 transitions
pins2lts-mc-linux64( 7/ 8), 0.221: ~2 levels ~1920 states ~2400 transitions
pins2lts-mc-linux64( 3/ 8), 0.260: ~27 levels ~3840 states ~10744 transitions
pins2lts-mc-linux64( 6/ 8), 0.326: ~27 levels ~7680 states ~12280 transitions
pins2lts-mc-linux64( 4/ 8), 0.411: ~27 levels ~15360 states ~22808 transitions
pins2lts-mc-linux64( 4/ 8), 0.582: ~27 levels ~30720 states ~39864 transitions
pins2lts-mc-linux64( 4/ 8), 0.884: ~27 levels ~61440 states ~75432 transitions
pins2lts-mc-linux64( 6/ 8), 1.529: ~27 levels ~122880 states ~145608 transitions
pins2lts-mc-linux64( 4/ 8), 2.579: ~27 levels ~245760 states ~296120 transitions
pins2lts-mc-linux64( 6/ 8), 4.323: ~27 levels ~491520 states ~599256 transitions
pins2lts-mc-linux64( 2/ 8), 7.267: ~27 levels ~983040 states ~1225304 transitions
pins2lts-mc-linux64( 2/ 8), 12.565: ~27 levels ~1966080 states ~2511784 transitions
pins2lts-mc-linux64( 2/ 8), 22.504: ~27 levels ~3932160 states ~5156088 transitions
pins2lts-mc-linux64( 2/ 8), 42.514: ~27 levels ~7864320 states ~10573656 transitions
pins2lts-mc-linux64( 2/ 8), 82.406: ~27 levels ~15728640 states ~21727448 transitions
pins2lts-mc-linux64( 2/ 8), 163.095: ~27 levels ~31457280 states ~44717064 transitions
pins2lts-mc-linux64( 2/ 8), 325.586: ~27 levels ~62914560 states ~92285416 transitions
pins2lts-mc-linux64( 2/ 8), 656.591: ~27 levels ~125829120 states ~190606600 transitions
pins2lts-mc-linux64( 4/ 8), 1171.640: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1171.707:
pins2lts-mc-linux64( 0/ 8), 1171.708: mean standard work distribution: 77.5% (states) 77.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 1171.708:
pins2lts-mc-linux64( 0/ 8), 1171.708: Explored 134215431 states 208270080 transitions, fanout: 1.552
pins2lts-mc-linux64( 0/ 8), 1171.708: Total exploration time 1171.540 sec (1171.470 sec minimum, 1171.500 sec on average)
pins2lts-mc-linux64( 0/ 8), 1171.708: States per second: 114563, Transitions per second: 177775
pins2lts-mc-linux64( 0/ 8), 1171.708:
pins2lts-mc-linux64( 0/ 8), 1171.708: Progress states detected: 349
pins2lts-mc-linux64( 0/ 8), 1171.708: Redundant explorations: -0.0013
pins2lts-mc-linux64( 0/ 8), 1171.708:
pins2lts-mc-linux64( 0/ 8), 1171.708: Queue width: 8B, total height: 906, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 1171.708: Tree memory: 1267.6MB, 9.9 B/state, compr.: 1.2%
pins2lts-mc-linux64( 0/ 8), 1171.708: Tree fill ratio (roots/leafs): 99.0%/95.0%
pins2lts-mc-linux64( 0/ 8), 1171.708: Stored 350 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1171.708: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1171.708: Est. total memory use: 1267.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin788463846320915827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)||X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin788463846320915827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)||X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-21 07:35:32] [INFO ] Flatten gal took : 15 ms
[2024-05-21 07:35:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality9552193072117815088.gal : 3 ms
[2024-05-21 07:35:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality10728140547342396867.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9552193072117815088.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10728140547342396867.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(("((((((((Server_Anwering_23_4+Server_Anwering_21_5)+(Server_Anwering_25_4+Server_Anwering_7_5))+((Server_Anwering_11_3+Server_An...2994
Formula 0 simplified : X(!"((((((((Server_Anwering_23_4+Server_Anwering_21_5)+(Server_Anwering_25_4+Server_Anwering_7_5))+((Server_Anwering_11_3+Server_Anw...2984
ITS-tools command line returned an error code 137
[2024-05-21 07:47:23] [INFO ] Flatten gal took : 18 ms
[2024-05-21 07:47:23] [INFO ] Input system was already deterministic with 325 transitions.
[2024-05-21 07:47:23] [INFO ] Transformed 206 places.
[2024-05-21 07:47:23] [INFO ] Transformed 325 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 07:47:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality17419195065610739410.gal : 4 ms
[2024-05-21 07:47:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality8840849954622352146.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17419195065610739410.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8840849954622352146.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(("((((((((Server_Anwering_23_4+Server_Anwering_21_5)+(Server_Anwering_25_4+Server_Anwering_7_5))+((Server_Anwering_11_3+Server_An...2994
Formula 0 simplified : X(!"((((((((Server_Anwering_23_4+Server_Anwering_21_5)+(Server_Anwering_25_4+Server_Anwering_7_5))+((Server_Anwering_11_3+Server_Anw...2984
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t7, t8, t10, t11, t12, t13, t14, t20, t21, t23, t29, t30, t31, t32, t34, t36, t39...1156
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
36530 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,365.366,3667376,1,0,879,2.489e+07,15,358,3449,1.40617e+07,187
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-05-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 2766848 ms.

BK_STOP 1716278011202

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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