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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 04:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 12 04:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 114K 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 Echo-PT-d03r03-LTLCardinality-00
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-01
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-02
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-03
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-04
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-05
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-06
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-07
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-08
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-09
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-10
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-11
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-12
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-13
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-14
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717204261999

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d03r03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 01:11:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 01:11:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 01:11:05] [INFO ] Load time of PNML (sax parser for PT used): 346 ms
[2024-06-01 01:11:05] [INFO ] Transformed 265 places.
[2024-06-01 01:11:05] [INFO ] Transformed 206 transitions.
[2024-06-01 01:11:05] [INFO ] Found NUPN structural information;
[2024-06-01 01:11:05] [INFO ] Parsed PT model containing 265 places and 206 transitions and 1252 arcs in 590 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Echo-PT-d03r03-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 206/206 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 238 transition count 206
Applied a total of 27 rules in 75 ms. Remains 238 /265 variables (removed 27) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2024-06-01 01:11:05] [INFO ] Computed 108 invariants in 150 ms
[2024-06-01 01:11:07] [INFO ] Implicit Places using invariants in 1813 ms returned []
[2024-06-01 01:11:07] [INFO ] Invariant cache hit.
[2024-06-01 01:11:08] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 3289 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-06-01 01:11:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 584 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30026 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 206/444 variables, 238/584 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 205/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 789 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30015 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 60399ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 60435ms
Starting structural reductions in LTL mode, iteration 1 : 238/265 places, 206/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63846 ms. Remains : 238/265 places, 206/206 transitions.
Support contains 20 out of 238 places after structural reductions.
[2024-06-01 01:12:09] [INFO ] Flatten gal took : 85 ms
[2024-06-01 01:12:09] [INFO ] Flatten gal took : 39 ms
[2024-06-01 01:12:09] [INFO ] Input system was already deterministic with 206 transitions.
Support contains 18 out of 238 places (down from 20) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 1090 steps (18 resets) in 174 ms. (6 steps per ms) remains 0/12 properties
Computed a total of 238 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(G(p0))||G(p1))))'
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 16 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-06-01 01:12:10] [INFO ] Invariant cache hit.
[2024-06-01 01:12:10] [INFO ] Implicit Places using invariants in 819 ms returned []
[2024-06-01 01:12:10] [INFO ] Invariant cache hit.
[2024-06-01 01:12:11] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1834 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-06-01 01:12:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 584 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30012 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 206/444 variables, 238/584 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 205/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 789 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30014 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 60208ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Finished structural reductions in LTL mode , in 1 iterations and 62068 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 525 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 77 steps with 1 reset in 5 ms.
FORMULA Echo-PT-d03r03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLCardinality-00 finished in 62683 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 1 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 58 ms. Remains 230 /238 variables (removed 8) and now considering 204/206 (removed 2) transitions.
// Phase 1: matrix 204 rows 230 cols
[2024-06-01 01:13:12] [INFO ] Computed 102 invariants in 46 ms
[2024-06-01 01:13:13] [INFO ] Implicit Places using invariants in 1078 ms returned [16, 181, 203, 211, 216, 224]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1085 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/238 places, 204/206 transitions.
Applied a total of 0 rules in 23 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1179 ms. Remains : 224/238 places, 204/206 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-01
Stuttering criterion allowed to conclude after 82 steps with 3 reset in 3 ms.
FORMULA Echo-PT-d03r03-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLCardinality-01 finished in 1261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 21 ms. Remains 230 /238 variables (removed 8) and now considering 204/206 (removed 2) transitions.
[2024-06-01 01:13:14] [INFO ] Invariant cache hit.
[2024-06-01 01:13:14] [INFO ] Implicit Places using invariants in 815 ms returned [16, 181, 203, 211, 216, 224]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 817 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/238 places, 204/206 transitions.
Applied a total of 0 rules in 16 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 855 ms. Remains : 224/238 places, 204/206 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-02
Product exploration explored 100000 steps with 2428 reset in 892 ms.
Product exploration explored 100000 steps with 2419 reset in 575 ms.
Computed a total of 224 stabilizing places and 204 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 224 transition count 204
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 187 steps (2 resets) in 9 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 204/204 transitions.
Applied a total of 0 rules in 12 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
// Phase 1: matrix 204 rows 224 cols
[2024-06-01 01:13:17] [INFO ] Computed 96 invariants in 30 ms
[2024-06-01 01:13:17] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-06-01 01:13:17] [INFO ] Invariant cache hit.
[2024-06-01 01:13:18] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2024-06-01 01:13:18] [INFO ] Redundant transitions in 16 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-01 01:13:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 224/224 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 96/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 204/428 variables, 224/544 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/428 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 544 constraints, problems are : Problem set: 0 solved, 198 unsolved in 9145 ms.
Refiners :[Domain max(s): 224/224 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 224/224 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 96/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 204/428 variables, 224/544 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 198/742 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/428 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 742 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30011 ms.
Refiners :[Domain max(s): 224/224 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 39284ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 39290ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40908 ms. Remains : 224/224 places, 204/204 transitions.
Computed a total of 224 stabilizing places and 204 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 224 transition count 204
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 158 steps (0 resets) in 7 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2443 reset in 511 ms.
Product exploration explored 100000 steps with 2412 reset in 415 ms.
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 204/204 transitions.
Applied a total of 0 rules in 12 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-06-01 01:13:59] [INFO ] Invariant cache hit.
[2024-06-01 01:14:00] [INFO ] Implicit Places using invariants in 912 ms returned []
[2024-06-01 01:14:00] [INFO ] Invariant cache hit.
[2024-06-01 01:14:01] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 1509 ms to find 0 implicit places.
[2024-06-01 01:14:01] [INFO ] Redundant transitions in 10 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-01 01:14:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 224/224 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 96/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 204/428 variables, 224/544 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/428 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 544 constraints, problems are : Problem set: 0 solved, 198 unsolved in 10099 ms.
Refiners :[Domain max(s): 224/224 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 224/224 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 96/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 204/428 variables, 224/544 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 198/742 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/428 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 742 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30011 ms.
Refiners :[Domain max(s): 224/224 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 40179ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 40182ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41719 ms. Remains : 224/224 places, 204/204 transitions.
Treatment of property Echo-PT-d03r03-LTLCardinality-02 finished in 87613 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(G(p1))))'
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2024-06-01 01:14:41] [INFO ] Computed 108 invariants in 18 ms
[2024-06-01 01:14:42] [INFO ] Implicit Places using invariants in 957 ms returned []
[2024-06-01 01:14:42] [INFO ] Invariant cache hit.
[2024-06-01 01:14:43] [INFO ] Implicit Places using invariants and state equation in 1256 ms returned []
Implicit Place search using SMT with State Equation took 2215 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-06-01 01:14:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 584 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30010 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 206/444 variables, 238/584 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 205/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 789 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30014 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Finished structural reductions in LTL mode , in 1 iterations and 62357 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d03r03-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLCardinality-06 finished in 62606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((X((X(p1) U p1))&&p0)))))'
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-06-01 01:15:44] [INFO ] Invariant cache hit.
[2024-06-01 01:15:45] [INFO ] Implicit Places using invariants in 1259 ms returned []
[2024-06-01 01:15:45] [INFO ] Invariant cache hit.
[2024-06-01 01:15:46] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 2524 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-06-01 01:15:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 584 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30011 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 206/444 variables, 238/584 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 205/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 789 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30010 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Finished structural reductions in LTL mode , in 1 iterations and 62655 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-10
Product exploration explored 100000 steps with 3865 reset in 447 ms.
Product exploration explored 100000 steps with 3980 reset in 563 ms.
Computed a total of 238 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 268 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 40000 steps (724 resets) in 656 ms. (60 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (60 resets) in 431 ms. (92 steps per ms) remains 1/1 properties
[2024-06-01 01:16:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 190/194 variables, 65/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 190/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/238 variables, 43/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 44/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 206/444 variables, 238/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/444 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 584 constraints, problems are : Problem set: 0 solved, 1 unsolved in 737 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 4/444 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Domain max(s): 4/238 constraints, Generalized P Invariants (flows): 0/108 constraints, State Equation: 0/238 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 771ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 12 factoid took 971 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), false, false]
[2024-06-01 01:16:51] [INFO ] Invariant cache hit.
[2024-06-01 01:16:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:16:56] [INFO ] [Real]Absence check using 0 positive and 108 generalized place invariants in 4815 ms returned unknown
Could not prove EG (NOT p0)
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 12 ms. Remains 237 /238 variables (removed 1) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 237 cols
[2024-06-01 01:16:56] [INFO ] Computed 108 invariants in 17 ms
[2024-06-01 01:16:57] [INFO ] Implicit Places using invariants in 755 ms returned [16, 163, 182, 204, 212, 223, 231]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 757 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/238 places, 205/206 transitions.
Applied a total of 0 rules in 11 ms. Remains 230 /230 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 780 ms. Remains : 230/238 places, 205/206 transitions.
Computed a total of 230 stabilizing places and 205 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 230 transition count 205
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 293 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), false, false]
Reduction of identical properties reduced properties to check from 4 to 2
RANDOM walk for 138 steps (0 resets) in 7 ms. (17 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 11 factoid took 593 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), false, false]
// Phase 1: matrix 205 rows 230 cols
[2024-06-01 01:16:58] [INFO ] Computed 101 invariants in 25 ms
[2024-06-01 01:17:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:17:05] [INFO ] [Real]Absence check using 0 positive and 101 generalized place invariants in 5992 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), false, false]
Product exploration explored 100000 steps with 3834 reset in 767 ms.
Product exploration explored 100000 steps with 3836 reset in 933 ms.
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 205/205 transitions.
Applied a total of 0 rules in 10 ms. Remains 230 /230 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2024-06-01 01:17:07] [INFO ] Invariant cache hit.
[2024-06-01 01:17:08] [INFO ] Implicit Places using invariants in 993 ms returned []
[2024-06-01 01:17:08] [INFO ] Invariant cache hit.
[2024-06-01 01:17:09] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
[2024-06-01 01:17:09] [INFO ] Redundant transitions in 2 ms returned []
Running 199 sub problems to find dead transitions.
[2024-06-01 01:17:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 101/331 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 205/435 variables, 230/561 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 435/435 variables, and 561 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30014 ms.
Refiners :[Domain max(s): 230/230 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 101/331 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 205/435 variables, 230/561 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 199/760 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/435 variables, and 760 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30016 ms.
Refiners :[Domain max(s): 230/230 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62153 ms. Remains : 230/230 places, 205/205 transitions.
Treatment of property Echo-PT-d03r03-LTLCardinality-10 finished in 145151 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(((F(p0)||(p1 U p2))&&(F(p0)||G(p1))))))'
Support contains 5 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.8 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 17 ms. Remains 230 /238 variables (removed 8) and now considering 204/206 (removed 2) transitions.
// Phase 1: matrix 204 rows 230 cols
[2024-06-01 01:18:09] [INFO ] Computed 102 invariants in 17 ms
[2024-06-01 01:18:10] [INFO ] Implicit Places using invariants in 942 ms returned [16, 181, 203, 211, 216, 224]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 945 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/238 places, 204/206 transitions.
Applied a total of 0 rules in 15 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 977 ms. Remains : 224/238 places, 204/206 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-11
Product exploration explored 100000 steps with 2058 reset in 762 ms.
Product exploration explored 100000 steps with 2048 reset in 434 ms.
Computed a total of 224 stabilizing places and 204 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 224 transition count 204
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 15 factoid took 2760 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3623 steps (67 resets) in 60 ms. (59 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 15 factoid took 4241 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 204/204 transitions.
Applied a total of 0 rules in 9 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
// Phase 1: matrix 204 rows 224 cols
[2024-06-01 01:18:19] [INFO ] Computed 96 invariants in 24 ms
[2024-06-01 01:18:20] [INFO ] Implicit Places using invariants in 938 ms returned []
[2024-06-01 01:18:20] [INFO ] Invariant cache hit.
[2024-06-01 01:18:21] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1719 ms to find 0 implicit places.
[2024-06-01 01:18:21] [INFO ] Redundant transitions in 2 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-01 01:18:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 224/224 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 96/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 204/428 variables, 224/544 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/428 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 544 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12225 ms.
Refiners :[Domain max(s): 224/224 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 224/224 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 96/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 204/428 variables, 224/544 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 198/742 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/428 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 742 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30010 ms.
Refiners :[Domain max(s): 224/224 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 42314ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 42317ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44052 ms. Remains : 224/224 places, 204/204 transitions.
Computed a total of 224 stabilizing places and 204 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 224 transition count 204
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 15 factoid took 2376 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1565 steps (28 resets) in 11 ms. (130 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 15 factoid took 4068 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 282 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2023 reset in 644 ms.
Product exploration explored 100000 steps with 2055 reset in 549 ms.
Support contains 5 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 204/204 transitions.
Applied a total of 0 rules in 9 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-06-01 01:19:12] [INFO ] Invariant cache hit.
[2024-06-01 01:19:13] [INFO ] Implicit Places using invariants in 933 ms returned []
[2024-06-01 01:19:13] [INFO ] Invariant cache hit.
[2024-06-01 01:19:14] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
[2024-06-01 01:19:14] [INFO ] Redundant transitions in 2 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-01 01:19:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 224/224 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 96/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 204/428 variables, 224/544 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/428 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 544 constraints, problems are : Problem set: 0 solved, 198 unsolved in 13475 ms.
Refiners :[Domain max(s): 224/224 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 224/224 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 96/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 204/428 variables, 224/544 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 198/742 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/428 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 742 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30011 ms.
Refiners :[Domain max(s): 224/224 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 43571ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 43575ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45449 ms. Remains : 224/224 places, 204/204 transitions.
Treatment of property Echo-PT-d03r03-LTLCardinality-11 finished in 108502 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(p1)||p0))))'
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 2 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2024-06-01 01:19:57] [INFO ] Computed 108 invariants in 14 ms
[2024-06-01 01:19:59] [INFO ] Implicit Places using invariants in 1183 ms returned []
[2024-06-01 01:19:59] [INFO ] Invariant cache hit.
[2024-06-01 01:20:00] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 2449 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-06-01 01:20:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 584 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30009 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 206/444 variables, 238/584 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 205/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 789 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30010 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Finished structural reductions in LTL mode , in 1 iterations and 62566 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 390 ms.
Product exploration explored 100000 steps with 33333 reset in 352 ms.
Computed a total of 238 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r03-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r03-LTLCardinality-15 finished in 63624 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((X((X(p1) U p1))&&p0)))))'
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(((F(p0)||(p1 U p2))&&(F(p0)||G(p1))))))'
[2024-06-01 01:21:02] [INFO ] Flatten gal took : 43 ms
[2024-06-01 01:21:02] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 01:21:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 238 places, 206 transitions and 1149 arcs took 7 ms.
Total runtime 597693 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Echo-PT-d03r03-LTLCardinality-02
Could not compute solution for formula : Echo-PT-d03r03-LTLCardinality-10
Could not compute solution for formula : Echo-PT-d03r03-LTLCardinality-11

BK_STOP 1717205001229

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name Echo-PT-d03r03-LTLCardinality-02
ltl formula formula --ltl=/tmp/1359/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 238 places, 206 transitions and 1149 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.020 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1359/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1359/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1359/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1359/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 240 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 239, there are 215 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~53 levels ~10000 states ~41640 transitions
pnml2lts-mc( 3/ 4): ~53 levels ~20000 states ~92556 transitions
pnml2lts-mc( 3/ 4): ~53 levels ~40000 states ~197632 transitions
pnml2lts-mc( 3/ 4): ~53 levels ~80000 states ~433880 transitions
pnml2lts-mc( 0/ 4): ~53 levels ~160000 states ~486652 transitions
pnml2lts-mc( 0/ 4): ~53 levels ~320000 states ~1049336 transitions
pnml2lts-mc( 0/ 4): ~53 levels ~640000 states ~2257924 transitions
pnml2lts-mc( 0/ 4): ~53 levels ~1280000 states ~5279240 transitions
pnml2lts-mc( 0/ 4): ~53 levels ~2560000 states ~11720440 transitions
pnml2lts-mc( 0/ 4): ~53 levels ~5120000 states ~23995752 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5764353
pnml2lts-mc( 0/ 4): unique states count: 5764482
pnml2lts-mc( 0/ 4): unique transitions count: 39007060
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 33240965
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 5764489
pnml2lts-mc( 0/ 4): - cum. max stack depth: 214
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5764489 states 39007093 transitions, fanout: 6.767
pnml2lts-mc( 0/ 4): Total exploration time 41.360 sec (41.350 sec minimum, 41.353 sec on average)
pnml2lts-mc( 0/ 4): States per second: 139374, Transitions per second: 943112
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 108.0MB, 19.6 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 17.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 206 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 108.0MB (~256.0MB paged-in)
ltl formula name Echo-PT-d03r03-LTLCardinality-10
ltl formula formula --ltl=/tmp/1359/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 238 places, 206 transitions and 1149 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1359/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1359/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1359/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1359/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 240 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 239, there are 239 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~43 levels ~10000 states ~19844 transitions
pnml2lts-mc( 1/ 4): ~44 levels ~20000 states ~39964 transitions
pnml2lts-mc( 1/ 4): ~44 levels ~40000 states ~80292 transitions
pnml2lts-mc( 1/ 4): ~44 levels ~80000 states ~168360 transitions
pnml2lts-mc( 1/ 4): ~44 levels ~160000 states ~356236 transitions
pnml2lts-mc( 3/ 4): ~46 levels ~320000 states ~711860 transitions
pnml2lts-mc( 3/ 4): ~46 levels ~640000 states ~1500720 transitions
pnml2lts-mc( 3/ 4): ~46 levels ~1280000 states ~3078588 transitions
pnml2lts-mc( 3/ 4): ~46 levels ~2560000 states ~6266660 transitions
pnml2lts-mc( 3/ 4): ~46 levels ~5120000 states ~12914884 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6768777
pnml2lts-mc( 0/ 4): unique states count: 6768892
pnml2lts-mc( 0/ 4): unique transitions count: 23841960
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 17071047
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6768899
pnml2lts-mc( 0/ 4): - cum. max stack depth: 196
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6768899 states 23841991 transitions, fanout: 3.522
pnml2lts-mc( 0/ 4): Total exploration time 39.690 sec (39.560 sec minimum, 39.603 sec on average)
pnml2lts-mc( 0/ 4): States per second: 170544, Transitions per second: 600705
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 115.7MB, 17.9 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 20.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 206 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 115.7MB (~256.0MB paged-in)
ltl formula name Echo-PT-d03r03-LTLCardinality-11
ltl formula formula --ltl=/tmp/1359/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 238 places, 206 transitions and 1149 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1359/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1359/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1359/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1359/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 239 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 239, there are 335 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~55 levels ~10000 states ~43180 transitions
pnml2lts-mc( 1/ 4): ~55 levels ~20000 states ~96664 transitions
pnml2lts-mc( 1/ 4): ~55 levels ~40000 states ~203984 transitions
pnml2lts-mc( 1/ 4): ~55 levels ~80000 states ~448964 transitions
pnml2lts-mc( 1/ 4): ~55 levels ~160000 states ~932788 transitions
pnml2lts-mc( 1/ 4): ~55 levels ~320000 states ~1930192 transitions
pnml2lts-mc( 0/ 4): ~55 levels ~640000 states ~3785004 transitions
pnml2lts-mc( 0/ 4): ~55 levels ~1280000 states ~8102028 transitions
pnml2lts-mc( 0/ 4): ~55 levels ~2560000 states ~17220260 transitions
pnml2lts-mc( 0/ 4): ~55 levels ~5120000 states ~36036936 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6977707
pnml2lts-mc( 0/ 4): unique states count: 6977830
pnml2lts-mc( 0/ 4): unique transitions count: 54335580
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 47355944
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6977838
pnml2lts-mc( 0/ 4): - cum. max stack depth: 215
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6977838 states 54335618 transitions, fanout: 7.787
pnml2lts-mc( 0/ 4): Total exploration time 55.620 sec (55.520 sec minimum, 55.548 sec on average)
pnml2lts-mc( 0/ 4): States per second: 125456, Transitions per second: 976908
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 117.3MB, 17.6 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 20.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 206 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 117.3MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Echo-PT-d03r03, 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 r492-smll-171636266200107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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