About the Execution of ITS-Tools for CSRepetitions-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
313.296 | 8938.00 | 18278.00 | 105.50 | FFFFFFFFFFFFFFTF | 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.r070-tall-171620505400228.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CSRepetitions-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505400228
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 12K Apr 12 09:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 09:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 09:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 09:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.8K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 09:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 09:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 39K Apr 12 09:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 218K Apr 12 09:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 26K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716273592197
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 06:39:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 06:39:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 06:39:53] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2024-05-21 06:39:53] [INFO ] Transformed 23 places.
[2024-05-21 06:39:53] [INFO ] Transformed 28 transitions.
[2024-05-21 06:39:53] [INFO ] Parsed PT model containing 23 places and 28 transitions and 92 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CSRepetitions-PT-02-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 7 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2024-05-21 06:39:53] [INFO ] Computed 6 invariants in 6 ms
[2024-05-21 06:39:53] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-21 06:39:53] [INFO ] Invariant cache hit.
[2024-05-21 06:39:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:39:53] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 24 sub problems to find dead transitions.
[2024-05-21 06:39:53] [INFO ] Invariant cache hit.
[2024-05-21 06:39:53] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 4/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 33 constraints, problems are : Problem set: 0 solved, 24 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 4/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 57 constraints, problems are : Problem set: 0 solved, 24 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 552ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 562ms
Finished structural reductions in LTL mode , in 1 iterations and 805 ms. Remains : 23/23 places, 28/28 transitions.
Support contains 23 out of 23 places after structural reductions.
[2024-05-21 06:39:54] [INFO ] Flatten gal took : 16 ms
[2024-05-21 06:39:54] [INFO ] Flatten gal took : 5 ms
[2024-05-21 06:39:54] [INFO ] Input system was already deterministic with 28 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 757 steps (38 resets) in 47 ms. (15 steps per ms) remains 0/17 properties
FORMULA CSRepetitions-PT-02-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CSRepetitions-PT-02-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 4 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&F(p0)&&X(X(X(G(!p0)))))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-21 06:39:54] [INFO ] Invariant cache hit.
[2024-05-21 06:39:54] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 06:39:54] [INFO ] Invariant cache hit.
[2024-05-21 06:39:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:39:54] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 24 sub problems to find dead transitions.
[2024-05-21 06:39:54] [INFO ] Invariant cache hit.
[2024-05-21 06:39:54] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 4/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 33 constraints, problems are : Problem set: 0 solved, 24 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 4/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 57 constraints, problems are : Problem set: 0 solved, 24 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 418ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 419ms
Finished structural reductions in LTL mode , in 1 iterations and 496 ms. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 482 ms :[true, (NOT p0), p0, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-00
Stuttering criterion allowed to conclude after 30 steps with 1 reset in 3 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-00 finished in 1039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||X(G(p1))))))'
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-21 06:39:55] [INFO ] Invariant cache hit.
[2024-05-21 06:39:55] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 06:39:55] [INFO ] Invariant cache hit.
[2024-05-21 06:39:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:39:55] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 24 sub problems to find dead transitions.
[2024-05-21 06:39:55] [INFO ] Invariant cache hit.
[2024-05-21 06:39:55] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 4/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 33 constraints, problems are : Problem set: 0 solved, 24 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 4/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 57 constraints, problems are : Problem set: 0 solved, 24 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 424ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 425ms
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-01
Product exploration explored 100000 steps with 26579 reset in 260 ms.
Stack based approach found an accepted trace after 1660 steps with 440 reset with depth 12 and stack size 12 in 3 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-01 finished in 945 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&&(X(p1)||F(p2))))))'
Support contains 20 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 5 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-21 06:39:56] [INFO ] Invariant cache hit.
[2024-05-21 06:39:56] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 06:39:56] [INFO ] Invariant cache hit.
[2024-05-21 06:39:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:39:56] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-21 06:39:56] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-21 06:39:56] [INFO ] Invariant cache hit.
[2024-05-21 06:39:56] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 4/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 33 constraints, problems are : Problem set: 0 solved, 24 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 4/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 57 constraints, problems are : Problem set: 0 solved, 24 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 438ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 439ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 508 ms. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-02
Stuttering criterion allowed to conclude after 41 steps with 3 reset in 0 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-02 finished in 694 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 13 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 5 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-21 06:39:57] [INFO ] Invariant cache hit.
[2024-05-21 06:39:57] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 06:39:57] [INFO ] Invariant cache hit.
[2024-05-21 06:39:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:39:57] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-21 06:39:57] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-21 06:39:57] [INFO ] Invariant cache hit.
[2024-05-21 06:39:57] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 4/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 33 constraints, problems are : Problem set: 0 solved, 24 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 4/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 57 constraints, problems are : Problem set: 0 solved, 24 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 423ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 424ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 489 ms. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-03
Stuttering criterion allowed to conclude after 85 steps with 12 reset in 1 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-03 finished in 579 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)&&(G(!p1)||G(p2)))))'
Support contains 17 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-21 06:39:58] [INFO ] Invariant cache hit.
[2024-05-21 06:39:58] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 06:39:58] [INFO ] Invariant cache hit.
[2024-05-21 06:39:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:39:58] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-21 06:39:58] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-21 06:39:58] [INFO ] Invariant cache hit.
[2024-05-21 06:39:58] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 4/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 33 constraints, problems are : Problem set: 0 solved, 24 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 4/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 57 constraints, problems are : Problem set: 0 solved, 24 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 375ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 376ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 441 ms. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND p1 p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-04
Entered a terminal (fully accepting) state of product in 196 steps with 68 reset in 2 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-04 finished in 650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-21 06:39:58] [INFO ] Invariant cache hit.
[2024-05-21 06:39:58] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 06:39:58] [INFO ] Invariant cache hit.
[2024-05-21 06:39:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:39:58] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Running 24 sub problems to find dead transitions.
[2024-05-21 06:39:58] [INFO ] Invariant cache hit.
[2024-05-21 06:39:58] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 4/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 33 constraints, problems are : Problem set: 0 solved, 24 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 4/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 57 constraints, problems are : Problem set: 0 solved, 24 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 381ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 382ms
Finished structural reductions in LTL mode , in 1 iterations and 439 ms. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-09
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-09 finished in 619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(F(p1))))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-21 06:39:59] [INFO ] Invariant cache hit.
[2024-05-21 06:39:59] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 06:39:59] [INFO ] Invariant cache hit.
[2024-05-21 06:39:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:39:59] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 24 sub problems to find dead transitions.
[2024-05-21 06:39:59] [INFO ] Invariant cache hit.
[2024-05-21 06:39:59] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 4/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 33 constraints, problems are : Problem set: 0 solved, 24 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 4/23 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 57 constraints, problems are : Problem set: 0 solved, 24 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 383ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 384ms
Finished structural reductions in LTL mode , in 1 iterations and 451 ms. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-10
Stuttering criterion allowed to conclude after 334 steps with 101 reset in 2 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-10 finished in 630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&X(X(G(!p1))))))))'
Support contains 1 out of 23 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 : 23/23 places, 28/28 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 17 transition count 25
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 13 transition count 21
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 13 transition count 21
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 21 place count 11 transition count 19
Applied a total of 21 rules in 19 ms. Remains 11 /23 variables (removed 12) and now considering 19/28 (removed 9) transitions.
[2024-05-21 06:40:00] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 11 cols
[2024-05-21 06:40:00] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 06:40:00] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 06:40:00] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2024-05-21 06:40:00] [INFO ] Invariant cache hit.
[2024-05-21 06:40:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 06:40:00] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-21 06:40:00] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-21 06:40:00] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2024-05-21 06:40:00] [INFO ] Invariant cache hit.
[2024-05-21 06:40:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/27 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 15 constraints, problems are : Problem set: 0 solved, 15 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/27 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/27 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 30 constraints, problems are : Problem set: 0 solved, 15 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 187ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 187ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/23 places, 19/28 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 11/23 places, 19/28 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-12
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-12 finished in 304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 17 transition count 25
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 13 transition count 21
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 13 transition count 21
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 12 transition count 18
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 12 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 12 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 11 transition count 16
Applied a total of 22 rules in 9 ms. Remains 11 /23 variables (removed 12) and now considering 16/28 (removed 12) transitions.
// Phase 1: matrix 16 rows 11 cols
[2024-05-21 06:40:00] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 06:40:00] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 06:40:00] [INFO ] Invariant cache hit.
[2024-05-21 06:40:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 06:40:00] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-21 06:40:00] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-21 06:40:00] [INFO ] Invariant cache hit.
[2024-05-21 06:40:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 16/27 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 15 constraints, problems are : Problem set: 0 solved, 13 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 16/27 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 28 constraints, problems are : Problem set: 0 solved, 13 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 190ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 191ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/23 places, 16/28 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 11/23 places, 16/28 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-13
Stuttering criterion allowed to conclude after 24 steps with 1 reset in 0 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-13 finished in 347 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 U p1) U !p2))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 17 transition count 25
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 13 transition count 21
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 13 transition count 21
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 12 transition count 18
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 12 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 12 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 11 transition count 16
Applied a total of 22 rules in 7 ms. Remains 11 /23 variables (removed 12) and now considering 16/28 (removed 12) transitions.
[2024-05-21 06:40:00] [INFO ] Invariant cache hit.
[2024-05-21 06:40:00] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 06:40:00] [INFO ] Invariant cache hit.
[2024-05-21 06:40:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 06:40:00] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-21 06:40:00] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-21 06:40:00] [INFO ] Invariant cache hit.
[2024-05-21 06:40:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 16/27 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 15 constraints, problems are : Problem set: 0 solved, 13 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 16/27 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 28 constraints, problems are : Problem set: 0 solved, 13 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 178ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 178ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/23 places, 16/28 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 241 ms. Remains : 11/23 places, 16/28 transitions.
Stuttering acceptance computed with spot in 137 ms :[p2, (AND (NOT p1) p2), p2]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-15
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 2 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-15 finished in 400 ms.
All properties solved by simple procedures.
Total runtime 7793 ms.
BK_STOP 1716273601135
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-PT-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CSRepetitions-PT-02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505400228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-02.tgz
mv CSRepetitions-PT-02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;