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.r488-tall-171631132600395.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 DiscoveryGPU-PT-08a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132600395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 01:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 01:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 01:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 12 01:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 28K 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 DiscoveryGPU-PT-08a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717192262158

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:51:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:51:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:51:03] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-31 21:51:03] [INFO ] Transformed 83 places.
[2024-05-31 21:51:03] [INFO ] Transformed 113 transitions.
[2024-05-31 21:51:03] [INFO ] Found NUPN structural information;
[2024-05-31 21:51:03] [INFO ] Parsed PT model containing 83 places and 113 transitions and 363 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 79 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 79 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 79 transition count 101
Applied a total of 16 rules in 25 ms. Remains 79 /83 variables (removed 4) and now considering 101/113 (removed 12) transitions.
// Phase 1: matrix 101 rows 79 cols
[2024-05-31 21:51:03] [INFO ] Computed 2 invariants in 12 ms
[2024-05-31 21:51:03] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-31 21:51:03] [INFO ] Invariant cache hit.
[2024-05-31 21:51:03] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-31 21:51:03] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-31 21:51:03] [INFO ] Invariant cache hit.
[2024-05-31 21:51:04] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/180 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 64/145 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/180 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 145 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2052 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/180 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 64/145 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 100/245 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 245 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1776 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 3885ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 3900ms
Starting structural reductions in LTL mode, iteration 1 : 79/83 places, 101/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4255 ms. Remains : 79/83 places, 101/113 transitions.
Support contains 34 out of 79 places after structural reductions.
[2024-05-31 21:51:08] [INFO ] Flatten gal took : 25 ms
[2024-05-31 21:51:08] [INFO ] Flatten gal took : 12 ms
[2024-05-31 21:51:08] [INFO ] Input system was already deterministic with 101 transitions.
RANDOM walk for 40000 steps (459 resets) in 869 ms. (45 steps per ms) remains 2/21 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (59 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
[2024-05-31 21:51:08] [INFO ] Invariant cache hit.
[2024-05-31 21:51:08] [INFO ] State equation strengthened by 64 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/29 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 38/67 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 30/97 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/97 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/97 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 25/122 variables, 12/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/122 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/122 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 21/143 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 18/161 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/161 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/161 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 5/166 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/166 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/166 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 4/170 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/170 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/170 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 4/174 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/174 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/174 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 4/178 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/178 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/178 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 2/180 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/180 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 0/180 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 145 constraints, problems are : Problem set: 0 solved, 2 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 5 (OVERLAPS) 18/29 variables, 11/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 12/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Int declared 67/180 variables, and 42 constraints, problems are : Problem set: 2 solved, 0 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 28/79 constraints, ReadFeed: 12/64 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 209ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 224 edges and 79 vertex of which 75 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 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 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Graph (complete) has 224 edges and 79 vertex of which 75 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 75 transition count 90
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 68 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 62 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 62 transition count 84
Applied a total of 27 rules in 19 ms. Remains 62 /79 variables (removed 17) and now considering 84/101 (removed 17) transitions.
// Phase 1: matrix 84 rows 62 cols
[2024-05-31 21:51:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:51:08] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-31 21:51:08] [INFO ] Invariant cache hit.
[2024-05-31 21:51:09] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:51:09] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 107 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/79 places, 84/101 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 45 transition count 68
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 39 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 39 transition count 56
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 33 transition count 44
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 33 transition count 44
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 27 transition count 38
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 27 transition count 38
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 21 transition count 26
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 21 transition count 26
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 16 transition count 21
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 16 transition count 21
Applied a total of 90 rules in 12 ms. Remains 16 /61 variables (removed 45) and now considering 21/84 (removed 63) transitions.
[2024-05-31 21:51:09] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 16 cols
[2024-05-31 21:51:09] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 21:51:09] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-31 21:51:09] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2024-05-31 21:51:09] [INFO ] Invariant cache hit.
[2024-05-31 21:51:09] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 21:51:09] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/79 places, 21/101 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 198 ms. Remains : 16/79 places, 21/101 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-01 finished in 452 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((G(p1)||(p1&&F(p2))))))'
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 75 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 75 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 71 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 71 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 69 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 69 transition count 91
Applied a total of 20 rules in 8 ms. Remains 69 /79 variables (removed 10) and now considering 91/101 (removed 10) transitions.
// Phase 1: matrix 91 rows 69 cols
[2024-05-31 21:51:09] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 21:51:09] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-31 21:51:09] [INFO ] Invariant cache hit.
[2024-05-31 21:51:09] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-31 21:51:09] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/79 places, 91/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 68/79 places, 91/101 transitions.
Stuttering acceptance computed with spot in 336 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 259 ms.
Product exploration explored 100000 steps with 50000 reset in 204 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 176 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 24 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-02 finished in 1001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(p1))||p0))))'
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 95
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 95
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 68 transition count 90
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 68 transition count 90
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 65 transition count 87
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 65 transition count 87
Applied a total of 28 rules in 5 ms. Remains 65 /79 variables (removed 14) and now considering 87/101 (removed 14) transitions.
// Phase 1: matrix 87 rows 65 cols
[2024-05-31 21:51:10] [INFO ] Computed 2 invariants in 5 ms
[2024-05-31 21:51:10] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 21:51:10] [INFO ] Invariant cache hit.
[2024-05-31 21:51:10] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:51:10] [INFO ] Implicit Places using invariants and state equation in 94 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 145 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/79 places, 87/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 64/79 places, 87/101 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 990 steps with 11 reset in 8 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-03 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 95
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 95
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 67 transition count 89
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 67 transition count 89
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 64 transition count 86
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 64 transition count 86
Applied a total of 30 rules in 6 ms. Remains 64 /79 variables (removed 15) and now considering 86/101 (removed 15) transitions.
// Phase 1: matrix 86 rows 64 cols
[2024-05-31 21:51:10] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 21:51:10] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-31 21:51:10] [INFO ] Invariant cache hit.
[2024-05-31 21:51:10] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:51:10] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 99 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/79 places, 86/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 63/79 places, 86/101 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 169 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-05 finished in 464 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) U G(p1)))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Graph (complete) has 224 edges and 79 vertex of which 76 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 81 edges and 73 vertex of which 60 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Graph (trivial) has 63 edges and 60 vertex of which 30 / 60 are part of one of the 15 SCC in 3 ms
Free SCC test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 45 transition count 75
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 38 place count 36 transition count 60
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 31 transition count 50
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 31 transition count 50
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 27 transition count 42
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 27 transition count 42
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 23 transition count 34
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 23 transition count 34
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 19 transition count 30
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 19 transition count 30
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 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 16 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 16 transition count 26
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 83 place count 12 transition count 22
Applied a total of 83 rules in 18 ms. Remains 12 /79 variables (removed 67) and now considering 22/101 (removed 79) transitions.
[2024-05-31 21:51:11] [INFO ] Flow matrix only has 16 transitions (discarded 6 similar events)
// Phase 1: matrix 16 rows 12 cols
[2024-05-31 21:51:11] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 21:51:11] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-31 21:51:11] [INFO ] Flow matrix only has 16 transitions (discarded 6 similar events)
[2024-05-31 21:51:11] [INFO ] Invariant cache hit.
[2024-05-31 21:51:11] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-31 21:51:11] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-31 21:51:11] [INFO ] Flow matrix only has 16 transitions (discarded 6 similar events)
[2024-05-31 21:51:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 6/27 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/28 variables, and 12 constraints, problems are : Problem set: 0 solved, 12 unsolved in 92 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 6/27 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/28 variables, and 24 constraints, problems are : Problem set: 0 solved, 12 unsolved in 66 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 161ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 161ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/79 places, 22/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 12/79 places, 22/101 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-08 finished in 333 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&&F((p0&&G(p1)))))||G((p2 U p3))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Graph (complete) has 224 edges and 79 vertex of which 75 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 72 vertex of which 59 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Graph (trivial) has 60 edges and 59 vertex of which 30 / 59 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 44 transition count 76
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 34 place count 37 transition count 61
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 32 transition count 51
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 32 transition count 51
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 27 transition count 41
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 27 transition count 41
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 24 transition count 35
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 24 transition count 35
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 21 transition count 32
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 21 transition count 32
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 2 with 4 rules applied. Total rules applied 70 place count 19 transition count 30
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 2 with 2 rules applied. Total rules applied 72 place count 18 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 18 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 18 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 17 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 17 transition count 27
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 13 transition count 23
Applied a total of 82 rules in 13 ms. Remains 13 /79 variables (removed 66) and now considering 23/101 (removed 78) transitions.
[2024-05-31 21:51:11] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
// Phase 1: matrix 17 rows 13 cols
[2024-05-31 21:51:11] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 21:51:11] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-31 21:51:11] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
[2024-05-31 21:51:11] [INFO ] Invariant cache hit.
[2024-05-31 21:51:11] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-31 21:51:11] [INFO ] Redundant transitions in 1 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-31 21:51:11] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
[2024-05-31 21:51:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 7/29 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/30 variables, and 13 constraints, problems are : Problem set: 0 solved, 12 unsolved in 68 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 7/29 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 12 unsolved in 73 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 144ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 144ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/79 places, 23/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 13/79 places, 23/101 transitions.
Stuttering acceptance computed with spot in 351 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-12
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-12 finished in 569 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(G(p1))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 95
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 95
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 67 transition count 89
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 67 transition count 89
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 65 transition count 87
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 65 transition count 87
Applied a total of 28 rules in 8 ms. Remains 65 /79 variables (removed 14) and now considering 87/101 (removed 14) transitions.
// Phase 1: matrix 87 rows 65 cols
[2024-05-31 21:51:12] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:51:12] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-31 21:51:12] [INFO ] Invariant cache hit.
[2024-05-31 21:51:12] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:51:12] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-05-31 21:51:12] [INFO ] Invariant cache hit.
[2024-05-31 21:51:12] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 87/152 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 58/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 125 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1367 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 87/152 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 58/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 86/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 211 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
After SMT, in 2422ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 2425ms
Starting structural reductions in LTL mode, iteration 1 : 65/79 places, 87/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2540 ms. Remains : 65/79 places, 87/101 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-13
Product exploration explored 100000 steps with 1153 reset in 162 ms.
Product exploration explored 100000 steps with 1173 reset in 170 ms.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 198 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 9 stable transitions
Detected a total of 11/65 stabilizing places and 9/87 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 200 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 10 factoid took 174 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p1), (NOT p1)]
[2024-05-31 21:51:15] [INFO ] Invariant cache hit.
[2024-05-31 21:51:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 21:51:15] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 21:51:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:51:15] [INFO ] [Real]Added 58 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:51:15] [INFO ] Computed and/alt/rep : 86/166/86 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 21:51:15] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 65 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-05-31 21:51:15] [INFO ] Invariant cache hit.
[2024-05-31 21:51:15] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-31 21:51:15] [INFO ] Invariant cache hit.
[2024-05-31 21:51:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:51:15] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-05-31 21:51:15] [INFO ] Invariant cache hit.
[2024-05-31 21:51:15] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 87/152 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 58/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 125 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1381 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 87/152 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 58/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 86/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 211 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
After SMT, in 2451ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 2454ms
Finished structural reductions in LTL mode , in 1 iterations and 2567 ms. Remains : 65/65 places, 87/87 transitions.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 198 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 9 stable transitions
Detected a total of 11/65 stabilizing places and 9/87 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
[2024-05-31 21:51:18] [INFO ] Invariant cache hit.
[2024-05-31 21:51:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 21:51:18] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-31 21:51:18] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:51:18] [INFO ] [Real]Added 58 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:51:18] [INFO ] Computed and/alt/rep : 86/166/86 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 21:51:18] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1155 reset in 133 ms.
Product exploration explored 100000 steps with 1159 reset in 235 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 87/87 transitions.
Graph (complete) has 198 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 63 transition count 85
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 63 transition count 85
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 61 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 61 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 7 rules in 12 ms. Remains 61 /65 variables (removed 4) and now considering 83/87 (removed 4) transitions.
[2024-05-31 21:51:19] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
// Phase 1: matrix 83 rows 61 cols
[2024-05-31 21:51:19] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:51:19] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Problem TDEAD70 is UNSAT
At refinement iteration 3 (OVERLAPS) 83/144 variables, 61/63 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 58/121 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 0/144 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 121 constraints, problems are : Problem set: 1 solved, 81 unsolved in 1212 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 82/142 variables, 60/62 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 57/119 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 81/200 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 1/143 variables, 1/201 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/201 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/144 variables, 1/202 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 202 constraints, problems are : Problem set: 1 solved, 81 unsolved in 1603 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 81/82 constraints, Known Traps: 0/0 constraints]
After SMT, in 2828ms problems are : Problem set: 1 solved, 81 unsolved
Search for dead transitions found 1 dead transitions in 2830ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 61/65 places, 82/87 transitions.
Graph (complete) has 190 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 60 /61 variables (removed 1) and now considering 82/82 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/65 places, 82/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2858 ms. Remains : 60/65 places, 82/87 transitions.
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 87/87 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 63 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 63 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 62 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 62 transition count 84
Applied a total of 6 rules in 3 ms. Remains 62 /65 variables (removed 3) and now considering 84/87 (removed 3) transitions.
// Phase 1: matrix 84 rows 62 cols
[2024-05-31 21:51:22] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:51:22] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-31 21:51:22] [INFO ] Invariant cache hit.
[2024-05-31 21:51:22] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-31 21:51:22] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-31 21:51:22] [INFO ] Invariant cache hit.
[2024-05-31 21:51:22] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/146 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 57/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/146 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 121 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1286 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/146 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 57/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 83/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 204 constraints, problems are : Problem set: 0 solved, 83 unsolved in 978 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 2276ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 2277ms
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 84/87 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2379 ms. Remains : 62/65 places, 84/87 transitions.
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-13 finished in 12840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Graph (complete) has 224 edges and 79 vertex of which 75 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 75 transition count 90
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 68 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 62 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 62 transition count 84
Applied a total of 27 rules in 6 ms. Remains 62 /79 variables (removed 17) and now considering 84/101 (removed 17) transitions.
// Phase 1: matrix 84 rows 62 cols
[2024-05-31 21:51:24] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 21:51:24] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-31 21:51:24] [INFO ] Invariant cache hit.
[2024-05-31 21:51:24] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:51:24] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 102 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/79 places, 84/101 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 46 transition count 69
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 40 transition count 57
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 40 transition count 57
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 34 transition count 45
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 34 transition count 45
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 29 transition count 40
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 29 transition count 40
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 24 transition count 30
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 24 transition count 30
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 20 transition count 26
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 20 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 83 place count 20 transition count 26
Applied a total of 83 rules in 9 ms. Remains 20 /61 variables (removed 41) and now considering 26/84 (removed 58) transitions.
[2024-05-31 21:51:25] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 20 cols
[2024-05-31 21:51:25] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 21:51:25] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-31 21:51:25] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
[2024-05-31 21:51:25] [INFO ] Invariant cache hit.
[2024-05-31 21:51:25] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 21:51:25] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/79 places, 26/101 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 194 ms. Remains : 20/79 places, 26/101 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-14
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-14 finished in 235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 72 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 72 transition count 94
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 66 transition count 88
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 66 transition count 88
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 63 transition count 85
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 63 transition count 85
Applied a total of 32 rules in 6 ms. Remains 63 /79 variables (removed 16) and now considering 85/101 (removed 16) transitions.
// Phase 1: matrix 85 rows 63 cols
[2024-05-31 21:51:25] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 21:51:25] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-31 21:51:25] [INFO ] Invariant cache hit.
[2024-05-31 21:51:25] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-31 21:51:25] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/79 places, 85/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153 ms. Remains : 62/79 places, 85/101 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 167 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-15 finished in 478 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(G(p1))))'
Found a Lengthening insensitive property : DiscoveryGPU-PT-08a-LTLCardinality-13
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Graph (complete) has 224 edges and 79 vertex of which 76 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 76 transition count 90
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 68 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 23 place count 62 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 29 place count 62 transition count 84
Applied a total of 29 rules in 9 ms. Remains 62 /79 variables (removed 17) and now considering 84/101 (removed 17) transitions.
// Phase 1: matrix 84 rows 62 cols
[2024-05-31 21:51:25] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 21:51:25] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-31 21:51:25] [INFO ] Invariant cache hit.
[2024-05-31 21:51:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:51:25] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-31 21:51:25] [INFO ] Invariant cache hit.
[2024-05-31 21:51:25] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/146 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 58/122 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/146 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 122 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1279 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/146 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 58/122 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 83/205 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 205 constraints, problems are : Problem set: 0 solved, 83 unsolved in 997 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 2285ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 2286ms
Starting structural reductions in LI_LTL mode, iteration 1 : 62/79 places, 84/101 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2385 ms. Remains : 62/79 places, 84/101 transitions.
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-13
Product exploration explored 100000 steps with 1276 reset in 118 ms.
Product exploration explored 100000 steps with 1269 reset in 116 ms.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 194 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 9 stable transitions
Detected a total of 11/62 stabilizing places and 9/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 128 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 10 factoid took 165 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p1), (NOT p1)]
[2024-05-31 21:51:28] [INFO ] Invariant cache hit.
[2024-05-31 21:51:29] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-31 21:51:29] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-31 21:51:29] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:51:29] [INFO ] [Real]Added 58 Read/Feed constraints in 3 ms returned sat
[2024-05-31 21:51:29] [INFO ] Computed and/alt/rep : 83/163/83 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 21:51:29] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-31 21:51:29] [INFO ] Invariant cache hit.
[2024-05-31 21:51:29] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-31 21:51:29] [INFO ] Invariant cache hit.
[2024-05-31 21:51:29] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:51:29] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-31 21:51:29] [INFO ] Invariant cache hit.
[2024-05-31 21:51:29] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/146 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 58/122 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/146 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 122 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1211 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/146 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 58/122 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 83/205 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 205 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 2241ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 2242ms
Finished structural reductions in LTL mode , in 1 iterations and 2383 ms. Remains : 62/62 places, 84/84 transitions.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 194 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 9 stable transitions
Detected a total of 11/62 stabilizing places and 9/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p1), (NOT p1)]
[2024-05-31 21:51:31] [INFO ] Invariant cache hit.
[2024-05-31 21:51:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 21:51:31] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-31 21:51:31] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:51:31] [INFO ] [Real]Added 58 Read/Feed constraints in 3 ms returned sat
[2024-05-31 21:51:32] [INFO ] Computed and/alt/rep : 83/163/83 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 21:51:32] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1272 reset in 109 ms.
Product exploration explored 100000 steps with 1274 reset in 117 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 84/84 transitions.
Graph (complete) has 194 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 60 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 60 transition count 82
Applied a total of 3 rules in 4 ms. Remains 60 /62 variables (removed 2) and now considering 82/84 (removed 2) transitions.
[2024-05-31 21:51:32] [INFO ] Redundant transitions in 1 ms returned []
Running 81 sub problems to find dead transitions.
// Phase 1: matrix 82 rows 60 cols
[2024-05-31 21:51:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:51:32] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 82/142 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 0/142 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 119 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1248 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 82/142 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 81/200 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 200 constraints, problems are : Problem set: 0 solved, 81 unsolved in 910 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 2175ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 2176ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/62 places, 82/84 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2186 ms. Remains : 60/62 places, 82/84 transitions.
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 62 cols
[2024-05-31 21:51:34] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:51:34] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-31 21:51:34] [INFO ] Invariant cache hit.
[2024-05-31 21:51:34] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:51:34] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-31 21:51:34] [INFO ] Invariant cache hit.
[2024-05-31 21:51:34] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/146 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 58/122 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/146 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 122 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1224 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/146 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 58/122 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 83/205 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 205 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1005 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 2239ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 2241ms
Finished structural reductions in LTL mode , in 1 iterations and 2365 ms. Remains : 62/62 places, 84/84 transitions.
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-13 finished in 11492 ms.
[2024-05-31 21:51:37] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:51:37] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-31 21:51:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 79 places, 101 transitions and 327 arcs took 4 ms.
Total runtime 33819 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717192383178

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name DiscoveryGPU-PT-08a-LTLCardinality-13
ltl formula formula --ltl=/tmp/1129/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 79 places, 101 transitions and 327 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1129/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1129/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1129/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1129/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 80 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 80, there are 143 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~93 levels ~10000 states ~42488 transitions
pnml2lts-mc( 0/ 4): ~97 levels ~20000 states ~93868 transitions
pnml2lts-mc( 0/ 4): ~110 levels ~40000 states ~198280 transitions
pnml2lts-mc( 0/ 4): ~128 levels ~80000 states ~424948 transitions
pnml2lts-mc( 0/ 4): ~128 levels ~160000 states ~895724 transitions
pnml2lts-mc( 0/ 4): ~134 levels ~320000 states ~1928796 transitions
pnml2lts-mc( 0/ 4): ~179 levels ~640000 states ~4161956 transitions
pnml2lts-mc( 0/ 4): ~193 levels ~1280000 states ~8794000 transitions
pnml2lts-mc( 0/ 4): ~234 levels ~2560000 states ~18554640 transitions
pnml2lts-mc( 0/ 4): ~269 levels ~5120000 states ~38812100 transitions
pnml2lts-mc( 0/ 4): ~328 levels ~10240000 states ~78711480 transitions
pnml2lts-mc( 0/ 4): ~328 levels ~20480000 states ~169414984 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8151614
pnml2lts-mc( 0/ 4): unique states count: 33552661
pnml2lts-mc( 0/ 4): unique transitions count: 290525864
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 196796810
pnml2lts-mc( 0/ 4): - claim found count: 60174049
pnml2lts-mc( 0/ 4): - claim success count: 33552682
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2231
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33552684 states 290526004 transitions, fanout: 8.659
pnml2lts-mc( 0/ 4): Total exploration time 85.360 sec (85.340 sec minimum, 85.347 sec on average)
pnml2lts-mc( 0/ 4): States per second: 393073, Transitions per second: 3403538
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 257.9MB, 8.1 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 257.9MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-08a"
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 DiscoveryGPU-PT-08a, 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 r488-tall-171631132600395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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