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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K 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 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 07:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 07:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 07:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 07:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 81K May 18 16:43 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 NoC3x3-PT-1A-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-1A-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-1A-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-1A-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-1A-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-1A-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-1A-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-1A-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-1A-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-1A-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-1A-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-1A-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-1A-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-1A-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-1A-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-1A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717239993047

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-1A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:06:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:06:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:06:34] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-01 11:06:34] [INFO ] Transformed 165 places.
[2024-06-01 11:06:34] [INFO ] Transformed 355 transitions.
[2024-06-01 11:06:34] [INFO ] Found NUPN structural information;
[2024-06-01 11:06:34] [INFO ] Parsed PT model containing 165 places and 355 transitions and 1069 arcs in 172 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.
Ensure Unique test removed 108 transitions
Reduce redundant transitions removed 108 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-1A-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 247/247 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 146 transition count 219
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 146 transition count 219
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 63 place count 146 transition count 194
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 68 place count 141 transition count 194
Applied a total of 68 rules in 42 ms. Remains 141 /165 variables (removed 24) and now considering 194/247 (removed 53) transitions.
// Phase 1: matrix 194 rows 141 cols
[2024-06-01 11:06:34] [INFO ] Computed 35 invariants in 18 ms
[2024-06-01 11:06:34] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-06-01 11:06:34] [INFO ] Invariant cache hit.
[2024-06-01 11:06:34] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-06-01 11:06:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 1/141 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/335 variables, 141/176 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 176 constraints, problems are : Problem set: 0 solved, 193 unsolved in 5257 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 1/141 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/335 variables, 141/176 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 193/369 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/335 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 369 constraints, problems are : Problem set: 0 solved, 193 unsolved in 5695 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
After SMT, in 11037ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 11050ms
Starting structural reductions in LTL mode, iteration 1 : 141/165 places, 194/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11520 ms. Remains : 141/165 places, 194/247 transitions.
Support contains 25 out of 141 places after structural reductions.
[2024-06-01 11:06:46] [INFO ] Flatten gal took : 39 ms
[2024-06-01 11:06:46] [INFO ] Flatten gal took : 18 ms
[2024-06-01 11:06:46] [INFO ] Input system was already deterministic with 194 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 31344 steps (7 resets) in 981 ms. (31 steps per ms) remains 0/16 properties
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 447 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 194/194 transitions.
Graph (trivial) has 86 edges and 141 vertex of which 46 / 141 are part of one of the 20 SCC in 5 ms
Free SCC test removed 26 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Graph (complete) has 395 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 107 transition count 122
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 41 place count 93 transition count 122
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 49 place count 85 transition count 114
Iterating global reduction 2 with 8 rules applied. Total rules applied 57 place count 85 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 71 place count 85 transition count 100
Applied a total of 71 rules in 52 ms. Remains 85 /141 variables (removed 56) and now considering 100/194 (removed 94) transitions.
// Phase 1: matrix 100 rows 85 cols
[2024-06-01 11:06:47] [INFO ] Computed 28 invariants in 3 ms
[2024-06-01 11:06:47] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 11:06:47] [INFO ] Invariant cache hit.
[2024-06-01 11:06:47] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 11:06:47] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-06-01 11:06:47] [INFO ] Redundant transitions in 37 ms returned []
Running 85 sub problems to find dead transitions.
[2024-06-01 11:06:47] [INFO ] Invariant cache hit.
[2024-06-01 11:06:47] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 99/184 variables, 85/113 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 28/141 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 0/184 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/185 variables, and 141 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1190 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 85/85 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 99/184 variables, 85/113 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 28/141 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 85/226 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 0/184 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/185 variables, and 226 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1152 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 85/85 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
After SMT, in 2367ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 2369ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/141 places, 100/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2623 ms. Remains : 85/141 places, 100/194 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLCardinality-02
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-1A-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLCardinality-02 finished in 2886 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&&F(G(p1)))))'
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 194/194 transitions.
Graph (trivial) has 86 edges and 141 vertex of which 46 / 141 are part of one of the 20 SCC in 0 ms
Free SCC test removed 26 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Graph (complete) has 395 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 107 transition count 122
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 41 place count 93 transition count 122
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 47 place count 87 transition count 116
Iterating global reduction 2 with 6 rules applied. Total rules applied 53 place count 87 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 67 place count 87 transition count 102
Applied a total of 67 rules in 19 ms. Remains 87 /141 variables (removed 54) and now considering 102/194 (removed 92) transitions.
// Phase 1: matrix 102 rows 87 cols
[2024-06-01 11:06:49] [INFO ] Computed 28 invariants in 4 ms
[2024-06-01 11:06:49] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 11:06:49] [INFO ] Invariant cache hit.
[2024-06-01 11:06:49] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 11:06:50] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-06-01 11:06:50] [INFO ] Redundant transitions in 42 ms returned []
Running 87 sub problems to find dead transitions.
[2024-06-01 11:06:50] [INFO ] Invariant cache hit.
[2024-06-01 11:06:50] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 101/188 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 28/143 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/189 variables, and 143 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1263 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 87/87 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 101/188 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 28/143 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 87/230 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/189 variables, and 230 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1218 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 87/87 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
After SMT, in 2500ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 2502ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/141 places, 102/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2707 ms. Remains : 87/141 places, 102/194 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1A-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLCardinality-03 finished in 2892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 194/194 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 194
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 133 transition count 187
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 133 transition count 187
Applied a total of 15 rules in 10 ms. Remains 133 /141 variables (removed 8) and now considering 187/194 (removed 7) transitions.
// Phase 1: matrix 187 rows 133 cols
[2024-06-01 11:06:52] [INFO ] Computed 34 invariants in 1 ms
[2024-06-01 11:06:52] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 11:06:52] [INFO ] Invariant cache hit.
[2024-06-01 11:06:52] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-06-01 11:06:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 187/320 variables, 133/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/320 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 167 constraints, problems are : Problem set: 0 solved, 186 unsolved in 3665 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 187/320 variables, 133/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 186/353 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/320 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 353 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4733 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 8436ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 8439ms
Starting structural reductions in LTL mode, iteration 1 : 133/141 places, 187/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8631 ms. Remains : 133/141 places, 187/194 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-1A-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 325 ms.
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 57 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-1A-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-1A-LTLCardinality-05 finished in 9453 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(G(p0))))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 194/194 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 194
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 131 transition count 185
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 131 transition count 185
Applied a total of 19 rules in 9 ms. Remains 131 /141 variables (removed 10) and now considering 185/194 (removed 9) transitions.
// Phase 1: matrix 185 rows 131 cols
[2024-06-01 11:07:02] [INFO ] Computed 34 invariants in 4 ms
[2024-06-01 11:07:02] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 11:07:02] [INFO ] Invariant cache hit.
[2024-06-01 11:07:02] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-06-01 11:07:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 165 constraints, problems are : Problem set: 0 solved, 184 unsolved in 3532 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 184/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 349 constraints, problems are : Problem set: 0 solved, 184 unsolved in 4443 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 8010ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 8012ms
Starting structural reductions in LTL mode, iteration 1 : 131/141 places, 185/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8301 ms. Remains : 131/141 places, 185/194 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLCardinality-06 finished in 8462 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(G(p0)))))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 194/194 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 194
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 132 transition count 186
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 132 transition count 186
Applied a total of 17 rules in 11 ms. Remains 132 /141 variables (removed 9) and now considering 186/194 (removed 8) transitions.
// Phase 1: matrix 186 rows 132 cols
[2024-06-01 11:07:10] [INFO ] Computed 34 invariants in 3 ms
[2024-06-01 11:07:10] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 11:07:10] [INFO ] Invariant cache hit.
[2024-06-01 11:07:10] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-06-01 11:07:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 166 constraints, problems are : Problem set: 0 solved, 185 unsolved in 3546 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 185/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 351 constraints, problems are : Problem set: 0 solved, 185 unsolved in 4551 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 8132ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 8134ms
Starting structural reductions in LTL mode, iteration 1 : 132/141 places, 186/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8326 ms. Remains : 132/141 places, 186/194 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 7376 steps with 0 reset in 24 ms.
FORMULA NoC3x3-PT-1A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLCardinality-07 finished in 8508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 194/194 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 194
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 133 transition count 187
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 133 transition count 187
Applied a total of 15 rules in 4 ms. Remains 133 /141 variables (removed 8) and now considering 187/194 (removed 7) transitions.
// Phase 1: matrix 187 rows 133 cols
[2024-06-01 11:07:19] [INFO ] Computed 34 invariants in 1 ms
[2024-06-01 11:07:19] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 11:07:19] [INFO ] Invariant cache hit.
[2024-06-01 11:07:19] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-06-01 11:07:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 187/320 variables, 133/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/320 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 167 constraints, problems are : Problem set: 0 solved, 186 unsolved in 3779 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 187/320 variables, 133/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 186/353 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/320 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 353 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4748 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 8558ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 8560ms
Starting structural reductions in LTL mode, iteration 1 : 133/141 places, 187/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8759 ms. Remains : 133/141 places, 187/194 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1A-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1A-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLCardinality-10 finished in 9016 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&&F(p1))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 194/194 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 194
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 131 transition count 185
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 131 transition count 185
Applied a total of 19 rules in 6 ms. Remains 131 /141 variables (removed 10) and now considering 185/194 (removed 9) transitions.
// Phase 1: matrix 185 rows 131 cols
[2024-06-01 11:07:28] [INFO ] Computed 34 invariants in 1 ms
[2024-06-01 11:07:28] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 11:07:28] [INFO ] Invariant cache hit.
[2024-06-01 11:07:28] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-06-01 11:07:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 165 constraints, problems are : Problem set: 0 solved, 184 unsolved in 3605 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 184/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 349 constraints, problems are : Problem set: 0 solved, 184 unsolved in 4428 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 8063ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 8066ms
Starting structural reductions in LTL mode, iteration 1 : 131/141 places, 185/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8243 ms. Remains : 131/141 places, 185/194 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NoC3x3-PT-1A-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1A-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLCardinality-11 finished in 8413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p0))))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 194/194 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 132 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 132 transition count 185
Applied a total of 18 rules in 3 ms. Remains 132 /141 variables (removed 9) and now considering 185/194 (removed 9) transitions.
// Phase 1: matrix 185 rows 132 cols
[2024-06-01 11:07:36] [INFO ] Computed 35 invariants in 1 ms
[2024-06-01 11:07:36] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 11:07:36] [INFO ] Invariant cache hit.
[2024-06-01 11:07:36] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-06-01 11:07:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/132 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/317 variables, 132/167 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 167 constraints, problems are : Problem set: 0 solved, 184 unsolved in 4521 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/132 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/317 variables, 132/167 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 184/351 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 351 constraints, problems are : Problem set: 0 solved, 184 unsolved in 5002 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 9551ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 9552ms
Starting structural reductions in LTL mode, iteration 1 : 132/141 places, 185/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9713 ms. Remains : 132/141 places, 185/194 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLCardinality-12
Product exploration explored 100000 steps with 4939 reset in 246 ms.
Stack based approach found an accepted trace after 37 steps with 2 reset with depth 14 and stack size 14 in 1 ms.
FORMULA NoC3x3-PT-1A-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-1A-LTLCardinality-12 finished in 10046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 194/194 transitions.
Graph (trivial) has 86 edges and 141 vertex of which 46 / 141 are part of one of the 20 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Graph (complete) has 395 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 107 transition count 124
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 37 place count 95 transition count 124
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 43 place count 89 transition count 118
Iterating global reduction 2 with 6 rules applied. Total rules applied 49 place count 89 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 63 place count 89 transition count 104
Applied a total of 63 rules in 18 ms. Remains 89 /141 variables (removed 52) and now considering 104/194 (removed 90) transitions.
// Phase 1: matrix 104 rows 89 cols
[2024-06-01 11:07:46] [INFO ] Computed 28 invariants in 1 ms
[2024-06-01 11:07:46] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 11:07:46] [INFO ] Invariant cache hit.
[2024-06-01 11:07:46] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 11:07:46] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-06-01 11:07:46] [INFO ] Redundant transitions in 30 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 11:07:46] [INFO ] Invariant cache hit.
[2024-06-01 11:07:46] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 103/192 variables, 89/117 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 28/145 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 0/192 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/193 variables, and 145 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1200 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 89/89 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 103/192 variables, 89/117 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 28/145 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 89/234 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/193 variables, and 234 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1204 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 89/89 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
After SMT, in 2417ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 2418ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/141 places, 104/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2587 ms. Remains : 89/141 places, 104/194 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1A-LTLCardinality-13
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLCardinality-13 finished in 2720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((X(F(p2))||p1))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 194/194 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 194
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 131 transition count 185
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 131 transition count 185
Applied a total of 19 rules in 10 ms. Remains 131 /141 variables (removed 10) and now considering 185/194 (removed 9) transitions.
// Phase 1: matrix 185 rows 131 cols
[2024-06-01 11:07:49] [INFO ] Computed 34 invariants in 6 ms
[2024-06-01 11:07:49] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 11:07:49] [INFO ] Invariant cache hit.
[2024-06-01 11:07:49] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-06-01 11:07:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 165 constraints, problems are : Problem set: 0 solved, 184 unsolved in 3616 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 184/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 349 constraints, problems are : Problem set: 0 solved, 184 unsolved in 4475 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 8118ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 8120ms
Starting structural reductions in LTL mode, iteration 1 : 131/141 places, 185/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8283 ms. Remains : 131/141 places, 185/194 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-1A-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 212 ms.
Product exploration explored 100000 steps with 33333 reset in 260 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 15 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-1A-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-1A-LTLCardinality-14 finished in 9006 ms.
All properties solved by simple procedures.
Total runtime 84220 ms.
ITS solved all properties within timeout

BK_STOP 1717240078425

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="NoC3x3-PT-1A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is NoC3x3-PT-1A, 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 r508-tall-171654351900555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-1A.tgz
mv NoC3x3-PT-1A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;