About the Execution of ITS-Tools for DoubleExponent-PT-002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 480.403 | 22807.00 | 44049.00 | 237.80 | FFTFTTFTFFFTTTFT | normal |
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.r136-tall-171631132900531.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 DoubleExponent-PT-002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132900531
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Apr 12 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 33K 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 DoubleExponent-PT-002-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716384985151
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 13:36:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 13:36:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:36:26] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2024-05-22 13:36:26] [INFO ] Transformed 110 places.
[2024-05-22 13:36:26] [INFO ] Transformed 98 transitions.
[2024-05-22 13:36:26] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-002-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 98
Applied a total of 3 rules in 20 ms. Remains 107 /110 variables (removed 3) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 107 cols
[2024-05-22 13:36:26] [INFO ] Computed 11 invariants in 21 ms
[2024-05-22 13:36:26] [INFO ] Implicit Places using invariants in 193 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 225 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/110 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 97
Applied a total of 2 rules in 10 ms. Remains 105 /106 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 105 cols
[2024-05-22 13:36:26] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 13:36:27] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 13:36:27] [INFO ] Invariant cache hit.
[2024-05-22 13:36:27] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 105/110 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 444 ms. Remains : 105/110 places, 97/98 transitions.
Support contains 34 out of 105 places after structural reductions.
[2024-05-22 13:36:27] [INFO ] Flatten gal took : 28 ms
[2024-05-22 13:36:27] [INFO ] Flatten gal took : 11 ms
[2024-05-22 13:36:27] [INFO ] Input system was already deterministic with 97 transitions.
Support contains 32 out of 105 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (1311 resets) in 1887 ms. (21 steps per ms) remains 26/32 properties
BEST_FIRST walk for 4001 steps (112 resets) in 140 ms. (28 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (116 resets) in 44 ms. (88 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (112 resets) in 44 ms. (88 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (114 resets) in 100 ms. (39 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (115 resets) in 22 ms. (173 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (112 resets) in 41 ms. (95 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (113 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (108 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (109 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (112 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (111 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (113 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (114 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (109 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (107 resets) in 22 ms. (173 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (115 resets) in 31 ms. (125 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (107 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (114 resets) in 31 ms. (125 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (115 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (119 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (106 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (113 resets) in 22 ms. (173 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (118 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (112 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (105 resets) in 31 ms. (125 steps per ms) remains 23/26 properties
BEST_FIRST walk for 4000 steps (116 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
[2024-05-22 13:36:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 13/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 50/86 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 1/87 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 7 (OVERLAPS) 90/177 variables, 87/97 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/97 constraints. Problems are: Problem set: 2 solved, 21 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 9 (OVERLAPS) 20/197 variables, 14/111 constraints. Problems are: Problem set: 6 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/111 constraints. Problems are: Problem set: 6 solved, 17 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 11 (OVERLAPS) 5/202 variables, 4/115 constraints. Problems are: Problem set: 17 solved, 6 unsolved
[2024-05-22 13:36:29] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 29 ms to minimize.
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 1/116 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 0/116 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/202 variables, 0/116 constraints. Problems are: Problem set: 19 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 116 constraints, problems are : Problem set: 19 solved, 4 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 19 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 2/2 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 52/73 variables, 6/8 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/83 variables, 2/10 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/10 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 86/169 variables, 83/93 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 1/94 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/94 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 26/195 variables, 17/111 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 3/114 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 1/115 constraints. Problems are: Problem set: 19 solved, 4 unsolved
[2024-05-22 13:36:29] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 1/116 constraints. Problems are: Problem set: 19 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/195 variables, 0/116 constraints. Problems are: Problem set: 19 solved, 4 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 15 (OVERLAPS) 7/202 variables, 5/121 constraints. Problems are: Problem set: 20 solved, 3 unsolved
[2024-05-22 13:36:29] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-22 13:36:29] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/202 variables, 2/123 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/202 variables, 0/123 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/202 variables, 0/123 constraints. Problems are: Problem set: 20 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 123 constraints, problems are : Problem set: 20 solved, 3 unsolved in 678 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 4/23 constraints, Known Traps: 4/4 constraints]
After SMT, in 1365ms problems are : Problem set: 20 solved, 3 unsolved
Parikh walk visited 0 properties in 1234 ms.
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 97/97 transitions.
Graph (complete) has 171 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 102 transition count 75
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 82 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 80 transition count 73
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 46 place count 80 transition count 68
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 56 place count 75 transition count 68
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 94 place count 56 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 98 place count 54 transition count 49
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 104 place count 54 transition count 43
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 110 place count 48 transition count 43
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 118 place count 48 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 47 transition count 42
Applied a total of 119 rules in 38 ms. Remains 47 /105 variables (removed 58) and now considering 42/97 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 47/105 places, 42/97 transitions.
RANDOM walk for 40000 steps (4089 resets) in 296 ms. (134 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (2871 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (2900 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
// Phase 1: matrix 42 rows 47 cols
[2024-05-22 13:36:31] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 13:36:31] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/47 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/89 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/89 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 62 constraints, problems are : Problem set: 0 solved, 2 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 47/47 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 13:36:31] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-22 13:36:31] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-22 13:36:31] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 10/47 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 13:36:31] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-22 13:36:31] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-22 13:36:31] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/89 variables, 47/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/89 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 70 constraints, problems are : Problem set: 0 solved, 2 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 47/47 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 408ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 206 ms.
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 47/47 places, 42/42 transitions.
RANDOM walk for 40000 steps (4071 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (2897 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (2877 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 966 steps, run visited all 2 properties in 30 ms. (steps per millisecond=32 )
Probabilistic random walk after 966 steps, saw 498 distinct states, run finished after 34 ms. (steps per millisecond=28 ) properties seen :2
Successfully simplified 20 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleExponent-PT-002-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 171 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
FORMULA DoubleExponent-PT-002-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-15 TRUE 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' '!(F((p0||X(X(p1)))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 97/97 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 97
Applied a total of 1 rules in 4 ms. Remains 104 /105 variables (removed 1) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 104 cols
[2024-05-22 13:36:32] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 13:36:32] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 13:36:32] [INFO ] Invariant cache hit.
[2024-05-22 13:36:32] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-22 13:36:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-22 13:36:33] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-22 13:36:33] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/201 variables, 104/116 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-22 13:36:33] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-22 13:36:33] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-22 13:36:34] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-22 13:36:34] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-22 13:36:35] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:36:35] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 4 ms to minimize.
[2024-05-22 13:36:35] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/201 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 0/201 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 123 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4261 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/201 variables, 104/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 96/219 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-22 13:36:38] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 220 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4489 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 10/10 constraints]
After SMT, in 8785ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8787ms
Starting structural reductions in LTL mode, iteration 1 : 104/105 places, 97/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8959 ms. Remains : 104/105 places, 97/97 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-00
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLCardinality-00 finished in 9242 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(p0)))'
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 97/97 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 97
Applied a total of 1 rules in 5 ms. Remains 104 /105 variables (removed 1) and now considering 97/97 (removed 0) transitions.
[2024-05-22 13:36:41] [INFO ] Invariant cache hit.
[2024-05-22 13:36:41] [INFO ] Implicit Places using invariants in 48 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/105 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 103/105 places, 97/97 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLCardinality-01 finished in 149 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&&(p1 U p2)))))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 97/97 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 97
Applied a total of 1 rules in 6 ms. Remains 104 /105 variables (removed 1) and now considering 97/97 (removed 0) transitions.
[2024-05-22 13:36:41] [INFO ] Invariant cache hit.
[2024-05-22 13:36:41] [INFO ] Implicit Places using invariants in 46 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/105 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 103/105 places, 97/97 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-03
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLCardinality-03 finished in 211 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)&&(G(!p1)||G(F(p2)))))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 97/97 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 97
Applied a total of 1 rules in 1 ms. Remains 104 /105 variables (removed 1) and now considering 97/97 (removed 0) transitions.
[2024-05-22 13:36:41] [INFO ] Invariant cache hit.
[2024-05-22 13:36:41] [INFO ] Implicit Places using invariants in 51 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/105 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 103/105 places, 97/97 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p2) p1), true]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-05
Product exploration explored 100000 steps with 6198 reset in 171 ms.
Product exploration explored 100000 steps with 6244 reset in 134 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p1 (NOT p2)))), (X p0), (X p2), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 185 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND p1 (NOT p2)), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1333 resets) in 209 ms. (190 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40000 steps (1145 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
// Phase 1: matrix 97 rows 103 cols
[2024-05-22 13:36:42] [INFO ] Computed 9 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/58 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/76 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 79/155 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 31/186 variables, 19/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/194 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/199 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 200/200 variables, and 112 constraints, problems are : Problem set: 1 solved, 0 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 86ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p1 (NOT p2)))), (X p0), (X p2), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT p1))), (G (OR p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1)]
Knowledge based reduction with 9 factoid took 178 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 120 ms :[(AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Support contains 3 out of 103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Graph (complete) has 167 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 101 transition count 75
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 81 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 79 transition count 73
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 45 place count 79 transition count 68
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 55 place count 74 transition count 68
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 95 place count 54 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 52 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 51 transition count 47
Applied a total of 100 rules in 24 ms. Remains 51 /103 variables (removed 52) and now considering 47/97 (removed 50) transitions.
// Phase 1: matrix 47 rows 51 cols
[2024-05-22 13:36:43] [INFO ] Computed 9 invariants in 2 ms
[2024-05-22 13:36:43] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 13:36:43] [INFO ] Invariant cache hit.
[2024-05-22 13:36:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 13:36:43] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-22 13:36:43] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-22 13:36:43] [INFO ] Invariant cache hit.
[2024-05-22 13:36:43] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 47/97 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 1/98 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 62 constraints, problems are : Problem set: 0 solved, 46 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 47/97 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 43/104 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/98 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-22 13:36:44] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/98 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 109 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1178 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 1/1 constraints]
After SMT, in 1772ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1773ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/103 places, 47/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1904 ms. Remains : 51/103 places, 47/97 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 138 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 91 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND p1 (NOT p2)), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (4132 resets) in 92 ms. (430 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (2670 resets) in 31 ms. (1250 steps per ms) remains 1/2 properties
[2024-05-22 13:36:45] [INFO ] Invariant cache hit.
[2024-05-22 13:36:45] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/31 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/33 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/71 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/94 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/94 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/95 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/95 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/95 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 98/98 variables, and 61 constraints, problems are : Problem set: 1 solved, 0 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 1/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 50ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (G (OR p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1)]
Knowledge based reduction with 8 factoid took 174 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 127 ms :[(AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 108 ms :[(AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 10233 reset in 85 ms.
Product exploration explored 100000 steps with 10241 reset in 130 ms.
Built C files in :
/tmp/ltsmin16659666218550687086
[2024-05-22 13:36:46] [INFO ] Computing symmetric may disable matrix : 47 transitions.
[2024-05-22 13:36:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 13:36:46] [INFO ] Computing symmetric may enable matrix : 47 transitions.
[2024-05-22 13:36:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 13:36:46] [INFO ] Computing Do-Not-Accords matrix : 47 transitions.
[2024-05-22 13:36:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 13:36:46] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16659666218550687086
Running compilation step : cd /tmp/ltsmin16659666218550687086;'/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 400 ms.
Running link step : cd /tmp/ltsmin16659666218550687086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16659666218550687086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17377272729560278461.hoa' '--buchi-type=spotba'
LTSmin run took 325 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-002-LTLCardinality-05 finished in 5395 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 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 97/97 transitions.
Graph (complete) has 171 edges and 105 vertex of which 103 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 102 transition count 72
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 79 transition count 72
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 47 place count 79 transition count 68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 55 place count 75 transition count 68
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 93 place count 56 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 54 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 53 transition count 48
Applied a total of 98 rules in 14 ms. Remains 53 /105 variables (removed 52) and now considering 48/97 (removed 49) transitions.
// Phase 1: matrix 48 rows 53 cols
[2024-05-22 13:36:47] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 13:36:47] [INFO ] Implicit Places using invariants in 37 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/105 places, 48/97 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 50 transition count 46
Applied a total of 4 rules in 3 ms. Remains 50 /52 variables (removed 2) and now considering 46/48 (removed 2) transitions.
// Phase 1: matrix 46 rows 50 cols
[2024-05-22 13:36:47] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 13:36:47] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 13:36:47] [INFO ] Invariant cache hit.
[2024-05-22 13:36:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 13:36:47] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/105 places, 46/97 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 160 ms. Remains : 50/105 places, 46/97 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-08
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLCardinality-08 finished in 206 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)&&F(p1))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 97/97 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 97
Applied a total of 1 rules in 19 ms. Remains 104 /105 variables (removed 1) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 104 cols
[2024-05-22 13:36:47] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 13:36:47] [INFO ] Implicit Places using invariants in 70 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/105 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 103/105 places, 97/97 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Product exploration explored 100000 steps with 50000 reset in 102 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-002-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLCardinality-11 finished in 487 ms.
All properties solved by simple procedures.
Total runtime 21598 ms.
BK_STOP 1716385007958
--------------------
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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r136-tall-171631132900531"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 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 '
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 ;