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.r290-tajo-171654446600203.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 itstools
Input is PolyORBLF-COL-S06J06T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446600203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.5K Apr 11 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 11 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 11 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 17:16 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 3.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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-COL-S06J06T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716911884777

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-28 15:58:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 15:58:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:58:06] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 15:58:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 15:58:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 851 ms
[2024-05-28 15:58:07] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 700 PT places and 10800.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 15:58:07] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-05-28 15:58:07] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40011 steps (3874 resets) in 1867 ms. (21 steps per ms) remains 10/24 properties
BEST_FIRST walk for 40003 steps (75 resets) in 405 ms. (98 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40002 steps (93 resets) in 360 ms. (110 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (99 resets) in 234 ms. (170 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (86 resets) in 194 ms. (205 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (76 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (93 resets) in 143 ms. (277 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (66 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (36 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
[2024-05-28 15:58:08] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 15:58:08] [INFO ] Computed 26 invariants in 7 ms
[2024-05-28 15:58:08] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 40/50 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/54 variables, 3/10 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 5 (OVERLAPS) 21/75 variables, 12/22 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/22 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/80 variables, 3/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/81 variables, 1/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 6 solved, 1 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/15 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-05-28 15:58:09] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 1/114 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/114 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/116 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/117 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/117 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/117 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 117 constraints, problems are : Problem set: 6 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 644ms problems are : Problem set: 6 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 39 place count 61 transition count 46
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 59 transition count 44
Applied a total of 43 rules in 41 ms. Remains 59 /81 variables (removed 22) and now considering 44/65 (removed 21) transitions.
Running 43 sub problems to find dead transitions.
[2024-05-28 15:58:09] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
// Phase 1: matrix 43 rows 59 cols
[2024-05-28 15:58:09] [INFO ] Computed 25 invariants in 4 ms
[2024-05-28 15:58:09] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-28 15:58:09] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
[2024-05-28 15:58:09] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 15:58:09] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 15:58:09] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 15:58:09] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-28 15:58:09] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 15:58:09] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:58:10] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-28 15:58:10] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-28 15:58:10] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 43/102 variables, 59/94 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 8/102 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 102 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1316 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-28 15:58:10] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 15:58:10] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 1/59 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 43/102 variables, 59/96 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 43/147 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (OVERLAPS) 0/102 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 147 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1272 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 12/12 constraints]
After SMT, in 2621ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 2623ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2683 ms. Remains : 59/81 places, 44/65 transitions.
RANDOM walk for 40003 steps (4362 resets) in 544 ms. (73 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (133 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
Probably explored full state space saw : 314096 states, properties seen :0
Probabilistic random walk after 982379 steps, saw 314096 distinct states, run finished after 1548 ms. (steps per millisecond=634 ) properties seen :0
Explored full state space saw : 314118 states, properties seen :0
Exhaustive walk after 982446 steps, saw 314118 distinct states, run finished after 1207 ms. (steps per millisecond=813 ) properties seen :0
Successfully simplified 7 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 15:58:14] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2024-05-28 15:58:14] [INFO ] Flatten gal took : 27 ms
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 15:58:14] [INFO ] Flatten gal took : 12 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 15:58:15] [INFO ] Unfolded HLPN to a Petri net with 700 places and 10740 transitions 89778 arcs in 215 ms.
[2024-05-28 15:58:15] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Support contains 148 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 694 transition count 2670
Applied a total of 6 rules in 100 ms. Remains 694 /700 variables (removed 6) and now considering 2670/2670 (removed 0) transitions.
Running 2664 sub problems to find dead transitions.
[2024-05-28 15:58:15] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 694 cols
[2024-05-28 15:58:15] [INFO ] Computed 52 invariants in 214 ms
[2024-05-28 15:58:15] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
SMT process timed out in 38732ms, After SMT, problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 38765ms
[2024-05-28 15:58:54] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-05-28 15:58:54] [INFO ] Invariant cache hit.
[2024-05-28 15:58:54] [INFO ] Implicit Places using invariants in 509 ms returned [546, 547, 548, 549, 550, 551]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 531 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 688/700 places, 2670/2670 transitions.
Applied a total of 0 rules in 37 ms. Remains 688 /688 variables (removed 0) and now considering 2670/2670 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39446 ms. Remains : 688/700 places, 2670/2670 transitions.
Support contains 148 out of 688 places after structural reductions.
[2024-05-28 15:58:55] [INFO ] Flatten gal took : 334 ms
[2024-05-28 15:58:55] [INFO ] Flatten gal took : 192 ms
[2024-05-28 15:58:55] [INFO ] Input system was already deterministic with 2670 transitions.
RANDOM walk for 4566 steps (30 resets) in 122 ms. (37 steps per ms) remains 0/11 properties
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 7 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 688 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 634 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 108 place count 634 transition count 2532
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 276 place count 550 transition count 2532
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 282 place count 544 transition count 2526
Iterating global reduction 2 with 6 rules applied. Total rules applied 288 place count 544 transition count 2526
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 432 place count 472 transition count 2454
Applied a total of 432 rules in 196 ms. Remains 472 /688 variables (removed 216) and now considering 2454/2670 (removed 216) transitions.
Running 2448 sub problems to find dead transitions.
[2024-05-28 15:58:56] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
// Phase 1: matrix 2418 rows 472 cols
[2024-05-28 15:58:56] [INFO ] Computed 46 invariants in 116 ms
[2024-05-28 15:58:56] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 15:59:39] [INFO ] Deduced a trap composed of 58 places in 622 ms of which 4 ms to minimize.
[2024-05-28 15:59:39] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 1 ms to minimize.
[2024-05-28 15:59:40] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-05-28 15:59:40] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 1 ms to minimize.
[2024-05-28 15:59:40] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2024-05-28 15:59:41] [INFO ] Deduced a trap composed of 232 places in 850 ms of which 12 ms to minimize.
SMT process timed out in 45414ms, After SMT, problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 45446ms
[2024-05-28 15:59:41] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 15:59:41] [INFO ] Invariant cache hit.
[2024-05-28 15:59:42] [INFO ] Implicit Places using invariants in 1014 ms returned []
[2024-05-28 15:59:42] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 15:59:42] [INFO ] Invariant cache hit.
[2024-05-28 15:59:43] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:59:51] [INFO ] Implicit Places using invariants and state equation in 8707 ms returned []
Implicit Place search using SMT with State Equation took 9726 ms to find 0 implicit places.
[2024-05-28 15:59:51] [INFO ] Redundant transitions in 114 ms returned []
Running 2448 sub problems to find dead transitions.
[2024-05-28 15:59:51] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 15:59:51] [INFO ] Invariant cache hit.
[2024-05-28 15:59:51] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 16:00:30] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:00:30] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 1 ms to minimize.
[2024-05-28 16:00:30] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:00:30] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:00:31] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:00:31] [INFO ] Deduced a trap composed of 240 places in 499 ms of which 3 ms to minimize.
[2024-05-28 16:00:32] [INFO ] Deduced a trap composed of 252 places in 541 ms of which 3 ms to minimize.
[2024-05-28 16:00:32] [INFO ] Deduced a trap composed of 212 places in 653 ms of which 4 ms to minimize.
[2024-05-28 16:00:33] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:00:37] [INFO ] Deduced a trap composed of 216 places in 513 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 50 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1194 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 16:00:53] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 2 ms to minimize.
[2024-05-28 16:00:58] [INFO ] Deduced a trap composed of 15 places in 454 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 52 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1194 constraints, Known Traps: 12/12 constraints]
After SMT, in 81440ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 81469ms
Starting structural reductions in SI_LTL mode, iteration 1 : 472/688 places, 2454/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136975 ms. Remains : 472/688 places, 2454/2670 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLCardinality-00
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLCardinality-00 finished in 137213 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(X(X(p0))) U p1))'
Support contains 56 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Applied a total of 12 rules in 47 ms. Remains 682 /688 variables (removed 6) and now considering 2664/2670 (removed 6) transitions.
Running 2658 sub problems to find dead transitions.
[2024-05-28 16:01:13] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
// Phase 1: matrix 2628 rows 682 cols
[2024-05-28 16:01:13] [INFO ] Computed 46 invariants in 59 ms
[2024-05-28 16:01:13] [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/676 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
SMT process timed out in 40847ms, After SMT, problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 40884ms
[2024-05-28 16:01:54] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-05-28 16:01:54] [INFO ] Invariant cache hit.
[2024-05-28 16:01:54] [INFO ] Implicit Places using invariants in 765 ms returned []
[2024-05-28 16:01:54] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-05-28 16:01:54] [INFO ] Invariant cache hit.
[2024-05-28 16:01:56] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 16:02:08] [INFO ] Implicit Places using invariants and state equation in 13668 ms returned []
Implicit Place search using SMT with State Equation took 14446 ms to find 0 implicit places.
Running 2658 sub problems to find dead transitions.
[2024-05-28 16:02:08] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-05-28 16:02:08] [INFO ] Invariant cache hit.
[2024-05-28 16:02:08] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/676 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
[2024-05-28 16:02:53] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:02:53] [INFO ] Deduced a trap composed of 93 places in 68 ms of which 3 ms to minimize.
[2024-05-28 16:02:53] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:02:54] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 4 ms to minimize.
[2024-05-28 16:02:54] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:02:55] [INFO ] Deduced a trap composed of 471 places in 515 ms of which 5 ms to minimize.
[2024-05-28 16:02:55] [INFO ] Deduced a trap composed of 403 places in 474 ms of which 4 ms to minimize.
[2024-05-28 16:02:56] [INFO ] Deduced a trap composed of 422 places in 406 ms of which 3 ms to minimize.
[2024-05-28 16:02:56] [INFO ] Deduced a trap composed of 384 places in 563 ms of which 5 ms to minimize.
[2024-05-28 16:02:57] [INFO ] Deduced a trap composed of 358 places in 510 ms of which 4 ms to minimize.
[2024-05-28 16:02:57] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/3310 variables, and 51 constraints, problems are : Problem set: 0 solved, 2658 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 18/22 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/682 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2658/1404 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/676 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/676 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
[2024-05-28 16:03:01] [INFO ] Deduced a trap composed of 151 places in 481 ms of which 4 ms to minimize.
[2024-05-28 16:03:02] [INFO ] Deduced a trap composed of 181 places in 460 ms of which 4 ms to minimize.
[2024-05-28 16:03:03] [INFO ] Deduced a trap composed of 331 places in 562 ms of which 6 ms to minimize.
[2024-05-28 16:03:04] [INFO ] Deduced a trap composed of 379 places in 610 ms of which 5 ms to minimize.
[2024-05-28 16:03:17] [INFO ] Deduced a trap composed of 328 places in 569 ms of which 5 ms to minimize.
[2024-05-28 16:03:17] [INFO ] Deduced a trap composed of 386 places in 416 ms of which 3 ms to minimize.
[2024-05-28 16:03:18] [INFO ] Deduced a trap composed of 380 places in 409 ms of which 4 ms to minimize.
[2024-05-28 16:03:22] [INFO ] Deduced a trap composed of 15 places in 628 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/3310 variables, and 59 constraints, problems are : Problem set: 0 solved, 2658 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/22 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/682 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1404 constraints, Known Traps: 19/19 constraints]
After SMT, in 79577ms problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 79619ms
Starting structural reductions in LTL mode, iteration 1 : 682/688 places, 2664/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135014 ms. Remains : 682/688 places, 2664/2670 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 53 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLCardinality-01 finished in 135197 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(p1)&&p0)))'
Support contains 20 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 676 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 676 transition count 2658
Applied a total of 24 rules in 56 ms. Remains 676 /688 variables (removed 12) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 16:03:28] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 676 cols
[2024-05-28 16:03:28] [INFO ] Computed 46 invariants in 52 ms
[2024-05-28 16:03:28] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 40749ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 40773ms
[2024-05-28 16:04:09] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 16:04:09] [INFO ] Invariant cache hit.
[2024-05-28 16:04:09] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-05-28 16:04:09] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 16:04:09] [INFO ] Invariant cache hit.
[2024-05-28 16:04:10] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 16:04:22] [INFO ] Implicit Places using invariants and state equation in 12838 ms returned []
Implicit Place search using SMT with State Equation took 13412 ms to find 0 implicit places.
Running 2652 sub problems to find dead transitions.
[2024-05-28 16:04:22] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 16:04:22] [INFO ] Invariant cache hit.
[2024-05-28 16:04:22] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-05-28 16:05:15] [INFO ] Deduced a trap composed of 93 places in 194 ms of which 3 ms to minimize.
[2024-05-28 16:05:15] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:05:15] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:05:15] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 1 ms to minimize.
[2024-05-28 16:05:15] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:05:16] [INFO ] Deduced a trap composed of 393 places in 642 ms of which 4 ms to minimize.
[2024-05-28 16:05:17] [INFO ] Deduced a trap composed of 407 places in 596 ms of which 7 ms to minimize.
[2024-05-28 16:05:18] [INFO ] Deduced a trap composed of 370 places in 594 ms of which 5 ms to minimize.
[2024-05-28 16:05:19] [INFO ] Deduced a trap composed of 163 places in 628 ms of which 5 ms to minimize.
[2024-05-28 16:05:19] [INFO ] Deduced a trap composed of 157 places in 576 ms of which 4 ms to minimize.
[2024-05-28 16:05:20] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 1 ms to minimize.
SMT process timed out in 57538ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 57563ms
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111819 ms. Remains : 676/688 places, 2658/2670 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLCardinality-03 finished in 112005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 43 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Applied a total of 0 rules in 18 ms. Remains 688 /688 variables (removed 0) and now considering 2670/2670 (removed 0) transitions.
Running 2664 sub problems to find dead transitions.
[2024-05-28 16:05:20] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 688 cols
[2024-05-28 16:05:20] [INFO ] Computed 46 invariants in 70 ms
[2024-05-28 16:05:20] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
SMT process timed out in 40022ms, After SMT, problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 40054ms
[2024-05-28 16:06:00] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-05-28 16:06:00] [INFO ] Invariant cache hit.
[2024-05-28 16:06:01] [INFO ] Implicit Places using invariants in 750 ms returned []
[2024-05-28 16:06:01] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-05-28 16:06:01] [INFO ] Invariant cache hit.
[2024-05-28 16:06:02] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 16:06:16] [INFO ] Implicit Places using invariants and state equation in 14969 ms returned []
Implicit Place search using SMT with State Equation took 15721 ms to find 0 implicit places.
Running 2664 sub problems to find dead transitions.
[2024-05-28 16:06:16] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-05-28 16:06:16] [INFO ] Invariant cache hit.
[2024-05-28 16:06:16] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
[2024-05-28 16:07:00] [INFO ] Deduced a trap composed of 94 places in 197 ms of which 2 ms to minimize.
[2024-05-28 16:07:00] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:07:00] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 3 ms to minimize.
[2024-05-28 16:07:00] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:07:00] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:07:01] [INFO ] Deduced a trap composed of 392 places in 473 ms of which 5 ms to minimize.
[2024-05-28 16:07:02] [INFO ] Deduced a trap composed of 442 places in 426 ms of which 3 ms to minimize.
[2024-05-28 16:07:02] [INFO ] Deduced a trap composed of 400 places in 393 ms of which 4 ms to minimize.
[2024-05-28 16:07:02] [INFO ] Deduced a trap composed of 407 places in 383 ms of which 4 ms to minimize.
[2024-05-28 16:07:03] [INFO ] Deduced a trap composed of 165 places in 425 ms of which 3 ms to minimize.
[2024-05-28 16:07:04] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:07:05] [INFO ] Deduced a trap composed of 361 places in 581 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 682/3322 variables, and 51 constraints, problems are : Problem set: 0 solved, 2664 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2664/1410 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2664 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/682 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
[2024-05-28 16:07:13] [INFO ] Deduced a trap composed of 397 places in 649 ms of which 5 ms to minimize.
[2024-05-28 16:07:14] [INFO ] Deduced a trap composed of 415 places in 526 ms of which 3 ms to minimize.
[2024-05-28 16:07:14] [INFO ] Deduced a trap composed of 454 places in 461 ms of which 6 ms to minimize.
[2024-05-28 16:07:15] [INFO ] Deduced a trap composed of 485 places in 461 ms of which 3 ms to minimize.
[2024-05-28 16:07:15] [INFO ] Deduced a trap composed of 424 places in 462 ms of which 3 ms to minimize.
[2024-05-28 16:07:24] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 3 ms to minimize.
[2024-05-28 16:07:25] [INFO ] Deduced a trap composed of 7 places in 465 ms of which 4 ms to minimize.
[2024-05-28 16:07:26] [INFO ] Deduced a trap composed of 384 places in 430 ms of which 4 ms to minimize.
[2024-05-28 16:07:26] [INFO ] Deduced a trap composed of 447 places in 437 ms of which 4 ms to minimize.
[2024-05-28 16:07:27] [INFO ] Deduced a trap composed of 344 places in 427 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 682/3322 variables, and 61 constraints, problems are : Problem set: 0 solved, 2664 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1410 constraints, Known Traps: 22/22 constraints]
After SMT, in 80306ms problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 80351ms
Finished structural reductions in LTL mode , in 1 iterations and 136166 ms. Remains : 688/688 places, 2670/2670 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLCardinality-05
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLCardinality-05 finished in 136336 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 12 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 688 transition count 2622
Reduce places removed 48 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 54 rules applied. Total rules applied 102 place count 640 transition count 2616
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 634 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 108 place count 634 transition count 2532
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 276 place count 550 transition count 2532
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 282 place count 544 transition count 2526
Iterating global reduction 3 with 6 rules applied. Total rules applied 288 place count 544 transition count 2526
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 348 place count 514 transition count 2496
Applied a total of 348 rules in 156 ms. Remains 514 /688 variables (removed 174) and now considering 2496/2670 (removed 174) transitions.
Running 2490 sub problems to find dead transitions.
[2024-05-28 16:07:36] [INFO ] Flow matrix only has 2460 transitions (discarded 36 similar events)
// Phase 1: matrix 2460 rows 514 cols
[2024-05-28 16:07:36] [INFO ] Computed 46 invariants in 36 ms
[2024-05-28 16:07:36] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
[2024-05-28 16:08:14] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:08:14] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:08:14] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:08:14] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:08:14] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:08:14] [INFO ] Deduced a trap composed of 179 places in 401 ms of which 4 ms to minimize.
[2024-05-28 16:08:16] [INFO ] Deduced a trap composed of 297 places in 530 ms of which 4 ms to minimize.
[2024-05-28 16:08:16] [INFO ] Deduced a trap composed of 253 places in 470 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/2974 variables, and 48 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/514 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2490/1236 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
[2024-05-28 16:08:20] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:08:21] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/2974 variables, and 50 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/514 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1236 constraints, Known Traps: 10/10 constraints]
After SMT, in 60443ms problems are : Problem set: 0 solved, 2490 unsolved
Search for dead transitions found 0 dead transitions in 60464ms
[2024-05-28 16:08:37] [INFO ] Flow matrix only has 2460 transitions (discarded 36 similar events)
[2024-05-28 16:08:37] [INFO ] Invariant cache hit.
[2024-05-28 16:08:37] [INFO ] Implicit Places using invariants in 631 ms returned []
[2024-05-28 16:08:37] [INFO ] Flow matrix only has 2460 transitions (discarded 36 similar events)
[2024-05-28 16:08:37] [INFO ] Invariant cache hit.
[2024-05-28 16:08:38] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 16:08:47] [INFO ] Implicit Places using invariants and state equation in 9334 ms returned []
Implicit Place search using SMT with State Equation took 9967 ms to find 0 implicit places.
[2024-05-28 16:08:47] [INFO ] Redundant transitions in 144 ms returned []
Running 2490 sub problems to find dead transitions.
[2024-05-28 16:08:47] [INFO ] Flow matrix only has 2460 transitions (discarded 36 similar events)
[2024-05-28 16:08:47] [INFO ] Invariant cache hit.
[2024-05-28 16:08:47] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
[2024-05-28 16:09:22] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 1 ms to minimize.
[2024-05-28 16:09:22] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:09:22] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 0 ms to minimize.
[2024-05-28 16:09:22] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:09:22] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:09:23] [INFO ] Deduced a trap composed of 163 places in 341 ms of which 3 ms to minimize.
[2024-05-28 16:09:23] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:09:24] [INFO ] Deduced a trap composed of 281 places in 509 ms of which 4 ms to minimize.
[2024-05-28 16:09:24] [INFO ] Deduced a trap composed of 237 places in 520 ms of which 4 ms to minimize.
[2024-05-28 16:09:25] [INFO ] Deduced a trap composed of 248 places in 455 ms of which 3 ms to minimize.
[2024-05-28 16:09:25] [INFO ] Deduced a trap composed of 270 places in 433 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/2974 variables, and 51 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/514 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2490/1236 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
[2024-05-28 16:09:43] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:09:52] [INFO ] Deduced a trap composed of 29 places in 535 ms of which 4 ms to minimize.
[2024-05-28 16:09:52] [INFO ] Deduced a trap composed of 258 places in 466 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/2974 variables, and 54 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/514 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1236 constraints, Known Traps: 14/14 constraints]
After SMT, in 79154ms problems are : Problem set: 0 solved, 2490 unsolved
Search for dead transitions found 0 dead transitions in 79182ms
Starting structural reductions in SI_LTL mode, iteration 1 : 514/688 places, 2496/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149943 ms. Remains : 514/688 places, 2496/2670 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLCardinality-08
Stuttering criterion allowed to conclude after 65 steps with 1 reset in 2 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLCardinality-08 finished in 150032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 7 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 688 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 634 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 108 place count 634 transition count 2532
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 276 place count 550 transition count 2532
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 282 place count 544 transition count 2526
Iterating global reduction 2 with 6 rules applied. Total rules applied 288 place count 544 transition count 2526
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 432 place count 472 transition count 2454
Applied a total of 432 rules in 149 ms. Remains 472 /688 variables (removed 216) and now considering 2454/2670 (removed 216) transitions.
Running 2448 sub problems to find dead transitions.
[2024-05-28 16:10:06] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
// Phase 1: matrix 2418 rows 472 cols
[2024-05-28 16:10:06] [INFO ] Computed 46 invariants in 71 ms
[2024-05-28 16:10:06] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 16:10:43] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:10:43] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 1 ms to minimize.
[2024-05-28 16:10:43] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:10:43] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:10:44] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:10:44] [INFO ] Deduced a trap composed of 232 places in 621 ms of which 3 ms to minimize.
[2024-05-28 16:10:45] [INFO ] Deduced a trap composed of 216 places in 625 ms of which 3 ms to minimize.
[2024-05-28 16:10:45] [INFO ] Deduced a trap composed of 229 places in 562 ms of which 3 ms to minimize.
SMT process timed out in 39095ms, After SMT, problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 39143ms
[2024-05-28 16:10:45] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 16:10:45] [INFO ] Invariant cache hit.
[2024-05-28 16:10:46] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-28 16:10:46] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 16:10:46] [INFO ] Invariant cache hit.
[2024-05-28 16:10:47] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 16:10:54] [INFO ] Implicit Places using invariants and state equation in 8517 ms returned []
Implicit Place search using SMT with State Equation took 8982 ms to find 0 implicit places.
[2024-05-28 16:10:55] [INFO ] Redundant transitions in 81 ms returned []
Running 2448 sub problems to find dead transitions.
[2024-05-28 16:10:55] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 16:10:55] [INFO ] Invariant cache hit.
[2024-05-28 16:10:55] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 16:11:34] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:11:34] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:11:34] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 0 ms to minimize.
[2024-05-28 16:11:34] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 0 ms to minimize.
[2024-05-28 16:11:34] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:11:35] [INFO ] Deduced a trap composed of 240 places in 431 ms of which 2 ms to minimize.
[2024-05-28 16:11:35] [INFO ] Deduced a trap composed of 252 places in 568 ms of which 4 ms to minimize.
[2024-05-28 16:11:36] [INFO ] Deduced a trap composed of 212 places in 491 ms of which 3 ms to minimize.
[2024-05-28 16:11:36] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:11:40] [INFO ] Deduced a trap composed of 216 places in 509 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 9.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 50 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1194 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 16:11:57] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2024-05-28 16:12:01] [INFO ] Deduced a trap composed of 15 places in 282 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 52 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1194 constraints, Known Traps: 12/12 constraints]
After SMT, in 82140ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 82183ms
Starting structural reductions in SI_LTL mode, iteration 1 : 472/688 places, 2454/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130564 ms. Remains : 472/688 places, 2454/2670 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLCardinality-09
Product exploration explored 100000 steps with 1039 reset in 659 ms.
Product exploration explored 100000 steps with 1044 reset in 716 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 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 202 steps (0 resets) in 6 ms. (28 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 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 7 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 2454/2454 transitions.
Applied a total of 0 rules in 70 ms. Remains 472 /472 variables (removed 0) and now considering 2454/2454 (removed 0) transitions.
Running 2448 sub problems to find dead transitions.
[2024-05-28 16:12:19] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 16:12:19] [INFO ] Invariant cache hit.
[2024-05-28 16:12:19] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 16:12:57] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:12:57] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 1 ms to minimize.
[2024-05-28 16:12:57] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:12:57] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:12:57] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:12:57] [INFO ] Deduced a trap composed of 240 places in 406 ms of which 3 ms to minimize.
[2024-05-28 16:12:58] [INFO ] Deduced a trap composed of 252 places in 429 ms of which 3 ms to minimize.
[2024-05-28 16:12:58] [INFO ] Deduced a trap composed of 212 places in 403 ms of which 2 ms to minimize.
[2024-05-28 16:12:59] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 49 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1194 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 16:13:07] [INFO ] Deduced a trap composed of 70 places in 349 ms of which 2 ms to minimize.
[2024-05-28 16:13:10] [INFO ] Deduced a trap composed of 248 places in 385 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 51 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1194 constraints, Known Traps: 11/11 constraints]
After SMT, in 62276ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 62321ms
[2024-05-28 16:13:21] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 16:13:21] [INFO ] Invariant cache hit.
[2024-05-28 16:13:22] [INFO ] Implicit Places using invariants in 617 ms returned []
[2024-05-28 16:13:22] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 16:13:22] [INFO ] Invariant cache hit.
[2024-05-28 16:13:22] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 16:13:30] [INFO ] Implicit Places using invariants and state equation in 8229 ms returned []
Implicit Place search using SMT with State Equation took 8861 ms to find 0 implicit places.
[2024-05-28 16:13:30] [INFO ] Redundant transitions in 65 ms returned []
Running 2448 sub problems to find dead transitions.
[2024-05-28 16:13:30] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 16:13:30] [INFO ] Invariant cache hit.
[2024-05-28 16:13:30] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 16:14:07] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 1 ms to minimize.
[2024-05-28 16:14:07] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 1 ms to minimize.
[2024-05-28 16:14:07] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:14:07] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:14:07] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 14 ms to minimize.
[2024-05-28 16:14:08] [INFO ] Deduced a trap composed of 240 places in 398 ms of which 2 ms to minimize.
[2024-05-28 16:14:08] [INFO ] Deduced a trap composed of 252 places in 406 ms of which 3 ms to minimize.
[2024-05-28 16:14:09] [INFO ] Deduced a trap composed of 212 places in 455 ms of which 2 ms to minimize.
[2024-05-28 16:14:09] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 0 ms to minimize.
[2024-05-28 16:14:12] [INFO ] Deduced a trap composed of 216 places in 375 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 50 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1194 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 16:14:32] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 1 ms to minimize.
[2024-05-28 16:14:36] [INFO ] Deduced a trap composed of 15 places in 293 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 52 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1194 constraints, Known Traps: 12/12 constraints]
After SMT, in 81935ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 81962ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 153319 ms. Remains : 472/472 places, 2454/2454 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 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 233 steps (1 resets) in 5 ms. (38 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 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1087 reset in 528 ms.
Product exploration explored 100000 steps with 1079 reset in 763 ms.
Built C files in :
/tmp/ltsmin5989779188425204130
[2024-05-28 16:14:54] [INFO ] Too many transitions (2454) to apply POR reductions. Disabling POR matrices.
[2024-05-28 16:14:54] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5989779188425204130
Running compilation step : cd /tmp/ltsmin5989779188425204130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5989779188425204130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5989779188425204130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 7 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 2454/2454 transitions.
Applied a total of 0 rules in 99 ms. Remains 472 /472 variables (removed 0) and now considering 2454/2454 (removed 0) transitions.
Running 2448 sub problems to find dead transitions.
[2024-05-28 16:14:57] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 16:14:57] [INFO ] Invariant cache hit.
[2024-05-28 16:14:57] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 16:15:33] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:15:33] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:15:33] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:15:33] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:15:33] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:15:34] [INFO ] Deduced a trap composed of 240 places in 500 ms of which 3 ms to minimize.
[2024-05-28 16:15:34] [INFO ] Deduced a trap composed of 252 places in 440 ms of which 2 ms to minimize.
[2024-05-28 16:15:35] [INFO ] Deduced a trap composed of 212 places in 417 ms of which 2 ms to minimize.
[2024-05-28 16:15:35] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 49 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1194 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 16:15:42] [INFO ] Deduced a trap composed of 70 places in 399 ms of which 2 ms to minimize.
[2024-05-28 16:15:45] [INFO ] Deduced a trap composed of 248 places in 501 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(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 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 51 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1194 constraints, Known Traps: 11/11 constraints]
After SMT, in 59521ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 59548ms
[2024-05-28 16:15:56] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 16:15:56] [INFO ] Invariant cache hit.
[2024-05-28 16:15:57] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-28 16:15:57] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 16:15:57] [INFO ] Invariant cache hit.
[2024-05-28 16:15:57] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 16:16:04] [INFO ] Implicit Places using invariants and state equation in 7756 ms returned []
Implicit Place search using SMT with State Equation took 8139 ms to find 0 implicit places.
[2024-05-28 16:16:05] [INFO ] Redundant transitions in 39 ms returned []
Running 2448 sub problems to find dead transitions.
[2024-05-28 16:16:05] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 16:16:05] [INFO ] Invariant cache hit.
[2024-05-28 16:16:05] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 16:16:41] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:16:41] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 1 ms to minimize.
[2024-05-28 16:16:41] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:16:41] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:16:41] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 0 ms to minimize.
[2024-05-28 16:16:42] [INFO ] Deduced a trap composed of 240 places in 404 ms of which 2 ms to minimize.
[2024-05-28 16:16:42] [INFO ] Deduced a trap composed of 252 places in 383 ms of which 2 ms to minimize.
[2024-05-28 16:16:42] [INFO ] Deduced a trap composed of 212 places in 440 ms of which 2 ms to minimize.
[2024-05-28 16:16:43] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:16:46] [INFO ] Deduced a trap composed of 216 places in 331 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 50 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1194 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 16:17:05] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:17:09] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 52 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1194 constraints, Known Traps: 12/12 constraints]
After SMT, in 81415ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 81437ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 149280 ms. Remains : 472/472 places, 2454/2454 transitions.
Built C files in :
/tmp/ltsmin13173451982235097536
[2024-05-28 16:17:26] [INFO ] Too many transitions (2454) to apply POR reductions. Disabling POR matrices.
[2024-05-28 16:17:26] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13173451982235097536
Running compilation step : cd /tmp/ltsmin13173451982235097536;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13173451982235097536;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13173451982235097536;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 16:17:29] [INFO ] Flatten gal took : 161 ms
[2024-05-28 16:17:30] [INFO ] Flatten gal took : 131 ms
[2024-05-28 16:17:30] [INFO ] Time to serialize gal into /tmp/LTL15737918806111180934.gal : 59 ms
[2024-05-28 16:17:30] [INFO ] Time to serialize properties into /tmp/LTL3578344278678062027.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15737918806111180934.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9939722535371850155.hoa' '-atoms' '/tmp/LTL3578344278678062027.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3578344278678062027.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9939722535371850155.hoa
Detected timeout of ITS tools.
[2024-05-28 16:17:45] [INFO ] Flatten gal took : 135 ms
[2024-05-28 16:17:45] [INFO ] Flatten gal took : 165 ms
[2024-05-28 16:17:45] [INFO ] Time to serialize gal into /tmp/LTL17477754633030339568.gal : 23 ms
[2024-05-28 16:17:45] [INFO ] Time to serialize properties into /tmp/LTL559080757481910781.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17477754633030339568.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL559080757481910781.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(PollingAbort<=(((ModifiedSrc_0+ModifiedSrc_1)+(ModifiedSrc_2+ModifiedSrc_3))+(ModifiedSrc_4+ModifiedSrc_5)))"))))
Formula 0 simplified : GF!"(PollingAbort<=(((ModifiedSrc_0+ModifiedSrc_1)+(ModifiedSrc_2+ModifiedSrc_3))+(ModifiedSrc_4+ModifiedSrc_5)))"
Detected timeout of ITS tools.
[2024-05-28 16:18:00] [INFO ] Flatten gal took : 156 ms
[2024-05-28 16:18:00] [INFO ] Applying decomposition
[2024-05-28 16:18:01] [INFO ] Flatten gal took : 152 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6751159106995798769.txt' '-o' '/tmp/graph6751159106995798769.bin' '-w' '/tmp/graph6751159106995798769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6751159106995798769.bin' '-l' '-1' '-v' '-w' '/tmp/graph6751159106995798769.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:18:01] [INFO ] Decomposing Gal with order
[2024-05-28 16:18:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:18:02] [INFO ] Removed a total of 2554 redundant transitions.
[2024-05-28 16:18:02] [INFO ] Flatten gal took : 846 ms
[2024-05-28 16:18:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 3994 labels/synchronizations in 316 ms.
[2024-05-28 16:18:03] [INFO ] Time to serialize gal into /tmp/LTL9592141781156930137.gal : 26 ms
[2024-05-28 16:18:03] [INFO ] Time to serialize properties into /tmp/LTL1265702541388411819.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9592141781156930137.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1265702541388411819.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu1.PollingAbort<=(((gu1.ModifiedSrc_0+gu1.ModifiedSrc_1)+(gu1.ModifiedSrc_2+gu1.ModifiedSrc_3))+(gu1.ModifiedSrc_4+gu1.Modif...171
Formula 0 simplified : GF!"(gu1.PollingAbort<=(((gu1.ModifiedSrc_0+gu1.ModifiedSrc_1)+(gu1.ModifiedSrc_2+gu1.ModifiedSrc_3))+(gu1.ModifiedSrc_4+gu1.Modifie...165
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S06J06T06-LTLCardinality-09 finished in 491769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 676 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 676 transition count 2658
Applied a total of 24 rules in 74 ms. Remains 676 /688 variables (removed 12) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 16:18:18] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 676 cols
[2024-05-28 16:18:18] [INFO ] Computed 46 invariants in 47 ms
[2024-05-28 16:18:18] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 41014ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 41037ms
[2024-05-28 16:18:59] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 16:18:59] [INFO ] Invariant cache hit.
[2024-05-28 16:19:00] [INFO ] Implicit Places using invariants in 601 ms returned []
[2024-05-28 16:19:00] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 16:19:00] [INFO ] Invariant cache hit.
[2024-05-28 16:19:01] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 16:19:12] [INFO ] Implicit Places using invariants and state equation in 12241 ms returned []
Implicit Place search using SMT with State Equation took 12844 ms to find 0 implicit places.
Running 2652 sub problems to find dead transitions.
[2024-05-28 16:19:12] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 16:19:12] [INFO ] Invariant cache hit.
[2024-05-28 16:19:12] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-05-28 16:19:56] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 2 ms to minimize.
[2024-05-28 16:19:56] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 1 ms to minimize.
[2024-05-28 16:19:56] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:19:57] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:19:57] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:19:57] [INFO ] Deduced a trap composed of 393 places in 471 ms of which 3 ms to minimize.
[2024-05-28 16:19:58] [INFO ] Deduced a trap composed of 407 places in 421 ms of which 3 ms to minimize.
[2024-05-28 16:19:58] [INFO ] Deduced a trap composed of 370 places in 445 ms of which 4 ms to minimize.
[2024-05-28 16:19:59] [INFO ] Deduced a trap composed of 163 places in 467 ms of which 3 ms to minimize.
[2024-05-28 16:19:59] [INFO ] Deduced a trap composed of 157 places in 405 ms of which 3 ms to minimize.
[2024-05-28 16:20:00] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:20:01] [INFO ] Deduced a trap composed of 325 places in 512 ms of which 4 ms to minimize.
[2024-05-28 16:20:02] [INFO ] Deduced a trap composed of 369 places in 460 ms of which 3 ms to minimize.
[2024-05-28 16:20:03] [INFO ] Deduced a trap composed of 65 places in 377 ms of which 2 ms to minimize.
SMT process timed out in 50897ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 50922ms
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104901 ms. Remains : 676/688 places, 2658/2670 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLCardinality-12 finished in 105104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 13 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 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 688 transition count 2634
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 652 transition count 2628
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 646 transition count 2628
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 84 place count 646 transition count 2538
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 264 place count 556 transition count 2538
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 270 place count 550 transition count 2532
Iterating global reduction 3 with 6 rules applied. Total rules applied 276 place count 550 transition count 2532
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 408 place count 484 transition count 2466
Applied a total of 408 rules in 142 ms. Remains 484 /688 variables (removed 204) and now considering 2466/2670 (removed 204) transitions.
Running 2460 sub problems to find dead transitions.
[2024-05-28 16:20:03] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
// Phase 1: matrix 2430 rows 484 cols
[2024-05-28 16:20:03] [INFO ] Computed 46 invariants in 49 ms
[2024-05-28 16:20:03] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
[2024-05-28 16:20:45] [INFO ] Deduced a trap composed of 60 places in 151 ms of which 1 ms to minimize.
[2024-05-28 16:20:45] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 1 ms to minimize.
[2024-05-28 16:20:45] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 0 ms to minimize.
[2024-05-28 16:20:45] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:20:45] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:20:46] [INFO ] Deduced a trap composed of 219 places in 444 ms of which 3 ms to minimize.
SMT process timed out in 42379ms, After SMT, problems are : Problem set: 0 solved, 2460 unsolved
Search for dead transitions found 0 dead transitions in 42426ms
[2024-05-28 16:20:46] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
[2024-05-28 16:20:46] [INFO ] Invariant cache hit.
[2024-05-28 16:20:46] [INFO ] Implicit Places using invariants in 574 ms returned []
[2024-05-28 16:20:46] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
[2024-05-28 16:20:46] [INFO ] Invariant cache hit.
[2024-05-28 16:20:47] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 16:20:58] [INFO ] Implicit Places using invariants and state equation in 11503 ms returned []
Implicit Place search using SMT with State Equation took 12092 ms to find 0 implicit places.
[2024-05-28 16:20:58] [INFO ] Redundant transitions in 71 ms returned []
Running 2460 sub problems to find dead transitions.
[2024-05-28 16:20:58] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
[2024-05-28 16:20:58] [INFO ] Invariant cache hit.
[2024-05-28 16:20:58] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
[2024-05-28 16:21:34] [INFO ] Deduced a trap composed of 60 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:21:35] [INFO ] Deduced a trap composed of 60 places in 129 ms of which 1 ms to minimize.
[2024-05-28 16:21:35] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 0 ms to minimize.
[2024-05-28 16:21:35] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 0 ms to minimize.
[2024-05-28 16:21:35] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 0 ms to minimize.
[2024-05-28 16:21:35] [INFO ] Deduced a trap composed of 250 places in 404 ms of which 3 ms to minimize.
[2024-05-28 16:21:36] [INFO ] Deduced a trap composed of 219 places in 460 ms of which 2 ms to minimize.
[2024-05-28 16:21:36] [INFO ] Deduced a trap composed of 241 places in 411 ms of which 2 ms to minimize.
[2024-05-28 16:21:39] [INFO ] Deduced a trap composed of 47 places in 292 ms of which 2 ms to minimize.
[2024-05-28 16:21:41] [INFO ] Deduced a trap composed of 228 places in 340 ms of which 3 ms to minimize.
[2024-05-28 16:21:42] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/2914 variables, and 51 constraints, problems are : Problem set: 0 solved, 2460 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 19/23 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/484 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2460/1206 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
[2024-05-28 16:21:56] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:21:57] [INFO ] Deduced a trap composed of 15 places in 741 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/2914 variables, and 53 constraints, problems are : Problem set: 0 solved, 2460 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 19/23 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/484 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1206 constraints, Known Traps: 13/13 constraints]
After SMT, in 80761ms problems are : Problem set: 0 solved, 2460 unsolved
Search for dead transitions found 0 dead transitions in 80786ms
Starting structural reductions in SI_LTL mode, iteration 1 : 484/688 places, 2466/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135539 ms. Remains : 484/688 places, 2466/2670 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLCardinality-14
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLCardinality-14 finished in 135607 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)))'
[2024-05-28 16:22:19] [INFO ] Flatten gal took : 188 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13798787400846026477
[2024-05-28 16:22:19] [INFO ] Too many transitions (2670) to apply POR reductions. Disabling POR matrices.
[2024-05-28 16:22:19] [INFO ] Applying decomposition
[2024-05-28 16:22:19] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13798787400846026477
Running compilation step : cd /tmp/ltsmin13798787400846026477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 16:22:19] [INFO ] Flatten gal took : 164 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16294042425501520029.txt' '-o' '/tmp/graph16294042425501520029.bin' '-w' '/tmp/graph16294042425501520029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16294042425501520029.bin' '-l' '-1' '-v' '-w' '/tmp/graph16294042425501520029.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:22:20] [INFO ] Decomposing Gal with order
[2024-05-28 16:22:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:22:20] [INFO ] Removed a total of 3260 redundant transitions.
[2024-05-28 16:22:20] [INFO ] Flatten gal took : 447 ms
[2024-05-28 16:22:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 3928 labels/synchronizations in 626 ms.
[2024-05-28 16:22:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality17325188054565011185.gal : 25 ms
[2024-05-28 16:22:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality12845314654264205276.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17325188054565011185.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12845314654264205276.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu16.PollingAbort<=(((gu16.ModifiedSrc_0+gu16.ModifiedSrc_1)+(gu16.ModifiedSrc_2+gu16.ModifiedSrc_3))+(gu16.ModifiedSrc_4+gu1...178
Formula 0 simplified : GF!"(gu16.PollingAbort<=(((gu16.ModifiedSrc_0+gu16.ModifiedSrc_1)+(gu16.ModifiedSrc_2+gu16.ModifiedSrc_3))+(gu16.ModifiedSrc_4+gu16....172
Compilation finished in 7957 ms.
Running link step : cd /tmp/ltsmin13798787400846026477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin13798787400846026477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 783242 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2245143 ms.

BK_STOP 1716914131333

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S06J06T06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S06J06T06, 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 r290-tajo-171654446600203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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