MCC'2024- Execution of r524-tall-171679080300419

About the Execution of LTSMin+red for SafeBus-PT-06

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
4467.151	737905.00	1122751.00	1592.10	FFTTFTTFTTFFFFFF	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r524-tall-171679080300419.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 SafeBus-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679080300419
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 18K Apr 12 14:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 14:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 12 14:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 140K Apr 12 14:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.3K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 12 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 173K Apr 12 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 840K Apr 12 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 303K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SafeBus-PT-06-LTLCardinality-00
FORMULA_NAME SafeBus-PT-06-LTLCardinality-01
FORMULA_NAME SafeBus-PT-06-LTLCardinality-02
FORMULA_NAME SafeBus-PT-06-LTLCardinality-03
FORMULA_NAME SafeBus-PT-06-LTLCardinality-04
FORMULA_NAME SafeBus-PT-06-LTLCardinality-05
FORMULA_NAME SafeBus-PT-06-LTLCardinality-06
FORMULA_NAME SafeBus-PT-06-LTLCardinality-07
FORMULA_NAME SafeBus-PT-06-LTLCardinality-08
FORMULA_NAME SafeBus-PT-06-LTLCardinality-09
FORMULA_NAME SafeBus-PT-06-LTLCardinality-10
FORMULA_NAME SafeBus-PT-06-LTLCardinality-11
FORMULA_NAME SafeBus-PT-06-LTLCardinality-12
FORMULA_NAME SafeBus-PT-06-LTLCardinality-13
FORMULA_NAME SafeBus-PT-06-LTLCardinality-14
FORMULA_NAME SafeBus-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717226077240

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:14:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:14:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:14:38] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-06-01 07:14:38] [INFO ] Transformed 144 places.
[2024-06-01 07:14:38] [INFO ] Transformed 451 transitions.
[2024-06-01 07:14:38] [INFO ] Found NUPN structural information;
[2024-06-01 07:14:38] [INFO ] Parsed PT model containing 144 places and 451 transitions and 2968 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 6 places and 0 transitions.
FORMULA SafeBus-PT-06-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 15 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-06-01 07:14:38] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 07:14:38] [INFO ] Computed 29 invariants in 22 ms
[2024-06-01 07:14:39] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-06-01 07:14:39] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-06-01 07:14:39] [INFO ] Invariant cache hit.
[2024-06-01 07:14:39] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:14:39] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-06-01 07:14:39] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-06-01 07:14:39] [INFO ] Invariant cache hit.
[2024-06-01 07:14:39] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 18 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 3 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 11/198 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 5 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 5/203 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 4/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 242/380 variables, 138/345 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 43/388 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/388 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 (/ 7.0 8.0))
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 (/ 1.0 8.0))
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 (/ 7.0 8.0))
(s37 (/ 1.0 8.0))
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 (/ 1.0 2.0))
(s50 0.0)
(s51 0.0)timeout

(s52 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 388 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30037 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 36 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 40/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 8/215 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 3/218 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/218 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 242/380 variables, 138/356 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 43/399 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 409/808 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 808 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30013 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/445 constraints, Known Traps: 51/51 constraints]
After SMT, in 60687ms problems are : Problem set: 36 solved, 409 unsolved
Search for dead transitions found 36 dead transitions in 60706ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 138/138 places, 415/451 transitions.
Applied a total of 0 rules in 6 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61459 ms. Remains : 138/138 places, 415/451 transitions.
Support contains 80 out of 138 places after structural reductions.
[2024-06-01 07:15:40] [INFO ] Flatten gal took : 64 ms
[2024-06-01 07:15:40] [INFO ] Flatten gal took : 36 ms
[2024-06-01 07:15:40] [INFO ] Input system was already deterministic with 415 transitions.
Support contains 74 out of 138 places (down from 80) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1959 ms. (20 steps per ms) remains 1/18 properties
BEST_FIRST walk for 40001 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
[2024-06-01 07:15:41] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 07:15:41] [INFO ] Computed 29 invariants in 8 ms
[2024-06-01 07:15:41] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 60/90 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 60/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/106 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 16/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 106/380 variables, and 118 constraints, problems are : Problem set: 1 solved, 0 unsolved in 50 ms.
Refiners :[Domain max(s): 106/138 constraints, Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 1/15 constraints, State Equation: 0/138 constraints, ReadFeed: 0/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA SafeBus-PT-06-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA SafeBus-PT-06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||G(p0))))'
Support contains 13 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 37 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:15:41] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:15:41] [INFO ] Invariant cache hit.
[2024-06-01 07:15:41] [INFO ] Implicit Places using invariants in 318 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 322 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 21 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 380 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-06-LTLCardinality-00 finished in 592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0)) U (F(p1) U p0))))'
Support contains 6 out of 138 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 5 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:15:42] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:15:42] [INFO ] Invariant cache hit.
[2024-06-01 07:15:42] [INFO ] Implicit Places using invariants in 239 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 240 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 249 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 263 ms.
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 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 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-06-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-06-LTLCardinality-02 finished in 824 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 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:15:42] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:15:42] [INFO ] Invariant cache hit.
[2024-06-01 07:15:43] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-06-01 07:15:43] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:15:43] [INFO ] Invariant cache hit.
[2024-06-01 07:15:43] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:15:43] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-06-01 07:15:43] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:15:43] [INFO ] Invariant cache hit.
[2024-06-01 07:15:43] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30023 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30016 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60439ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60446ms
Finished structural reductions in LTL mode , in 1 iterations and 61227 ms. Remains : 138/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT 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 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-06-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-06-LTLCardinality-03 finished in 61686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 16 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:16:44] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:16:44] [INFO ] Invariant cache hit.
[2024-06-01 07:16:44] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-06-01 07:16:44] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:16:44] [INFO ] Invariant cache hit.
[2024-06-01 07:16:44] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:16:45] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2024-06-01 07:16:45] [INFO ] Redundant transitions in 29 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 07:16:45] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:16:45] [INFO ] Invariant cache hit.
[2024-06-01 07:16:45] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30019 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30023 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60425ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61212 ms. Remains : 138/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-04
Product exploration explored 100000 steps with 1516 reset in 320 ms.
Stack based approach found an accepted trace after 4558 steps with 77 reset with depth 65 and stack size 65 in 16 ms.
FORMULA SafeBus-PT-06-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLCardinality-04 finished in 61610 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 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:17:46] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:17:46] [INFO ] Invariant cache hit.
[2024-06-01 07:17:46] [INFO ] Implicit Places using invariants in 245 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 259 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 275 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 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 SafeBus-PT-06-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-06-LTLCardinality-06 finished in 679 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) U p1))'
Support contains 19 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 13 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:17:46] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:17:46] [INFO ] Invariant cache hit.
[2024-06-01 07:17:47] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-06-01 07:17:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:17:47] [INFO ] Invariant cache hit.
[2024-06-01 07:17:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:17:47] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2024-06-01 07:17:47] [INFO ] Redundant transitions in 6 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 07:17:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:17:47] [INFO ] Invariant cache hit.
[2024-06-01 07:17:47] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30014 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30016 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60413ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60418ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61230 ms. Remains : 138/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-06-LTLCardinality-07 finished in 61473 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 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 13 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:18:48] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-06-01 07:18:48] [INFO ] Invariant cache hit.
[2024-06-01 07:18:48] [INFO ] Implicit Places using invariants in 254 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 255 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 523
Applied a total of 24 rules in 36 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2024-06-01 07:18:48] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2024-06-01 07:18:48] [INFO ] Computed 23 invariants in 8 ms
[2024-06-01 07:18:48] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-06-01 07:18:48] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 07:18:48] [INFO ] Invariant cache hit.
[2024-06-01 07:18:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:18:49] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/138 places, 523/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1048 ms. Remains : 120/138 places, 523/415 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-08
Product exploration explored 100000 steps with 5643 reset in 261 ms.
Product exploration explored 100000 steps with 5733 reset in 309 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 43 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 523/523 transitions.
Applied a total of 0 rules in 35 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2024-06-01 07:18:50] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 07:18:50] [INFO ] Invariant cache hit.
[2024-06-01 07:18:50] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-06-01 07:18:50] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 07:18:50] [INFO ] Invariant cache hit.
[2024-06-01 07:18:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:18:51] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2024-06-01 07:18:51] [INFO ] Redundant transitions in 9 ms returned []
Running 517 sub problems to find dead transitions.
[2024-06-01 07:18:51] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 07:18:51] [INFO ] Invariant cache hit.
[2024-06-01 07:18:51] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/143 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 0 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 19/162 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 0 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 5/167 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (OVERLAPS) 350/470 variables, 120/287 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 43/330 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/470 variables, and 330 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30014 ms.
Refiners :[Domain max(s): 120/120 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/143 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 24/167 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/287 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/330 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 517/847 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 847 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30016 ms.
Refiners :[Domain max(s): 120/120 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 24/24 constraints]
After SMT, in 61482ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 61487ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62198 ms. Remains : 120/120 places, 523/523 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 48 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5729 reset in 272 ms.
Product exploration explored 100000 steps with 5712 reset in 254 ms.
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 523/523 transitions.
Applied a total of 0 rules in 17 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2024-06-01 07:19:53] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 07:19:53] [INFO ] Invariant cache hit.
[2024-06-01 07:19:54] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-06-01 07:19:54] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 07:19:54] [INFO ] Invariant cache hit.
[2024-06-01 07:19:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:19:54] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
[2024-06-01 07:19:54] [INFO ] Redundant transitions in 3 ms returned []
Running 517 sub problems to find dead transitions.
[2024-06-01 07:19:54] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 07:19:54] [INFO ] Invariant cache hit.
[2024-06-01 07:19:54] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/143 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 1 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 19/162 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 0 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:20:04] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 5/167 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (OVERLAPS) 350/470 variables, 120/287 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 43/330 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/470 variables, and 330 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30016 ms.
Refiners :[Domain max(s): 120/120 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/143 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 24/167 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/287 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/330 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 517/847 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 847 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30034 ms.
Refiners :[Domain max(s): 120/120 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 24/24 constraints]
After SMT, in 61363ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 61368ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62176 ms. Remains : 120/120 places, 523/523 transitions.
Treatment of property SafeBus-PT-06-LTLCardinality-08 finished in 127680 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 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 11 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:20:56] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 07:20:56] [INFO ] Computed 29 invariants in 3 ms
[2024-06-01 07:20:56] [INFO ] Implicit Places using invariants in 714 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 716 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 16 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 121 transition count 504
Applied a total of 22 rules in 46 ms. Remains 121 /132 variables (removed 11) and now considering 504/415 (removed -89) transitions.
[2024-06-01 07:20:56] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
// Phase 1: matrix 331 rows 121 cols
[2024-06-01 07:20:56] [INFO ] Computed 23 invariants in 4 ms
[2024-06-01 07:20:57] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-06-01 07:20:57] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
[2024-06-01 07:20:57] [INFO ] Invariant cache hit.
[2024-06-01 07:20:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:20:57] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/138 places, 504/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1617 ms. Remains : 121/138 places, 504/415 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-09
Product exploration explored 100000 steps with 651 reset in 332 ms.
Product exploration explored 100000 steps with 673 reset in 338 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 400 steps (0 resets) in 11 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 504/504 transitions.
Applied a total of 0 rules in 15 ms. Remains 121 /121 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2024-06-01 07:20:58] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
[2024-06-01 07:20:58] [INFO ] Invariant cache hit.
[2024-06-01 07:20:59] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-06-01 07:20:59] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
[2024-06-01 07:20:59] [INFO ] Invariant cache hit.
[2024-06-01 07:20:59] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:20:59] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2024-06-01 07:20:59] [INFO ] Redundant transitions in 3 ms returned []
Running 498 sub problems to find dead transitions.
[2024-06-01 07:20:59] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
[2024-06-01 07:20:59] [INFO ] Invariant cache hit.
[2024-06-01 07:20:59] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 0 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 19 places in 309 ms of which 1 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 14/158 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-01 07:21:07] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 1 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-01 07:21:11] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (OVERLAPS) 331/452 variables, 121/286 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 43/329 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/452 variables, and 329 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30019 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 21/165 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 5/171 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (OVERLAPS) 331/452 variables, 121/292 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 43/335 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 498/833 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 833 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30011 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 27/27 constraints]
After SMT, in 60992ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60999ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61801 ms. Remains : 121/121 places, 504/504 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 641 steps (0 resets) in 8 ms. (71 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 679 reset in 306 ms.
Product exploration explored 100000 steps with 736 reset in 315 ms.
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 504/504 transitions.
Applied a total of 0 rules in 14 ms. Remains 121 /121 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2024-06-01 07:22:01] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
[2024-06-01 07:22:01] [INFO ] Invariant cache hit.
[2024-06-01 07:22:02] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-06-01 07:22:02] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
[2024-06-01 07:22:02] [INFO ] Invariant cache hit.
[2024-06-01 07:22:02] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:22:02] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
[2024-06-01 07:22:02] [INFO ] Redundant transitions in 2 ms returned []
Running 498 sub problems to find dead transitions.
[2024-06-01 07:22:02] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
[2024-06-01 07:22:02] [INFO ] Invariant cache hit.
[2024-06-01 07:22:02] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:22:05] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2024-06-01 07:22:05] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:22:05] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 0 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 4 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 14/158 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (OVERLAPS) 331/452 variables, 121/286 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 43/329 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/452 variables, and 329 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30021 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 21/165 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 5/171 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (OVERLAPS) 331/452 variables, 121/292 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 43/335 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 498/833 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 833 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30015 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 27/27 constraints]
After SMT, in 60894ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60899ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61675 ms. Remains : 121/121 places, 504/504 transitions.
Treatment of property SafeBus-PT-06-LTLCardinality-09 finished in 127579 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 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 8 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:23:03] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 07:23:03] [INFO ] Computed 29 invariants in 2 ms
[2024-06-01 07:23:03] [INFO ] Implicit Places using invariants in 241 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 243 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 132 transition count 410
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 127 transition count 410
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 22 place count 121 transition count 524
Applied a total of 22 rules in 25 ms. Remains 121 /132 variables (removed 11) and now considering 524/415 (removed -109) transitions.
[2024-06-01 07:23:03] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
// Phase 1: matrix 351 rows 121 cols
[2024-06-01 07:23:03] [INFO ] Computed 23 invariants in 6 ms
[2024-06-01 07:23:04] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-06-01 07:23:04] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-06-01 07:23:04] [INFO ] Invariant cache hit.
[2024-06-01 07:23:04] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:23:04] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/138 places, 524/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 988 ms. Remains : 121/138 places, 524/415 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-10
Product exploration explored 100000 steps with 9622 reset in 259 ms.
Product exploration explored 100000 steps with 9912 reset in 297 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 33 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:23:05] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-06-01 07:23:05] [INFO ] Invariant cache hit.
[2024-06-01 07:23:05] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 07:23:05] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 29 ms returned sat
[2024-06-01 07:23:06] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-06-01 07:23:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:23:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 07:23:06] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 10 ms returned sat
[2024-06-01 07:23:06] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-06-01 07:23:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:23:06] [INFO ] [Nat]Added 43 Read/Feed constraints in 29 ms returned sat
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 277 ms
[2024-06-01 07:23:06] [INFO ] Computed and/alt/rep : 37/72/37 causal constraints (skipped 308 transitions) in 45 ms.
[2024-06-01 07:23:06] [INFO ] Added : 5 causal constraints over 3 iterations in 129 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 524/524 transitions.
Applied a total of 0 rules in 15 ms. Remains 121 /121 variables (removed 0) and now considering 524/524 (removed 0) transitions.
[2024-06-01 07:23:06] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-06-01 07:23:06] [INFO ] Invariant cache hit.
[2024-06-01 07:23:07] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-06-01 07:23:07] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-06-01 07:23:07] [INFO ] Invariant cache hit.
[2024-06-01 07:23:07] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:23:07] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2024-06-01 07:23:07] [INFO ] Redundant transitions in 5 ms returned []
Running 518 sub problems to find dead transitions.
[2024-06-01 07:23:07] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-06-01 07:23:07] [INFO ] Invariant cache hit.
[2024-06-01 07:23:07] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 10/131 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 13/144 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 07:23:10] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:23:10] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:23:10] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:23:11] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:23:11] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:23:11] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:23:11] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:23:11] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:23:11] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:23:12] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:23:12] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:23:12] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2024-06-01 07:23:12] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:23:12] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:23:12] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:23:12] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:23:12] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:23:13] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:23:13] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:23:13] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 07:23:14] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:23:14] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:23:15] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:23:15] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:23:15] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:23:16] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (OVERLAPS) 351/472 variables, 121/291 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 43/334 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/472 variables, and 334 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30020 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 10/131 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 13/144 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 26/170 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (OVERLAPS) 351/472 variables, 121/292 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 43/335 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 518/853 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/472 variables, and 853 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30015 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 27/27 constraints]
After SMT, in 61377ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 61383ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62127 ms. Remains : 121/121 places, 524/524 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:24:09] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-06-01 07:24:09] [INFO ] Invariant cache hit.
[2024-06-01 07:24:09] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 07:24:09] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 37 ms returned sat
[2024-06-01 07:24:09] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-06-01 07:24:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:24:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 07:24:09] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 11 ms returned sat
[2024-06-01 07:24:09] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-06-01 07:24:09] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:24:09] [INFO ] [Nat]Added 43 Read/Feed constraints in 32 ms returned sat
[2024-06-01 07:24:10] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:24:10] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:24:10] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:24:10] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:24:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 257 ms
[2024-06-01 07:24:10] [INFO ] Computed and/alt/rep : 37/72/37 causal constraints (skipped 308 transitions) in 45 ms.
[2024-06-01 07:24:10] [INFO ] Added : 5 causal constraints over 3 iterations in 126 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9802 reset in 261 ms.
Product exploration explored 100000 steps with 9931 reset in 265 ms.
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 524/524 transitions.
Applied a total of 0 rules in 14 ms. Remains 121 /121 variables (removed 0) and now considering 524/524 (removed 0) transitions.
[2024-06-01 07:24:10] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-06-01 07:24:10] [INFO ] Invariant cache hit.
[2024-06-01 07:24:11] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-06-01 07:24:11] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-06-01 07:24:11] [INFO ] Invariant cache hit.
[2024-06-01 07:24:11] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:24:11] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2024-06-01 07:24:11] [INFO ] Redundant transitions in 2 ms returned []
Running 518 sub problems to find dead transitions.
[2024-06-01 07:24:11] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-06-01 07:24:11] [INFO ] Invariant cache hit.
[2024-06-01 07:24:11] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 10/131 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 13/144 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 0 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 0 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 07:24:18] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2024-06-01 07:24:18] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:24:19] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:24:19] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:24:19] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:24:20] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (OVERLAPS) 351/472 variables, 121/291 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 43/334 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/472 variables, and 334 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30025 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 10/131 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 13/144 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 26/170 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 07:24:44] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (OVERLAPS) 351/472 variables, 121/292 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 43/335 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 518/853 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/472 variables, and 853 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30016 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 27/27 constraints]
After SMT, in 61100ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 61106ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61928 ms. Remains : 121/121 places, 524/524 transitions.
Treatment of property SafeBus-PT-06-LTLCardinality-10 finished in 129253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 16 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:25:12] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 07:25:12] [INFO ] Computed 29 invariants in 3 ms
[2024-06-01 07:25:13] [INFO ] Implicit Places using invariants in 238 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 239 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 523
Applied a total of 24 rules in 23 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2024-06-01 07:25:13] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2024-06-01 07:25:13] [INFO ] Computed 23 invariants in 5 ms
[2024-06-01 07:25:13] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 07:25:13] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-06-01 07:25:13] [INFO ] Invariant cache hit.
[2024-06-01 07:25:13] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:25:13] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/138 places, 523/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 968 ms. Remains : 120/138 places, 523/415 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 353 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 0 ms.
FORMULA SafeBus-PT-06-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLCardinality-11 finished in 1387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 11 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-01 07:25:14] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-06-01 07:25:14] [INFO ] Computed 29 invariants in 2 ms
[2024-06-01 07:25:14] [INFO ] Implicit Places using invariants in 261 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 264 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 121 transition count 504
Applied a total of 22 rules in 21 ms. Remains 121 /132 variables (removed 11) and now considering 504/415 (removed -89) transitions.
[2024-06-01 07:25:14] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
// Phase 1: matrix 331 rows 121 cols
[2024-06-01 07:25:14] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 07:25:14] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-06-01 07:25:14] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
[2024-06-01 07:25:14] [INFO ] Invariant cache hit.
[2024-06-01 07:25:15] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:25:15] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/138 places, 504/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1093 ms. Remains : 121/138 places, 504/415 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-12
Product exploration explored 100000 steps with 330 reset in 310 ms.
Stack based approach found an accepted trace after 90 steps with 0 reset with depth 91 and stack size 91 in 0 ms.
FORMULA SafeBus-PT-06-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLCardinality-12 finished in 1453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 07:25:16] [INFO ] Flatten gal took : 35 ms
[2024-06-01 07:25:16] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 07:25:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 415 transitions and 2620 arcs took 7 ms.
Total runtime 637816 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SafeBus-PT-06-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SafeBus-PT-06-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SafeBus-PT-06-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717226815145

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name SafeBus-PT-06-LTLCardinality-08
ltl formula formula --ltl=/tmp/2183/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 138 places, 415 transitions and 2620 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2183/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2183/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2183/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2183/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 140 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 139, there are 420 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( 2/ 4): ~1293 levels ~10000 states ~26608 transitions
pnml2lts-mc( 2/ 4): ~2623 levels ~20000 states ~58296 transitions
pnml2lts-mc( 2/ 4): ~5029 levels ~40000 states ~120536 transitions
pnml2lts-mc( 2/ 4): ~10065 levels ~80000 states ~253812 transitions
pnml2lts-mc( 2/ 4): ~19649 levels ~160000 states ~527960 transitions
pnml2lts-mc( 2/ 4): ~38012 levels ~320000 states ~1108876 transitions
pnml2lts-mc( 2/ 4): ~72763 levels ~640000 states ~2316248 transitions
pnml2lts-mc( 2/ 4): ~136286 levels ~1280000 states ~4790476 transitions
pnml2lts-mc( 2/ 4): ~240679 levels ~2560000 states ~9945716 transitions
pnml2lts-mc( 2/ 4): ~391759 levels ~5120000 states ~21271236 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3136609
pnml2lts-mc( 0/ 4): unique states count: 9953364
pnml2lts-mc( 0/ 4): unique transitions count: 47251152
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 14210089
pnml2lts-mc( 0/ 4): - claim found count: 23098411
pnml2lts-mc( 0/ 4): - claim success count: 9956005
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1927603
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9968593 states 47334522 transitions, fanout: 4.748
pnml2lts-mc( 0/ 4): Total exploration time 50.900 sec (50.900 sec minimum, 50.900 sec on average)
pnml2lts-mc( 0/ 4): States per second: 195847, Transitions per second: 929951
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 106.4MB, 11.2 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 29.0%/47.0%
pnml2lts-mc( 0/ 4): Stored 418 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 106.4MB (~256.0MB paged-in)
ltl formula name SafeBus-PT-06-LTLCardinality-09
ltl formula formula --ltl=/tmp/2183/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 138 places, 415 transitions and 2620 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.050 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2183/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2183/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2183/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2183/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 140 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 139, there are 424 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2065 levels ~10000 states ~30764 transitions
pnml2lts-mc( 1/ 4): ~3885 levels ~20000 states ~63752 transitions
pnml2lts-mc( 1/ 4): ~7537 levels ~40000 states ~133920 transitions
pnml2lts-mc( 2/ 4): ~14993 levels ~80000 states ~275152 transitions
pnml2lts-mc( 2/ 4): ~28697 levels ~160000 states ~571908 transitions
pnml2lts-mc( 2/ 4): ~55352 levels ~320000 states ~1194588 transitions
pnml2lts-mc( 2/ 4): ~104997 levels ~640000 states ~2449236 transitions
pnml2lts-mc( 1/ 4): ~182347 levels ~1280000 states ~5017388 transitions
pnml2lts-mc( 0/ 4): ~329523 levels ~2560000 states ~10029188 transitions
pnml2lts-mc( 0/ 4): ~525936 levels ~5120000 states ~20841824 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 314881
pnml2lts-mc( 0/ 4): unique states count: 7131636
pnml2lts-mc( 0/ 4): unique transitions count: 30732592
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 512951
pnml2lts-mc( 0/ 4): - claim found count: 23110434
pnml2lts-mc( 0/ 4): - claim success count: 7137109
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1900111
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7164492 states 30891276 transitions, fanout: 4.312
pnml2lts-mc( 0/ 4): Total exploration time 46.450 sec (46.440 sec minimum, 46.447 sec on average)
pnml2lts-mc( 0/ 4): States per second: 154241, Transitions per second: 665044
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 75.7MB, 11.1 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 21.0%/33.0%
pnml2lts-mc( 0/ 4): Stored 418 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 75.7MB (~256.0MB paged-in)
ltl formula name SafeBus-PT-06-LTLCardinality-10
ltl formula formula --ltl=/tmp/2183/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 138 places, 415 transitions and 2620 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.050 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2183/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2183/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2183/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2183/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 140 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 139, there are 424 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~41!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 93
pnml2lts-mc( 0/ 4): unique states count: 266
pnml2lts-mc( 0/ 4): unique transitions count: 794
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 270
pnml2lts-mc( 0/ 4): - cum. max stack depth: 177
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 270 states 840 transitions, fanout: 3.111
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 13500, Transitions per second: 42000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 40.7 B/state, compr.: 7.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 418 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~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="SafeBus-PT-06"
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 SafeBus-PT-06, 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 r524-tall-171679080300419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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