Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446900323.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S06J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446900323
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 25K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 329K Apr 11 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 160K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 538K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 11 17:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 11 17:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 11 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 11 17:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M 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 PolyORBLF-PT-S06J04T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717255735738

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:28:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:28:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:28:57] [INFO ] Load time of PNML (sax parser for PT used): 527 ms
[2024-06-01 15:28:57] [INFO ] Transformed 632 places.
[2024-06-01 15:28:57] [INFO ] Transformed 10500 transitions.
[2024-06-01 15:28:57] [INFO ] Parsed PT model containing 632 places and 10500 transitions and 88770 arcs in 750 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 98 out of 632 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 221 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:28:58] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 614 cols
[2024-06-01 15:28:58] [INFO ] Computed 48 invariants in 193 ms
[2024-06-01 15:28:58] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 37 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20113 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:29:41] [INFO ] Deduced a trap composed of 111 places in 300 ms of which 27 ms to minimize.
[2024-06-01 15:29:43] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 2 ms to minimize.
[2024-06-01 15:29:46] [INFO ] Deduced a trap composed of 84 places in 994 ms of which 4 ms to minimize.
[2024-06-01 15:29:46] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:29:46] [INFO ] Deduced a trap composed of 98 places in 611 ms of which 3 ms to minimize.
[2024-06-01 15:29:47] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 1 ms to minimize.
[2024-06-01 15:29:47] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:29:48] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 3 ms to minimize.
[2024-06-01 15:29:49] [INFO ] Deduced a trap composed of 110 places in 229 ms of which 3 ms to minimize.
[2024-06-01 15:29:50] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 47 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 60530ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 60599ms
[2024-06-01 15:29:59] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:29:59] [INFO ] Invariant cache hit.
[2024-06-01 15:29:59] [INFO ] Implicit Places using invariants in 891 ms returned [86, 222, 347, 422, 509, 580]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 930 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 608/632 places, 2418/2430 transitions.
Applied a total of 0 rules in 67 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61883 ms. Remains : 608/632 places, 2418/2430 transitions.
Support contains 98 out of 608 places after structural reductions.
[2024-06-01 15:30:00] [INFO ] Flatten gal took : 449 ms
[2024-06-01 15:30:01] [INFO ] Flatten gal took : 186 ms
[2024-06-01 15:30:01] [INFO ] Input system was already deterministic with 2418 transitions.
RANDOM walk for 40000 steps (251 resets) in 2159 ms. (18 steps per ms) remains 11/27 properties
BEST_FIRST walk for 40002 steps (104 resets) in 332 ms. (120 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (115 resets) in 356 ms. (112 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (166 resets) in 497 ms. (80 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (104 resets) in 296 ms. (134 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (100 resets) in 383 ms. (104 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (113 resets) in 395 ms. (101 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (114 resets) in 378 ms. (105 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (122 resets) in 238 ms. (167 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (90 resets) in 626 ms. (63 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (99 resets) in 272 ms. (146 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (113 resets) in 424 ms. (94 steps per ms) remains 11/11 properties
[2024-06-01 15:30:03] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-06-01 15:30:03] [INFO ] Computed 42 invariants in 55 ms
[2024-06-01 15:30:03] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 193/249 variables, 12/12 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 2/14 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/14 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 5/254 variables, 2/16 constraints. Problems are: Problem set: 5 solved, 6 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 1/17 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/17 constraints. Problems are: Problem set: 6 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 7 (OVERLAPS) 343/597 variables, 17/34 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 0/34 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/599 variables, 2/36 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/599 variables, 0/36 constraints. Problems are: Problem set: 9 solved, 2 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 11 (OVERLAPS) 9/608 variables, 6/42 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/608 variables, 0/42 constraints. Problems are: Problem set: 10 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2990/2990 variables, and 650 constraints, problems are : Problem set: 10 solved, 1 unsolved in 4623 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 608/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/13 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 508/521 variables, 12/13 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/521 variables, 0/13 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 51/572 variables, 14/27 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/27 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/606 variables, 14/41 constraints. Problems are: Problem set: 10 solved, 1 unsolved
[2024-06-01 15:30:09] [INFO ] Deduced a trap composed of 84 places in 961 ms of which 7 ms to minimize.
[2024-06-01 15:30:12] [INFO ] Deduced a trap composed of 84 places in 2575 ms of which 4 ms to minimize.
[2024-06-01 15:30:13] [INFO ] Deduced a trap composed of 84 places in 862 ms of which 6 ms to minimize.
[2024-06-01 15:30:17] [INFO ] Deduced a trap composed of 110 places in 4481 ms of which 5 ms to minimize.
SMT process timed out in 13991ms, After SMT, problems are : Problem set: 10 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 608 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 608 transition count 2376
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 566 transition count 2376
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 566 transition count 2304
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 494 transition count 2304
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 372 place count 422 transition count 2232
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 376 place count 418 transition count 2228
Iterating global reduction 2 with 4 rules applied. Total rules applied 380 place count 418 transition count 2228
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 392 place count 418 transition count 2216
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 404 place count 406 transition count 2216
Applied a total of 404 rules in 628 ms. Remains 406 /608 variables (removed 202) and now considering 2216/2418 (removed 202) transitions.
Running 2210 sub problems to find dead transitions.
[2024-06-01 15:30:18] [INFO ] Flow matrix only has 2180 transitions (discarded 36 similar events)
// Phase 1: matrix 2180 rows 406 cols
[2024-06-01 15:30:18] [INFO ] Computed 42 invariants in 80 ms
[2024-06-01 15:30:18] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 10.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 3.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 9.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 4.0)
(s42 1.0)
(s43 4.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 3.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 0.0)
(s76 4.0)
(s77 1.0)
(s78 1.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 3.0)
(s99 1.0)
(s100 2.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 4.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 10.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 4.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 3.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 4.0)
(s193 0.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 2.0)
(s207 0.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 1.0)
(s215 0.0)
(s216 1.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 1.0)
(s230 0.0)
(s231 4.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 2.0)
(s236 0.0)
(s237 2.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 3.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 1.0)
(s254 0.0)
(s255 1.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 2.0)
(s304 1.0)
(s305 1.0)
(s306 0.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 3.0)
(s319 1.0)
(s320 1.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 1.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 1.0)
(s330 4.0)
(s331 1.0)
(s332 4.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 4.0)
(s345 1.0)
(s346 1.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 timeout
1.0)
(s355 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2210 unsolved
SMT process timed out in 43197ms, After SMT, problems are : Problem set: 0 solved, 2210 unsolved
Search for dead transitions found 0 dead transitions in 43246ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43880 ms. Remains : 406/608 places, 2216/2418 transitions.
RANDOM walk for 40000 steps (466 resets) in 1230 ms. (32 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (118 resets) in 417 ms. (95 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 113056 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 1
Probabilistic random walk after 113056 steps, saw 39659 distinct states, run finished after 3006 ms. (steps per millisecond=37 ) properties seen :0
[2024-06-01 15:31:05] [INFO ] Flow matrix only has 2180 transitions (discarded 36 similar events)
[2024-06-01 15:31:05] [INFO ] Invariant cache hit.
[2024-06-01 15:31:05] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 168/175 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/266 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 137/403 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:31:05] [INFO ] Deduced a trap composed of 52 places in 477 ms of which 3 ms to minimize.
[2024-06-01 15:31:06] [INFO ] Deduced a trap composed of 36 places in 446 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/404 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2180/2584 variables, 404/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2584 variables, 168/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2584 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/2586 variables, 2/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2586 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2586 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2586 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2586/2586 variables, and 618 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2290 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 406/406 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 168/175 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/266 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 137/403 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Int declared 403/2586 variables, and 42 constraints, problems are : Problem set: 1 solved, 0 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/406 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2447ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 11 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 6 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Applied a total of 0 rules in 25 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:31:08] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-06-01 15:31:08] [INFO ] Computed 42 invariants in 64 ms
[2024-06-01 15:31:08] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
SMT process timed out in 40892ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 40921ms
[2024-06-01 15:31:49] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:31:49] [INFO ] Invariant cache hit.
[2024-06-01 15:31:50] [INFO ] Implicit Places using invariants in 1074 ms returned []
[2024-06-01 15:31:50] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:31:50] [INFO ] Invariant cache hit.
[2024-06-01 15:31:52] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:32:23] [INFO ] Performed 496/608 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:32:26] [INFO ] Implicit Places using invariants and state equation in 36502 ms returned []
Implicit Place search using SMT with State Equation took 37590 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:32:26] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:32:26] [INFO ] Invariant cache hit.
[2024-06-01 15:32:26] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:33:19] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:33:22] [INFO ] Deduced a trap composed of 112 places in 171 ms of which 3 ms to minimize.
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 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:33:33] [INFO ] Deduced a trap composed of 47 places in 528 ms of which 2 ms to minimize.
[2024-06-01 15:33:33] [INFO ] Deduced a trap composed of 84 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:33:33] [INFO ] Deduced a trap composed of 84 places in 205 ms of which 2 ms to minimize.
[2024-06-01 15:33:33] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 1 ms to minimize.
[2024-06-01 15:33:33] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:33:34] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:33:42] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:33:52] [INFO ] Deduced a trap composed of 110 places in 212 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 10)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 3)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 9)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 4)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 4)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 4)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 8)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 4)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 2)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 5)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 86843ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 86890ms
Finished structural reductions in LTL mode , in 1 iterations and 165446 ms. Remains : 608/608 places, 2418/2418 transitions.
Stuttering acceptance computed with spot in 233 ms :[p0, p0]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 1985 ms.
Product exploration explored 100000 steps with 50000 reset in 1989 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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 50 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S06J04T06-LTLCardinality-01 finished in 169868 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 7 out of 608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 608 transition count 2382
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 572 transition count 2376
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 566 transition count 2376
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 84 place count 566 transition count 2304
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 228 place count 494 transition count 2304
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 360 place count 428 transition count 2238
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 364 place count 424 transition count 2234
Iterating global reduction 3 with 4 rules applied. Total rules applied 368 place count 424 transition count 2234
Applied a total of 368 rules in 349 ms. Remains 424 /608 variables (removed 184) and now considering 2234/2418 (removed 184) transitions.
Running 2228 sub problems to find dead transitions.
[2024-06-01 15:33:58] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
// Phase 1: matrix 2198 rows 424 cols
[2024-06-01 15:33:58] [INFO ] Computed 42 invariants in 91 ms
[2024-06-01 15:33:58] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-06-01 15:34:37] [INFO ] Deduced a trap composed of 54 places in 529 ms of which 2 ms to minimize.
[2024-06-01 15:34:37] [INFO ] Deduced a trap composed of 15 places in 479 ms of which 2 ms to minimize.
[2024-06-01 15:34:37] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 1 ms to minimize.
[2024-06-01 15:34:37] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 0 ms to minimize.
[2024-06-01 15:34:38] [INFO ] Deduced a trap composed of 114 places in 681 ms of which 3 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 133 places in 501 ms of which 3 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 1 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 5 ms to minimize.
[2024-06-01 15:34:40] [INFO ] Deduced a trap composed of 151 places in 446 ms of which 3 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 139 places in 459 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/2622 variables, and 47 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2228/974 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-06-01 15:34:54] [INFO ] Deduced a trap composed of 29 places in 768 ms of which 2 ms to minimize.
[2024-06-01 15:34:57] [INFO ] Deduced a trap composed of 212 places in 697 ms of which 3 ms to minimize.
[2024-06-01 15:34:58] [INFO ] Deduced a trap composed of 214 places in 606 ms of which 4 ms to minimize.
[2024-06-01 15:34:58] [INFO ] Deduced a trap composed of 201 places in 602 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/2622 variables, and 51 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/974 constraints, Known Traps: 15/15 constraints]
After SMT, in 64004ms problems are : Problem set: 0 solved, 2228 unsolved
Search for dead transitions found 0 dead transitions in 64053ms
[2024-06-01 15:35:02] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-06-01 15:35:02] [INFO ] Invariant cache hit.
[2024-06-01 15:35:02] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-06-01 15:35:02] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-06-01 15:35:02] [INFO ] Invariant cache hit.
[2024-06-01 15:35:03] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:35:33] [INFO ] Performed 382/424 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:35:36] [INFO ] Implicit Places using invariants and state equation in 33390 ms returned []
Implicit Place search using SMT with State Equation took 33957 ms to find 0 implicit places.
[2024-06-01 15:35:36] [INFO ] Redundant transitions in 174 ms returned []
Running 2228 sub problems to find dead transitions.
[2024-06-01 15:35:36] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-06-01 15:35:36] [INFO ] Invariant cache hit.
[2024-06-01 15:35:36] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-06-01 15:36:16] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:36:16] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 1 ms to minimize.
[2024-06-01 15:36:16] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 1 ms to minimize.
[2024-06-01 15:36:17] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 1 ms to minimize.
[2024-06-01 15:36:17] [INFO ] Deduced a trap composed of 164 places in 679 ms of which 2 ms to minimize.
[2024-06-01 15:36:18] [INFO ] Deduced a trap composed of 15 places in 493 ms of which 2 ms to minimize.
[2024-06-01 15:36:18] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:36:19] [INFO ] Deduced a trap composed of 154 places in 672 ms of which 3 ms to minimize.
[2024-06-01 15:36:19] [INFO ] Deduced a trap composed of 164 places in 677 ms of which 3 ms to minimize.
[2024-06-01 15:36:20] [INFO ] Deduced a trap composed of 153 places in 682 ms of which 3 ms to minimize.
[2024-06-01 15:36:21] [INFO ] Deduced a trap composed of 138 places in 505 ms of which 3 ms to minimize.
[2024-06-01 15:36:21] [INFO ] Deduced a trap composed of 54 places in 118 ms of which 1 ms to minimize.
[2024-06-01 15:36:22] [INFO ] Deduced a trap composed of 29 places in 469 ms of which 2 ms to minimize.
[2024-06-01 15:36:26] [INFO ] Deduced a trap composed of 238 places in 449 ms of which 3 ms to minimize.
[2024-06-01 15:36:27] [INFO ] Deduced a trap composed of 184 places in 489 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/2622 variables, and 51 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2228/974 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-06-01 15:36:44] [INFO ] Deduced a trap composed of 46 places in 428 ms of which 4 ms to minimize.
[2024-06-01 15:36:44] [INFO ] Deduced a trap composed of 86 places in 488 ms of which 3 ms to minimize.
[2024-06-01 15:36:46] [INFO ] Deduced a trap composed of 223 places in 584 ms of which 3 ms to minimize.
[2024-06-01 15:36:47] [INFO ] Deduced a trap composed of 208 places in 562 ms of which 4 ms to minimize.
[2024-06-01 15:36:48] [INFO ] Deduced a trap composed of 231 places in 578 ms of which 3 ms to minimize.
[2024-06-01 15:36:48] [INFO ] Deduced a trap composed of 218 places in 515 ms of which 2 ms to minimize.
[2024-06-01 15:36:49] [INFO ] Deduced a trap composed of 215 places in 623 ms of which 3 ms to minimize.
[2024-06-01 15:36:50] [INFO ] Deduced a trap composed of 193 places in 572 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/2622 variables, and 59 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/974 constraints, Known Traps: 23/23 constraints]
After SMT, in 87445ms problems are : Problem set: 0 solved, 2228 unsolved
Search for dead transitions found 0 dead transitions in 87478ms
Starting structural reductions in SI_LTL mode, iteration 1 : 424/608 places, 2234/2418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186045 ms. Remains : 424/608 places, 2234/2418 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLCardinality-02
Product exploration explored 100000 steps with 2019 reset in 1047 ms.
Product exploration explored 100000 steps with 1971 reset in 994 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 88 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 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 394 steps (6 resets) in 21 ms. (17 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 127 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 2234/2234 transitions.
Applied a total of 0 rules in 57 ms. Remains 424 /424 variables (removed 0) and now considering 2234/2234 (removed 0) transitions.
Running 2228 sub problems to find dead transitions.
[2024-06-01 15:37:06] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-06-01 15:37:06] [INFO ] Invariant cache hit.
[2024-06-01 15:37:06] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-06-01 15:37:45] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 2 ms to minimize.
[2024-06-01 15:37:45] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:37:45] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:37:45] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 1 ms to minimize.
[2024-06-01 15:37:46] [INFO ] Deduced a trap composed of 164 places in 594 ms of which 3 ms to minimize.
[2024-06-01 15:37:46] [INFO ] Deduced a trap composed of 15 places in 758 ms of which 27 ms to minimize.
[2024-06-01 15:37:47] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:37:49] [INFO ] Deduced a trap composed of 154 places in 2414 ms of which 3 ms to minimize.
[2024-06-01 15:37:50] [INFO ] Deduced a trap composed of 164 places in 486 ms of which 3 ms to minimize.
[2024-06-01 15:37:55] [INFO ] Deduced a trap composed of 153 places in 5814 ms of which 2 ms to minimize.
SMT process timed out in 49111ms, After SMT, problems are : Problem set: 0 solved, 2228 unsolved
Search for dead transitions found 0 dead transitions in 49141ms
[2024-06-01 15:37:55] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-06-01 15:37:55] [INFO ] Invariant cache hit.
[2024-06-01 15:37:56] [INFO ] Implicit Places using invariants in 688 ms returned []
[2024-06-01 15:37:56] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-06-01 15:37:56] [INFO ] Invariant cache hit.
[2024-06-01 15:37:57] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:38:18] [INFO ] Implicit Places using invariants and state equation in 21455 ms returned []
Implicit Place search using SMT with State Equation took 22147 ms to find 0 implicit places.
[2024-06-01 15:38:18] [INFO ] Redundant transitions in 96 ms returned []
Running 2228 sub problems to find dead transitions.
[2024-06-01 15:38:18] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-06-01 15:38:18] [INFO ] Invariant cache hit.
[2024-06-01 15:38:18] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-06-01 15:39:04] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 1 ms to minimize.
[2024-06-01 15:39:04] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 0 ms to minimize.
[2024-06-01 15:39:04] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 1 ms to minimize.
[2024-06-01 15:39:05] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 1 ms to minimize.
[2024-06-01 15:39:05] [INFO ] Deduced a trap composed of 164 places in 659 ms of which 2 ms to minimize.
[2024-06-01 15:39:06] [INFO ] Deduced a trap composed of 15 places in 400 ms of which 2 ms to minimize.
[2024-06-01 15:39:06] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:39:06] [INFO ] Deduced a trap composed of 154 places in 498 ms of which 3 ms to minimize.
[2024-06-01 15:39:07] [INFO ] Deduced a trap composed of 164 places in 431 ms of which 2 ms to minimize.
[2024-06-01 15:39:07] [INFO ] Deduced a trap composed of 153 places in 444 ms of which 3 ms to minimize.
[2024-06-01 15:39:08] [INFO ] Deduced a trap composed of 138 places in 451 ms of which 3 ms to minimize.
[2024-06-01 15:39:08] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 1 ms to minimize.
[2024-06-01 15:39:09] [INFO ] Deduced a trap composed of 29 places in 556 ms of which 2 ms to minimize.
[2024-06-01 15:39:13] [INFO ] Deduced a trap composed of 238 places in 561 ms of which 6 ms to minimize.
[2024-06-01 15:39:13] [INFO ] Deduced a trap composed of 184 places in 527 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/2622 variables, and 51 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2228/974 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-06-01 15:39:22] [INFO ] Deduced a trap composed of 46 places in 468 ms of which 3 ms to minimize.
[2024-06-01 15:39:22] [INFO ] Deduced a trap composed of 86 places in 408 ms of which 2 ms to minimize.
[2024-06-01 15:39:23] [INFO ] Deduced a trap composed of 223 places in 740 ms of which 3 ms to minimize.
[2024-06-01 15:39:24] [INFO ] Deduced a trap composed of 208 places in 650 ms of which 3 ms to minimize.
[2024-06-01 15:39:25] [INFO ] Deduced a trap composed of 231 places in 608 ms of which 3 ms to minimize.
[2024-06-01 15:39:26] [INFO ] Deduced a trap composed of 218 places in 616 ms of which 3 ms to minimize.
[2024-06-01 15:39:26] [INFO ] Deduced a trap composed of 215 places in 538 ms of which 2 ms to minimize.
[2024-06-01 15:39:27] [INFO ] Deduced a trap composed of 193 places in 592 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/2622 variables, and 59 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/974 constraints, Known Traps: 23/23 constraints]
After SMT, in 85702ms problems are : Problem set: 0 solved, 2228 unsolved
Search for dead transitions found 0 dead transitions in 85728ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 157208 ms. Remains : 424/424 places, 2234/2234 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 95 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 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 339 steps (1 resets) in 10 ms. (30 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 121 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 113 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1973 reset in 1128 ms.
Product exploration explored 100000 steps with 1992 reset in 884 ms.
Support contains 7 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 2234/2234 transitions.
Applied a total of 0 rules in 98 ms. Remains 424 /424 variables (removed 0) and now considering 2234/2234 (removed 0) transitions.
Running 2228 sub problems to find dead transitions.
[2024-06-01 15:39:46] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-06-01 15:39:46] [INFO ] Invariant cache hit.
[2024-06-01 15:39:46] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-06-01 15:40:24] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:40:24] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:40:24] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 1 ms to minimize.
[2024-06-01 15:40:25] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:40:25] [INFO ] Deduced a trap composed of 164 places in 463 ms of which 3 ms to minimize.
[2024-06-01 15:40:25] [INFO ] Deduced a trap composed of 15 places in 363 ms of which 2 ms to minimize.
[2024-06-01 15:40:26] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:40:26] [INFO ] Deduced a trap composed of 154 places in 518 ms of which 3 ms to minimize.
[2024-06-01 15:40:27] [INFO ] Deduced a trap composed of 164 places in 482 ms of which 3 ms to minimize.
[2024-06-01 15:40:27] [INFO ] Deduced a trap composed of 153 places in 453 ms of which 3 ms to minimize.
[2024-06-01 15:40:28] [INFO ] Deduced a trap composed of 138 places in 536 ms of which 3 ms to minimize.
[2024-06-01 15:40:28] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/2622 variables, and 48 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2228/974 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-06-01 15:40:44] [INFO ] Deduced a trap composed of 70 places in 577 ms of which 3 ms to minimize.
[2024-06-01 15:40:45] [INFO ] Deduced a trap composed of 93 places in 475 ms of which 3 ms to minimize.
[2024-06-01 15:40:45] [INFO ] Deduced a trap composed of 75 places in 496 ms of which 3 ms to minimize.
[2024-06-01 15:40:46] [INFO ] Deduced a trap composed of 32 places in 575 ms of which 2 ms to minimize.
[2024-06-01 15:40:46] [INFO ] Deduced a trap composed of 61 places in 472 ms of which 3 ms to minimize.
[2024-06-01 15:40:48] [INFO ] Deduced a trap composed of 198 places in 598 ms of which 3 ms to minimize.
[2024-06-01 15:40:48] [INFO ] Deduced a trap composed of 222 places in 555 ms of which 3 ms to minimize.
SMT process timed out in 62245ms, After SMT, problems are : Problem set: 0 solved, 2228 unsolved
Search for dead transitions found 0 dead transitions in 62289ms
[2024-06-01 15:40:48] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-06-01 15:40:49] [INFO ] Invariant cache hit.
[2024-06-01 15:40:49] [INFO ] Implicit Places using invariants in 562 ms returned []
[2024-06-01 15:40:49] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-06-01 15:40:49] [INFO ] Invariant cache hit.
[2024-06-01 15:40:50] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:41:11] [INFO ] Implicit Places using invariants and state equation in 22228 ms returned []
Implicit Place search using SMT with State Equation took 22807 ms to find 0 implicit places.
[2024-06-01 15:41:12] [INFO ] Redundant transitions in 242 ms returned []
Running 2228 sub problems to find dead transitions.
[2024-06-01 15:41:12] [INFO ] Flow matrix only has 2198 transitions (discarded 36 similar events)
[2024-06-01 15:41:12] [INFO ] Invariant cache hit.
[2024-06-01 15:41:12] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-06-01 15:41:53] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 1 ms to minimize.
[2024-06-01 15:41:54] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:41:54] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:41:54] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:41:54] [INFO ] Deduced a trap composed of 164 places in 533 ms of which 3 ms to minimize.
[2024-06-01 15:41:55] [INFO ] Deduced a trap composed of 15 places in 521 ms of which 2 ms to minimize.
[2024-06-01 15:41:55] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 1 ms to minimize.
[2024-06-01 15:41:56] [INFO ] Deduced a trap composed of 154 places in 761 ms of which 3 ms to minimize.
[2024-06-01 15:41:56] [INFO ] Deduced a trap composed of 164 places in 606 ms of which 3 ms to minimize.
[2024-06-01 15:41:57] [INFO ] Deduced a trap composed of 153 places in 477 ms of which 3 ms to minimize.
[2024-06-01 15:41:58] [INFO ] Deduced a trap composed of 138 places in 668 ms of which 2 ms to minimize.
[2024-06-01 15:41:58] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:41:59] [INFO ] Deduced a trap composed of 29 places in 432 ms of which 2 ms to minimize.
[2024-06-01 15:42:02] [INFO ] Deduced a trap composed of 238 places in 421 ms of which 3 ms to minimize.
[2024-06-01 15:42:03] [INFO ] Deduced a trap composed of 184 places in 485 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/2622 variables, and 51 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2228/974 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 2228 unsolved
[2024-06-01 15:42:20] [INFO ] Deduced a trap composed of 46 places in 434 ms of which 4 ms to minimize.
[2024-06-01 15:42:20] [INFO ] Deduced a trap composed of 86 places in 438 ms of which 3 ms to minimize.
[2024-06-01 15:42:22] [INFO ] Deduced a trap composed of 223 places in 642 ms of which 3 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 208 places in 675 ms of which 4 ms to minimize.
[2024-06-01 15:42:24] [INFO ] Deduced a trap composed of 231 places in 501 ms of which 2 ms to minimize.
[2024-06-01 15:42:24] [INFO ] Deduced a trap composed of 218 places in 617 ms of which 3 ms to minimize.
[2024-06-01 15:42:25] [INFO ] Deduced a trap composed of 215 places in 574 ms of which 3 ms to minimize.
[2024-06-01 15:42:26] [INFO ] Deduced a trap composed of 193 places in 652 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/2622 variables, and 59 constraints, problems are : Problem set: 0 solved, 2228 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/424 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/974 constraints, Known Traps: 23/23 constraints]
After SMT, in 86695ms problems are : Problem set: 0 solved, 2228 unsolved
Search for dead transitions found 0 dead transitions in 86743ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 172206 ms. Remains : 424/424 places, 2234/2234 transitions.
Treatment of property PolyORBLF-PT-S06J04T06-LTLCardinality-02 finished in 521388 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(G(p0))||G(p1)))))'
Support contains 37 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Applied a total of 0 rules in 28 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:42:39] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-06-01 15:42:39] [INFO ] Computed 42 invariants in 98 ms
[2024-06-01 15:42:39] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 10.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 3.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 9.0)
(s47 0.0)
(s48 1.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 4.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 4.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 3.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 4.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 3.0)
(s142 1.0)
(s143 2.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 4.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 10.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 4.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 0.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 3.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 2.0)
(s245 1.0)
(s246 0.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 4.0)
(s291 0.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s300 1.0)
(s301 0.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 2.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 0.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 1.0)
(s347 0.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 0.0)
(s352 4.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 2.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
SMT process timed out in 46000ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 46027ms
[2024-06-01 15:43:25] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:43:25] [INFO ] Invariant cache hit.
[2024-06-01 15:43:26] [INFO ] Implicit Places using invariants in 1141 ms returned []
[2024-06-01 15:43:26] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:43:26] [INFO ] Invariant cache hit.
[2024-06-01 15:43:29] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:43:50] [INFO ] Implicit Places using invariants and state equation in 24191 ms returned []
Implicit Place search using SMT with State Equation took 25351 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:43:50] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:43:50] [INFO ] Invariant cache hit.
[2024-06-01 15:43:50] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 31 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:44:48] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:44:48] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:44:49] [INFO ] Deduced a trap composed of 35 places in 568 ms of which 4 ms to minimize.
[2024-06-01 15:44:49] [INFO ] Deduced a trap composed of 84 places in 267 ms of which 7 ms to minimize.
[2024-06-01 15:44:49] [INFO ] Deduced a trap composed of 84 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:44:50] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:44:54] [INFO ] Deduced a trap composed of 112 places in 196 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 38 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 7/7 constraints]
After SMT, in 85449ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 85474ms
Finished structural reductions in LTL mode , in 1 iterations and 156892 ms. Remains : 608/608 places, 2418/2418 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLCardinality-07
Stuttering criterion allowed to conclude after 569 steps with 6 reset in 5 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLCardinality-07 finished in 157199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 4 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Applied a total of 0 rules in 19 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:45:16] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:45:16] [INFO ] Invariant cache hit.
[2024-06-01 15:45:16] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:45:58] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 32 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:46:03] [INFO ] Deduced a trap composed of 119 places in 633 ms of which 3 ms to minimize.
[2024-06-01 15:46:03] [INFO ] Deduced a trap composed of 119 places in 314 ms of which 3 ms to minimize.
[2024-06-01 15:46:03] [INFO ] Deduced a trap composed of 110 places in 290 ms of which 3 ms to minimize.
[2024-06-01 15:46:04] [INFO ] Deduced a trap composed of 84 places in 495 ms of which 2 ms to minimize.
[2024-06-01 15:46:04] [INFO ] Deduced a trap composed of 53 places in 517 ms of which 2 ms to minimize.
[2024-06-01 15:46:05] [INFO ] Deduced a trap composed of 66 places in 462 ms of which 2 ms to minimize.
[2024-06-01 15:46:05] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 0 ms to minimize.
[2024-06-01 15:46:05] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 1 ms to minimize.
[2024-06-01 15:46:05] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20074 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 63330ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 63363ms
[2024-06-01 15:46:19] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:46:19] [INFO ] Invariant cache hit.
[2024-06-01 15:46:20] [INFO ] Implicit Places using invariants in 885 ms returned []
[2024-06-01 15:46:20] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:46:20] [INFO ] Invariant cache hit.
[2024-06-01 15:46:22] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:46:50] [INFO ] Implicit Places using invariants and state equation in 29709 ms returned []
Implicit Place search using SMT with State Equation took 30628 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:46:50] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:46:50] [INFO ] Invariant cache hit.
[2024-06-01 15:46:50] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:47:44] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 2 ms to minimize.
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 602/2990 variables, and 32 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:47:48] [INFO ] Deduced a trap composed of 119 places in 845 ms of which 31 ms to minimize.
[2024-06-01 15:47:49] [INFO ] Deduced a trap composed of 119 places in 491 ms of which 5 ms to minimize.
[2024-06-01 15:47:50] [INFO ] Deduced a trap composed of 110 places in 931 ms of which 4 ms to minimize.
[2024-06-01 15:47:50] [INFO ] Deduced a trap composed of 84 places in 570 ms of which 2 ms to minimize.
[2024-06-01 15:47:51] [INFO ] Deduced a trap composed of 53 places in 497 ms of which 2 ms to minimize.
[2024-06-01 15:47:51] [INFO ] Deduced a trap composed of 66 places in 428 ms of which 2 ms to minimize.
[2024-06-01 15:47:52] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 1 ms to minimize.
[2024-06-01 15:47:52] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:47:52] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 84335ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 84389ms
Finished structural reductions in LTL mode , in 1 iterations and 178417 ms. Remains : 608/608 places, 2418/2418 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 102 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLCardinality-08 finished in 178656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(!p0))))'
Support contains 1 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Applied a total of 0 rules in 20 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:48:15] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:48:15] [INFO ] Invariant cache hit.
[2024-06-01 15:48:15] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:49:01] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 32 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:49:04] [INFO ] Deduced a trap composed of 119 places in 669 ms of which 5 ms to minimize.
[2024-06-01 15:49:05] [INFO ] Deduced a trap composed of 119 places in 366 ms of which 5 ms to minimize.
[2024-06-01 15:49:05] [INFO ] Deduced a trap composed of 110 places in 340 ms of which 4 ms to minimize.
[2024-06-01 15:49:06] [INFO ] Deduced a trap composed of 84 places in 642 ms of which 3 ms to minimize.
[2024-06-01 15:49:07] [INFO ] Deduced a trap composed of 53 places in 787 ms of which 3 ms to minimize.
[2024-06-01 15:49:07] [INFO ] Deduced a trap composed of 66 places in 578 ms of which 2 ms to minimize.
[2024-06-01 15:49:07] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 1 ms to minimize.
[2024-06-01 15:49:08] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 1 ms to minimize.
[2024-06-01 15:49:08] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 1 ms to minimize.
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 Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 66814ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 66851ms
[2024-06-01 15:49:22] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:49:22] [INFO ] Invariant cache hit.
[2024-06-01 15:49:22] [INFO ] Implicit Places using invariants in 717 ms returned []
[2024-06-01 15:49:22] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:49:22] [INFO ] Invariant cache hit.
[2024-06-01 15:49:24] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:49:40] [INFO ] Implicit Places using invariants and state equation in 17350 ms returned []
Implicit Place search using SMT with State Equation took 18071 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:49:40] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:49:40] [INFO ] Invariant cache hit.
[2024-06-01 15:49:40] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:50:24] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 3 ms to minimize.
[2024-06-01 15:50:28] [INFO ] Deduced a trap composed of 112 places in 201 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:50:45] [INFO ] Deduced a trap composed of 47 places in 639 ms of which 4 ms to minimize.
[2024-06-01 15:50:45] [INFO ] Deduced a trap composed of 84 places in 229 ms of which 3 ms to minimize.
[2024-06-01 15:50:46] [INFO ] Deduced a trap composed of 84 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:50:46] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:50:46] [INFO ] Deduced a trap composed of 84 places in 207 ms of which 1 ms to minimize.
[2024-06-01 15:50:48] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 5 ms to minimize.
[2024-06-01 15:50:58] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 40 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 9/9 constraints]
After SMT, in 83683ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 83711ms
Finished structural reductions in LTL mode , in 1 iterations and 168671 ms. Remains : 608/608 places, 2418/2418 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), false, false, false, p0]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 62 steps with 3 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLCardinality-09 finished in 168952 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)||G(p1))))'
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 608 transition count 2376
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 566 transition count 2376
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 84 place count 566 transition count 2305
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 226 place count 495 transition count 2305
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 370 place count 423 transition count 2233
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 374 place count 419 transition count 2229
Iterating global reduction 2 with 4 rules applied. Total rules applied 378 place count 419 transition count 2229
Applied a total of 378 rules in 313 ms. Remains 419 /608 variables (removed 189) and now considering 2229/2418 (removed 189) transitions.
Running 2223 sub problems to find dead transitions.
[2024-06-01 15:51:04] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
// Phase 1: matrix 2193 rows 419 cols
[2024-06-01 15:51:04] [INFO ] Computed 42 invariants in 86 ms
[2024-06-01 15:51:04] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-06-01 15:51:44] [INFO ] Deduced a trap composed of 107 places in 377 ms of which 3 ms to minimize.
[2024-06-01 15:51:44] [INFO ] Deduced a trap composed of 139 places in 413 ms of which 3 ms to minimize.
[2024-06-01 15:51:44] [INFO ] Deduced a trap composed of 16 places in 281 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/2612 variables, and 38 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2223/969 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/2612 variables, and 38 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/969 constraints, Known Traps: 3/3 constraints]
After SMT, in 66130ms problems are : Problem set: 0 solved, 2223 unsolved
Search for dead transitions found 0 dead transitions in 66165ms
[2024-06-01 15:52:10] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-06-01 15:52:10] [INFO ] Invariant cache hit.
[2024-06-01 15:52:11] [INFO ] Implicit Places using invariants in 801 ms returned []
[2024-06-01 15:52:11] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-06-01 15:52:11] [INFO ] Invariant cache hit.
[2024-06-01 15:52:12] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:52:28] [INFO ] Implicit Places using invariants and state equation in 16698 ms returned []
Implicit Place search using SMT with State Equation took 17509 ms to find 0 implicit places.
[2024-06-01 15:52:28] [INFO ] Redundant transitions in 103 ms returned []
Running 2223 sub problems to find dead transitions.
[2024-06-01 15:52:28] [INFO ] Flow matrix only has 2193 transitions (discarded 36 similar events)
[2024-06-01 15:52:28] [INFO ] Invariant cache hit.
[2024-06-01 15:52:28] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-06-01 15:53:08] [INFO ] Deduced a trap composed of 113 places in 378 ms of which 3 ms to minimize.
[2024-06-01 15:53:09] [INFO ] Deduced a trap composed of 137 places in 398 ms of which 2 ms to minimize.
[2024-06-01 15:53:09] [INFO ] Deduced a trap composed of 43 places in 315 ms of which 1 ms to minimize.
[2024-06-01 15:53:09] [INFO ] Deduced a trap composed of 38 places in 300 ms of which 1 ms to minimize.
[2024-06-01 15:53:11] [INFO ] Deduced a trap composed of 39 places in 1375 ms of which 1 ms to minimize.
[2024-06-01 15:53:11] [INFO ] Deduced a trap composed of 15 places in 310 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/2612 variables, and 41 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2223/969 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 2223 unsolved
[2024-06-01 15:53:26] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 1 ms to minimize.
[2024-06-01 15:53:26] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:53:27] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:53:31] [INFO ] Deduced a trap composed of 133 places in 347 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/2612 variables, and 45 constraints, problems are : Problem set: 0 solved, 2223 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/419 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/969 constraints, Known Traps: 10/10 constraints]
After SMT, in 83830ms problems are : Problem set: 0 solved, 2223 unsolved
Search for dead transitions found 0 dead transitions in 83863ms
Starting structural reductions in SI_LTL mode, iteration 1 : 419/608 places, 2229/2418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167995 ms. Remains : 419/608 places, 2229/2418 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLCardinality-12
Stuttering criterion allowed to conclude after 20521 steps with 230 reset in 196 ms.
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T06-LTLCardinality-12 finished in 168299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G((p1&&F(p0)))))))'
Support contains 4 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Applied a total of 0 rules in 38 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:53:52] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-06-01 15:53:52] [INFO ] Computed 42 invariants in 69 ms
[2024-06-01 15:53:52] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
SMT process timed out in 43473ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 43514ms
[2024-06-01 15:54:36] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:54:36] [INFO ] Invariant cache hit.
[2024-06-01 15:54:36] [INFO ] Implicit Places using invariants in 814 ms returned []
[2024-06-01 15:54:36] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:54:36] [INFO ] Invariant cache hit.
[2024-06-01 15:54:38] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:55:01] [INFO ] Implicit Places using invariants and state equation in 24921 ms returned []
Implicit Place search using SMT with State Equation took 25756 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:55:01] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:55:01] [INFO ] Invariant cache hit.
[2024-06-01 15:55:01] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:55:45] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 32 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:55:58] [INFO ] Deduced a trap composed of 119 places in 654 ms of which 5 ms to minimize.
[2024-06-01 15:55:59] [INFO ] Deduced a trap composed of 119 places in 333 ms of which 3 ms to minimize.
[2024-06-01 15:55:59] [INFO ] Deduced a trap composed of 110 places in 287 ms of which 3 ms to minimize.
[2024-06-01 15:55:59] [INFO ] Deduced a trap composed of 84 places in 553 ms of which 3 ms to minimize.
[2024-06-01 15:56:00] [INFO ] Deduced a trap composed of 53 places in 533 ms of which 2 ms to minimize.
[2024-06-01 15:56:00] [INFO ] Deduced a trap composed of 66 places in 435 ms of which 2 ms to minimize.
[2024-06-01 15:56:01] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:56:01] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:56:01] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 41 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 10/10 constraints]
After SMT, in 83708ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 83750ms
Finished structural reductions in LTL mode , in 1 iterations and 153080 ms. Remains : 608/608 places, 2418/2418 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 1598 ms.
Product exploration explored 100000 steps with 50000 reset in 1413 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 : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 24 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S06J04T06-LTLCardinality-13 finished in 156402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 2418/2418 transitions.
Applied a total of 0 rules in 18 ms. Remains 608 /608 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:56:28] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:56:28] [INFO ] Invariant cache hit.
[2024-06-01 15:56:28] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 31 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:57:10] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 3 ms to minimize.
[2024-06-01 15:57:10] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 3 ms to minimize.
[2024-06-01 15:57:12] [INFO ] Deduced a trap composed of 35 places in 670 ms of which 5 ms to minimize.
[2024-06-01 15:57:12] [INFO ] Deduced a trap composed of 84 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:57:12] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 1 ms to minimize.
[2024-06-01 15:57:12] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:57:16] [INFO ] Deduced a trap composed of 112 places in 218 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 38 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 7/7 constraints]
After SMT, in 60381ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 60403ms
[2024-06-01 15:57:29] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:57:29] [INFO ] Invariant cache hit.
[2024-06-01 15:57:30] [INFO ] Implicit Places using invariants in 799 ms returned []
[2024-06-01 15:57:30] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:57:30] [INFO ] Invariant cache hit.
[2024-06-01 15:57:32] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:58:01] [INFO ] Implicit Places using invariants and state equation in 31656 ms returned []
Implicit Place search using SMT with State Equation took 32484 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:58:01] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:58:01] [INFO ] Invariant cache hit.
[2024-06-01 15:58:01] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
SMT process timed out in 53685ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 53716ms
Finished structural reductions in LTL mode , in 1 iterations and 146634 ms. Remains : 608/608 places, 2418/2418 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T06-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 1492 ms.
Product exploration explored 100000 steps with 50000 reset in 1431 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 60 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S06J04T06-LTLCardinality-14 finished in 149826 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)))'
[2024-06-01 15:58:59] [INFO ] Flatten gal took : 161 ms
[2024-06-01 15:58:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 15:58:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 608 places, 2418 transitions and 14802 arcs took 21 ms.
Total runtime 1802084 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-LTLCardinality-02

BK_STOP 1717257897994

--------------------
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 PolyORBLF-PT-S06J04T06-LTLCardinality-02
ltl formula formula --ltl=/tmp/1727/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 608 places, 2418 transitions and 14802 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.730 real 0.150 user 0.200 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1727/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1727/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1727/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1727/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 635 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 609, there are 2421 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): ~212 levels ~10000 states ~31168 transitions
pnml2lts-mc( 1/ 4): ~212 levels ~20000 states ~67512 transitions
pnml2lts-mc( 1/ 4): ~494 levels ~40000 states ~139708 transitions
pnml2lts-mc( 1/ 4): ~494 levels ~80000 states ~298820 transitions
pnml2lts-mc( 1/ 4): ~494 levels ~160000 states ~601256 transitions
pnml2lts-mc( 1/ 4): ~758 levels ~320000 states ~1242564 transitions
pnml2lts-mc( 2/ 4): ~3133 levels ~640000 states ~2550692 transitions
pnml2lts-mc( 1/ 4): ~3656 levels ~1280000 states ~4872436 transitions
pnml2lts-mc( 3/ 4): ~9899 levels ~2560000 states ~9555096 transitions
pnml2lts-mc( 3/ 4): ~27340 levels ~5120000 states ~19078040 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6720307
pnml2lts-mc( 0/ 4): unique states count: 8443364
pnml2lts-mc( 0/ 4): unique transitions count: 28469763
pnml2lts-mc( 0/ 4): - self-loop count: 82554
pnml2lts-mc( 0/ 4): - claim dead count: 18041902
pnml2lts-mc( 0/ 4): - claim found count: 574403
pnml2lts-mc( 0/ 4): - claim success count: 8443421
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1148346
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8443424 states 28470066 transitions, fanout: 3.372
pnml2lts-mc( 0/ 4): Total exploration time 356.830 sec (356.820 sec minimum, 356.823 sec on average)
pnml2lts-mc( 0/ 4): States per second: 23662, Transitions per second: 79786
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 137.8MB, 14.9 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 28.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2475 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 137.8MB (~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="PolyORBLF-PT-S06J04T06"
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 PolyORBLF-PT-S06J04T06, 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 r516-tajo-171654446900323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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