Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r268-smll-171654407100202.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Peterson-COL-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407100202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.1K Apr 12 02:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 12 02:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 02:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 02:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 02:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 02:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K 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 Peterson-COL-2-CTLFireability-2024-00
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-01
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-02
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-03
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-04
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-05
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-06
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-07
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-08
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-09
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-10
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-11
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-12
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-13
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-14
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716730450778

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLFireability COL
Running Version 202405141337
[2024-05-26 13:34:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 13:34:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 13:34:13] [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-26 13:34:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 13:34:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 959 ms
[2024-05-26 13:34:14] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
[2024-05-26 13:34:14] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 7 ms.
[2024-05-26 13:34:14] [INFO ] Skeletonized 9 HLPN properties in 4 ms. Removed 7 properties that had guard overlaps.
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 8 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 533 steps (0 resets) in 46 ms. (11 steps per ms) remains 0/11 properties
[2024-05-26 13:34:14] [INFO ] Flatten gal took : 26 ms
[2024-05-26 13:34:14] [INFO ] Flatten gal took : 6 ms
Domain [Process(3), Tour(2), Process(3)] of place BeginLoop breaks symmetries in sort Process
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
Arc [2:1*[$i, (MOD (ADD $j 1) 2)]] contains successor/predecessor on variables of sort Tour
[2024-05-26 13:34:14] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions 432 arcs in 57 ms.
[2024-05-26 13:34:14] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
FORMULA Peterson-COL-2-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 102 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 13 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:34:14] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-26 13:34:15] [INFO ] Computed 11 invariants in 20 ms
[2024-05-26 13:34:15] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-26 13:34:15] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:34:15] [INFO ] Invariant cache hit.
[2024-05-26 13:34:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 13:34:15] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-26 13:34:15] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:34:15] [INFO ] Invariant cache hit.
[2024-05-26 13:34:15] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:34:16] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 20 ms to minimize.
[2024-05-26 13:34:16] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 2 ms to minimize.
[2024-05-26 13:34:16] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-26 13:34:16] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-26 13:34:16] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-05-26 13:34:17] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 2 ms to minimize.
[2024-05-26 13:34:17] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-05-26 13:34:17] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 2 ms to minimize.
[2024-05-26 13:34:17] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-26 13:34:17] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 3 ms to minimize.
[2024-05-26 13:34:17] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-26 13:34:17] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
[2024-05-26 13:34:17] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-05-26 13:34:17] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 2 ms to minimize.
[2024-05-26 13:34:17] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-26 13:34:17] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-05-26 13:34:18] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:34:18] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 5 ms to minimize.
[2024-05-26 13:34:18] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:34:19] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:34:19] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 156 constraints, problems are : Problem set: 0 solved, 123 unsolved in 11043 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 123/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 279 constraints, problems are : Problem set: 0 solved, 123 unsolved in 6836 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
After SMT, in 17981ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 18004ms
Finished structural reductions in LTL mode , in 1 iterations and 18671 ms. Remains : 102/102 places, 126/126 transitions.
Support contains 102 out of 102 places after structural reductions.
[2024-05-26 13:34:33] [INFO ] Flatten gal took : 34 ms
[2024-05-26 13:34:33] [INFO ] Flatten gal took : 38 ms
[2024-05-26 13:34:33] [INFO ] Input system was already deterministic with 126 transitions.
RANDOM walk for 40000 steps (8 resets) in 2544 ms. (15 steps per ms) remains 4/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1003 ms. (39 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 746 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 365 ms. (109 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 669 ms. (59 steps per ms) remains 4/4 properties
[2024-05-26 13:34:35] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:34:35] [INFO ] Invariant cache hit.
[2024-05-26 13:34:35] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem AtomicPropp8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 60/102 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-26 13:34:35] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 2 ms to minimize.
[2024-05-26 13:34:35] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-26 13:34:35] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-26 13:34:36] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-26 13:34:36] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-26 13:34:36] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-26 13:34:36] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:34:36] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 120/222 variables, 102/121 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 22/143 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 143 constraints, problems are : Problem set: 1 solved, 3 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 72/102 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 8/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-26 13:34:36] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-26 13:34:36] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-26 13:34:36] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/22 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 120/222 variables, 102/124 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 22/146 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 3/149 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/222 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 149 constraints, problems are : Problem set: 1 solved, 3 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 11/11 constraints]
After SMT, in 1145ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 2 properties in 332 ms.
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 126/126 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 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 72 place count 66 transition count 75
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 102 place count 51 transition count 75
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 45 transition count 69
Applied a total of 114 rules in 45 ms. Remains 45 /102 variables (removed 57) and now considering 69/126 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 45/102 places, 69/126 transitions.
RANDOM walk for 40000 steps (8 resets) in 379 ms. (105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3326 steps, run visited all 1 properties in 24 ms. (steps per millisecond=138 )
Probabilistic random walk after 3326 steps, saw 888 distinct states, run finished after 31 ms. (steps per millisecond=107 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-26 13:34:37] [INFO ] Flatten gal took : 19 ms
[2024-05-26 13:34:37] [INFO ] Flatten gal took : 17 ms
[2024-05-26 13:34:37] [INFO ] Input system was already deterministic with 126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:34:37] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:34:37] [INFO ] Invariant cache hit.
[2024-05-26 13:34:37] [INFO ] Implicit Places using invariants in 54 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 99/102 places, 126/126 transitions.
[2024-05-26 13:34:37] [INFO ] Flatten gal took : 12 ms
[2024-05-26 13:34:37] [INFO ] Flatten gal took : 10 ms
[2024-05-26 13:34:37] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 13:34:37] [INFO ] Flatten gal took : 10 ms
[2024-05-26 13:34:37] [INFO ] Flatten gal took : 10 ms
[2024-05-26 13:34:37] [INFO ] Time to serialize gal into /tmp/CTLFireability2976002853350701261.gal : 11 ms
[2024-05-26 13:34:37] [INFO ] Time to serialize properties into /tmp/CTLFireability14296162270015439102.ctl : 8 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2976002853350701261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14296162270015439102.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20754,0.27799,11208,2,2901,5,27572,6,0,525,36691,0


Converting to forward existential form...Done !
original formula: (EG(((((((Turn_1<1)||(TestTurn_2<1))&&((Turn_5<1)||(TestTurn_5<1)))&&(((Turn_4<1)||(TestTurn_3<1))&&((Turn_3<1)||(TestTurn_1<1))))&&(((Tu...1389
=> equivalent forward existential formula: ([(FwdU((Init * EG(((((((Turn_1<1)||(TestTurn_2<1))&&((Turn_5<1)||(TestTurn_5<1)))&&(((Turn_4<1)||(TestTurn_3<1)...2155
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t45, t46, ...311
(forward)formula 0,0,2.2545,64176,1,0,296,325578,282,145,3283,237106,333
FORMULA Peterson-COL-2-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:34:40] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:34:40] [INFO ] Invariant cache hit.
[2024-05-26 13:34:40] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-26 13:34:40] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:34:40] [INFO ] Invariant cache hit.
[2024-05-26 13:34:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 13:34:40] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-26 13:34:40] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:34:40] [INFO ] Invariant cache hit.
[2024-05-26 13:34:40] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:34:40] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 3 ms to minimize.
[2024-05-26 13:34:40] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
[2024-05-26 13:34:41] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 10 ms to minimize.
[2024-05-26 13:34:41] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-26 13:34:41] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-26 13:34:41] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:34:41] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-26 13:34:41] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 2 ms to minimize.
[2024-05-26 13:34:41] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-26 13:34:41] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-26 13:34:41] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-26 13:34:41] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-26 13:34:41] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:34:41] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:34:41] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-26 13:34:41] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:34:42] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:34:42] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-26 13:34:42] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:34:43] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:34:43] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 156 constraints, problems are : Problem set: 0 solved, 123 unsolved in 10548 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 123/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 279 constraints, problems are : Problem set: 0 solved, 123 unsolved in 5129 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
After SMT, in 15717ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 15721ms
Finished structural reductions in LTL mode , in 1 iterations and 15885 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 13:34:55] [INFO ] Flatten gal took : 19 ms
[2024-05-26 13:34:55] [INFO ] Flatten gal took : 8 ms
[2024-05-26 13:34:56] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 13:34:56] [INFO ] Flatten gal took : 8 ms
[2024-05-26 13:34:56] [INFO ] Flatten gal took : 8 ms
[2024-05-26 13:34:56] [INFO ] Time to serialize gal into /tmp/CTLFireability11520399280346070119.gal : 3 ms
[2024-05-26 13:34:56] [INFO ] Time to serialize properties into /tmp/CTLFireability7466846988156405041.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11520399280346070119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7466846988156405041.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20754,0.284659,11560,2,3064,5,29503,6,0,537,38664,0


Converting to forward existential form...Done !
original formula: E(!(((((AX(!((AF(((((((WantSection_3>=1)&&(TestAlone_1>=1))||((WantSection_3>=1)&&(TestAlone_13>=1)))||(((WantSection_5>=1)&&(TestAlone_5...2554
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,!(((((!(EX(!(!((!(EG(!(((((((WantSection_3>=1)&&(TestAlone_1>=1))||((WantSection_3>=1)&&(TestA...3902
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t45, t46, ...311
(forward)formula 0,0,6.95082,177320,1,0,622,1.18386e+06,300,306,3358,793682,683
FORMULA Peterson-COL-2-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:35:03] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:35:03] [INFO ] Invariant cache hit.
[2024-05-26 13:35:03] [INFO ] Implicit Places using invariants in 82 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 84 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 99/102 places, 126/126 transitions.
[2024-05-26 13:35:03] [INFO ] Flatten gal took : 7 ms
[2024-05-26 13:35:03] [INFO ] Flatten gal took : 7 ms
[2024-05-26 13:35:03] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 13:35:03] [INFO ] Flatten gal took : 8 ms
[2024-05-26 13:35:03] [INFO ] Flatten gal took : 7 ms
[2024-05-26 13:35:03] [INFO ] Time to serialize gal into /tmp/CTLFireability8540911168428471287.gal : 2 ms
[2024-05-26 13:35:03] [INFO ] Time to serialize properties into /tmp/CTLFireability18278580992933129189.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8540911168428471287.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18278580992933129189.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20754,0.265258,11288,2,2901,5,27572,6,0,525,36691,0


Converting to forward existential form...Done !
original formula: (AG(((EF((((((TestIdentity_11<1)&&(TestIdentity_13<1))&&((TestIdentity_12<1)&&(TestIdentity_15<1)))&&(((TestIdentity_1<1)&&(TestIdentity_...1992
=> equivalent forward existential formula: [(((FwdU((Init * !((EX(!(EG(!(((((((Turn_1>=1)&&(TestTurn_2>=1))||((Turn_5>=1)&&(TestTurn_5>=1)))||(((Turn_4>=1)...2073
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t45, t46, ...311
(forward)formula 0,1,1.43652,41216,1,0,254,165154,273,128,3066,129658,262
FORMULA Peterson-COL-2-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:35:04] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:35:04] [INFO ] Invariant cache hit.
[2024-05-26 13:35:04] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-26 13:35:04] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:35:04] [INFO ] Invariant cache hit.
[2024-05-26 13:35:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 13:35:04] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-26 13:35:04] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:35:04] [INFO ] Invariant cache hit.
[2024-05-26 13:35:04] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:35:05] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-26 13:35:05] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-26 13:35:05] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 21 ms to minimize.
[2024-05-26 13:35:05] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
[2024-05-26 13:35:05] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2024-05-26 13:35:05] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 2 ms to minimize.
[2024-05-26 13:35:05] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2024-05-26 13:35:06] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:35:06] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-26 13:35:06] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-26 13:35:06] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-26 13:35:06] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-05-26 13:35:06] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-05-26 13:35:06] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-05-26 13:35:06] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-26 13:35:06] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-26 13:35:06] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:35:07] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 2 ms to minimize.
[2024-05-26 13:35:07] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:35:07] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:35:08] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 156 constraints, problems are : Problem set: 0 solved, 123 unsolved in 10183 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 123/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 279 constraints, problems are : Problem set: 0 solved, 123 unsolved in 6558 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
After SMT, in 16784ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 16786ms
Finished structural reductions in LTL mode , in 1 iterations and 17016 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 13:35:21] [INFO ] Flatten gal took : 10 ms
[2024-05-26 13:35:21] [INFO ] Flatten gal took : 10 ms
[2024-05-26 13:35:21] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 13:35:21] [INFO ] Flatten gal took : 10 ms
[2024-05-26 13:35:21] [INFO ] Flatten gal took : 10 ms
[2024-05-26 13:35:21] [INFO ] Time to serialize gal into /tmp/CTLFireability11096121148398453919.gal : 2 ms
[2024-05-26 13:35:21] [INFO ] Time to serialize properties into /tmp/CTLFireability17137927002373619074.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11096121148398453919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17137927002373619074.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20754,0.279085,11568,2,3064,5,29503,6,0,537,38664,0


Converting to forward existential form...Done !
original formula: (AG(((((((Turn_1<1)||(TestTurn_2<1))&&((Turn_5<1)||(TestTurn_5<1)))&&(((Turn_4<1)||(TestTurn_3<1))&&((Turn_3<1)||(TestTurn_1<1))))&&(((Tu...1693
=> equivalent forward existential formula: ([(((FwdU(FwdU((Init * !(!(E(TRUE U !(((((((Turn_1<1)||(TestTurn_2<1))&&((Turn_5<1)||(TestTurn_5<1)))&&(((Turn_4...4707
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t45, t46, ...311
(forward)formula 0,1,2.69206,66076,1,0,272,321940,285,142,3529,261981,296
FORMULA Peterson-COL-2-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:35:24] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:35:24] [INFO ] Invariant cache hit.
[2024-05-26 13:35:24] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-26 13:35:24] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:35:24] [INFO ] Invariant cache hit.
[2024-05-26 13:35:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 13:35:24] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-26 13:35:24] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:35:24] [INFO ] Invariant cache hit.
[2024-05-26 13:35:24] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:35:25] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-26 13:35:25] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-26 13:35:25] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-26 13:35:25] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-26 13:35:25] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-26 13:35:25] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 2 ms to minimize.
[2024-05-26 13:35:25] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
[2024-05-26 13:35:26] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-26 13:35:26] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-26 13:35:26] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-26 13:35:26] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-26 13:35:26] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-26 13:35:26] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-26 13:35:26] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-05-26 13:35:26] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-26 13:35:26] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-26 13:35:26] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:35:27] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 2 ms to minimize.
[2024-05-26 13:35:27] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:35:28] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:35:29] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 156 constraints, problems are : Problem set: 0 solved, 123 unsolved in 12084 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 123/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 279 constraints, problems are : Problem set: 0 solved, 123 unsolved in 6317 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
After SMT, in 18432ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 18435ms
Finished structural reductions in LTL mode , in 1 iterations and 18755 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 13:35:43] [INFO ] Flatten gal took : 6 ms
[2024-05-26 13:35:43] [INFO ] Flatten gal took : 6 ms
[2024-05-26 13:35:43] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 13:35:43] [INFO ] Flatten gal took : 6 ms
[2024-05-26 13:35:43] [INFO ] Flatten gal took : 6 ms
[2024-05-26 13:35:43] [INFO ] Time to serialize gal into /tmp/CTLFireability1780040621718738539.gal : 2 ms
[2024-05-26 13:35:43] [INFO ] Time to serialize properties into /tmp/CTLFireability17272623840786133142.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1780040621718738539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17272623840786133142.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20754,0.300946,11568,2,3064,5,29503,6,0,537,38664,0


Converting to forward existential form...Done !
original formula: EF(AG(EX(((((Idle_1>=1)&&(WantSection_2>=1))||((Idle_0>=1)&&(WantSection_0>=1)))||((Idle_2>=1)&&(WantSection_4>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(((((Idle_1>=1)&&(WantSection_2>=1))||((Idle_0>=1)&&(WantSection_0>=1)))||((I...201
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t45, t46, ...311
(forward)formula 0,0,1.82161,44332,1,0,261,187485,273,133,3190,150899,269
FORMULA Peterson-COL-2-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 94
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 70 transition count 94
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 64 place count 70 transition count 74
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 104 place count 50 transition count 74
Applied a total of 104 rules in 10 ms. Remains 50 /102 variables (removed 52) and now considering 74/126 (removed 52) transitions.
[2024-05-26 13:35:45] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
// Phase 1: matrix 68 rows 50 cols
[2024-05-26 13:35:45] [INFO ] Computed 11 invariants in 5 ms
[2024-05-26 13:35:45] [INFO ] Implicit Places using invariants in 73 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 74 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 47/102 places, 74/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 88 ms. Remains : 47/102 places, 74/126 transitions.
[2024-05-26 13:35:45] [INFO ] Flatten gal took : 4 ms
[2024-05-26 13:35:45] [INFO ] Flatten gal took : 4 ms
[2024-05-26 13:35:45] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-26 13:35:45] [INFO ] Flatten gal took : 6 ms
[2024-05-26 13:35:45] [INFO ] Flatten gal took : 4 ms
[2024-05-26 13:35:45] [INFO ] Time to serialize gal into /tmp/CTLFireability2276867175199525484.gal : 1 ms
[2024-05-26 13:35:45] [INFO ] Time to serialize properties into /tmp/CTLFireability9924731762587958265.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2276867175199525484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9924731762587958265.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1782,0.103419,6856,2,1394,5,12209,6,0,265,14737,0


Converting to forward existential form...Done !
original formula: EF(EG(((((IsEndLoop_8>=1)||(IsEndLoop_11>=1))||((IsEndLoop_14>=1)||(IsEndLoop_17>=1)))||((IsEndLoop_2>=1)||(IsEndLoop_5>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((((IsEndLoop_8>=1)||(IsEndLoop_11>=1))||((IsEndLoop_14>=1)||(IsEndLoop_17>=1)))||((IsEndL...195
Hit Full ! (commute/partial/dont) 62/0/12
(forward)formula 0,1,0.264954,11080,1,0,8,35293,19,1,1372,21212,8
FORMULA Peterson-COL-2-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:35:45] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-26 13:35:45] [INFO ] Computed 11 invariants in 2 ms
[2024-05-26 13:35:45] [INFO ] Implicit Places using invariants in 92 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 93 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 99/102 places, 126/126 transitions.
[2024-05-26 13:35:45] [INFO ] Flatten gal took : 7 ms
[2024-05-26 13:35:45] [INFO ] Flatten gal took : 8 ms
[2024-05-26 13:35:45] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 13:35:45] [INFO ] Flatten gal took : 19 ms
[2024-05-26 13:35:45] [INFO ] Flatten gal took : 9 ms
[2024-05-26 13:35:45] [INFO ] Time to serialize gal into /tmp/CTLFireability14970734367137438008.gal : 1 ms
[2024-05-26 13:35:45] [INFO ] Time to serialize properties into /tmp/CTLFireability6903091813807274972.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14970734367137438008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6903091813807274972.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20754,0.261086,11280,2,2901,5,27572,6,0,525,36691,0


Converting to forward existential form...Done !
original formula: EF((AG((EX(((((TestIdentity_10<1)&&(TestIdentity_14<1))&&((TestIdentity_17<1)&&(TestIdentity_0<1)))&&((TestIdentity_3<1)&&(TestIdentity_7...1240
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((((((BeginLoop_5>=1)||(BeginLoop_6>=1))||((BeginLoop_7>=1)||(BeginLoop_8>=1)))||(((BeginLo...1304
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t45, t46, ...311
(forward)formula 0,0,3.99847,99764,1,0,362,574382,278,183,3127,458953,371
FORMULA Peterson-COL-2-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:35:49] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:35:49] [INFO ] Invariant cache hit.
[2024-05-26 13:35:49] [INFO ] Implicit Places using invariants in 54 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 55 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 99/102 places, 126/126 transitions.
[2024-05-26 13:35:49] [INFO ] Flatten gal took : 6 ms
[2024-05-26 13:35:49] [INFO ] Flatten gal took : 6 ms
[2024-05-26 13:35:49] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 13:35:49] [INFO ] Flatten gal took : 5 ms
[2024-05-26 13:35:49] [INFO ] Flatten gal took : 10 ms
[2024-05-26 13:35:49] [INFO ] Time to serialize gal into /tmp/CTLFireability1339192075908393607.gal : 2 ms
[2024-05-26 13:35:49] [INFO ] Time to serialize properties into /tmp/CTLFireability16621950529936888712.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1339192075908393607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16621950529936888712.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20754,0.311702,11284,2,2901,5,27572,6,0,525,36691,0


Converting to forward existential form...Done !
original formula: EF((AG((((((Turn_1>=1)&&(TestTurn_2>=1))||((Turn_5>=1)&&(TestTurn_5>=1)))||(((Turn_4>=1)&&(TestTurn_3>=1))||((Turn_3>=1)&&(TestTurn_1>=1)...957
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(E(TRUE U !((((((Turn_1>=1)&&(TestTurn_2>=1))||((Turn_5>=1)&&(TestTurn_5>=1)))||(((Turn_4...1291
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t45, t46, ...311
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.23745,54308,1,0,271,265586,290,138,3410,209740,283
FORMULA Peterson-COL-2-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:35:52] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:35:52] [INFO ] Invariant cache hit.
[2024-05-26 13:35:52] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-26 13:35:52] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:35:52] [INFO ] Invariant cache hit.
[2024-05-26 13:35:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 13:35:52] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-26 13:35:52] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:35:52] [INFO ] Invariant cache hit.
[2024-05-26 13:35:52] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:35:53] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-26 13:35:53] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-26 13:35:53] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-26 13:35:53] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-26 13:35:53] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-05-26 13:35:53] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-26 13:35:53] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-26 13:35:53] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
[2024-05-26 13:35:53] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-26 13:35:53] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
[2024-05-26 13:35:53] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-26 13:35:53] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-26 13:35:54] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2024-05-26 13:35:54] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 2 ms to minimize.
[2024-05-26 13:35:54] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-05-26 13:35:54] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-05-26 13:35:54] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:35:54] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 2 ms to minimize.
[2024-05-26 13:35:55] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:35:56] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:35:56] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 156 constraints, problems are : Problem set: 0 solved, 123 unsolved in 12210 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 123/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 279 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7150 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
After SMT, in 19394ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 19399ms
Finished structural reductions in LTL mode , in 1 iterations and 19634 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 13:36:11] [INFO ] Flatten gal took : 9 ms
[2024-05-26 13:36:11] [INFO ] Flatten gal took : 11 ms
[2024-05-26 13:36:11] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 13:36:11] [INFO ] Flatten gal took : 9 ms
[2024-05-26 13:36:11] [INFO ] Flatten gal took : 8 ms
[2024-05-26 13:36:11] [INFO ] Time to serialize gal into /tmp/CTLFireability15073859263870869172.gal : 2 ms
[2024-05-26 13:36:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4667946104385802684.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15073859263870869172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4667946104385802684.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20754,0.424332,11564,2,3064,5,29503,6,0,537,38664,0


Converting to forward existential form...Done !
original formula: E(!(A(!(((((((IsEndLoop_8>=1)||(IsEndLoop_11>=1))||((IsEndLoop_14>=1)||(IsEndLoop_17>=1)))||(((IsEndLoop_2>=1)||(IsEndLoop_5>=1))||((Test...2576
=> equivalent forward existential formula: [(EY(FwdU(Init,!(!((E(!((!(EG(!(((((((WantSection_3>=1)&&(TestAlone_1>=1))||((WantSection_3>=1)&&(TestAlone_13>=...6894
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t45, t46, ...311
(forward)formula 0,0,2.25904,55564,1,0,260,269573,273,132,3129,192258,271
FORMULA Peterson-COL-2-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:36:14] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:36:14] [INFO ] Invariant cache hit.
[2024-05-26 13:36:14] [INFO ] Implicit Places using invariants in 67 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 68 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 99/102 places, 126/126 transitions.
[2024-05-26 13:36:14] [INFO ] Flatten gal took : 4 ms
[2024-05-26 13:36:14] [INFO ] Flatten gal took : 4 ms
[2024-05-26 13:36:14] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 13:36:14] [INFO ] Flatten gal took : 4 ms
[2024-05-26 13:36:14] [INFO ] Flatten gal took : 4 ms
[2024-05-26 13:36:14] [INFO ] Time to serialize gal into /tmp/CTLFireability899318360367891130.gal : 2 ms
[2024-05-26 13:36:14] [INFO ] Time to serialize properties into /tmp/CTLFireability12841444512050397083.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability899318360367891130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12841444512050397083.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20754,0.267402,11288,2,2901,5,27572,6,0,525,36691,0


Converting to forward existential form...Done !
original formula: ((AF((((((((BeginLoop_5>=1)||(BeginLoop_6>=1))||((BeginLoop_7>=1)||(BeginLoop_8>=1)))||(((BeginLoop_9>=1)||(BeginLoop_10>=1))||((BeginLoo...1432
=> equivalent forward existential formula: (([FwdG(Init,!((((((((BeginLoop_5>=1)||(BeginLoop_6>=1))||((BeginLoop_7>=1)||(BeginLoop_8>=1)))||(((BeginLoop_9>...1540
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t45, t46, ...311
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 114/60/12
(forward)formula 0,0,1.85698,46388,1,0,264,197789,290,137,3425,180584,273
FORMULA Peterson-COL-2-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:36:16] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:36:16] [INFO ] Invariant cache hit.
[2024-05-26 13:36:16] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-26 13:36:16] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:36:16] [INFO ] Invariant cache hit.
[2024-05-26 13:36:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 13:36:16] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-26 13:36:16] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:36:16] [INFO ] Invariant cache hit.
[2024-05-26 13:36:16] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:36:16] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-05-26 13:36:16] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-26 13:36:17] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-26 13:36:17] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
[2024-05-26 13:36:17] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-26 13:36:17] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-26 13:36:17] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-26 13:36:17] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-26 13:36:17] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-26 13:36:17] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 2 ms to minimize.
[2024-05-26 13:36:17] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-05-26 13:36:17] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-26 13:36:17] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-05-26 13:36:18] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-05-26 13:36:18] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-05-26 13:36:18] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
[2024-05-26 13:36:18] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:36:18] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 2 ms to minimize.
[2024-05-26 13:36:19] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:36:20] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 13:36:20] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 156 constraints, problems are : Problem set: 0 solved, 123 unsolved in 12080 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 123/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 279 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7124 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
After SMT, in 19226ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 19228ms
Finished structural reductions in LTL mode , in 1 iterations and 19409 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 13:36:35] [INFO ] Flatten gal took : 10 ms
[2024-05-26 13:36:35] [INFO ] Flatten gal took : 7 ms
[2024-05-26 13:36:35] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 13:36:35] [INFO ] Flatten gal took : 6 ms
[2024-05-26 13:36:35] [INFO ] Flatten gal took : 6 ms
[2024-05-26 13:36:35] [INFO ] Time to serialize gal into /tmp/CTLFireability14010838625101800636.gal : 2 ms
[2024-05-26 13:36:35] [INFO ] Time to serialize properties into /tmp/CTLFireability16176514227034189476.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14010838625101800636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16176514227034189476.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20754,0.369993,11560,2,3064,5,29503,6,0,537,38664,0


Converting to forward existential form...Done !
original formula: A(!((!(((((((Turn_1>=1)&&(TestTurn_2>=1))||((Turn_5>=1)&&(TestTurn_5>=1)))||(((Turn_4>=1)&&(TestTurn_3>=1))||((Turn_3>=1)&&(TestTurn_1>=1...3161
=> equivalent forward existential formula: [((Init * !(EG(!(EX((!((EX((((((IsEndLoop_7>=1)||(IsEndLoop_6>=1))||((IsEndLoop_9>=1)||(IsEndLoop_10>=1)))||(((I...6801
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t45, t46, ...311
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,10.7709,289756,1,0,553,2.05896e+06,302,312,3556,1.30739e+06,587
FORMULA Peterson-COL-2-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 13:36:46] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:36:46] [INFO ] Invariant cache hit.
[2024-05-26 13:36:46] [INFO ] Implicit Places using invariants in 41 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 99/102 places, 126/126 transitions.
[2024-05-26 13:36:46] [INFO ] Flatten gal took : 4 ms
[2024-05-26 13:36:46] [INFO ] Flatten gal took : 4 ms
[2024-05-26 13:36:46] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 13:36:46] [INFO ] Flatten gal took : 4 ms
[2024-05-26 13:36:46] [INFO ] Flatten gal took : 4 ms
[2024-05-26 13:36:46] [INFO ] Time to serialize gal into /tmp/CTLFireability11861894521652786024.gal : 1 ms
[2024-05-26 13:36:46] [INFO ] Time to serialize properties into /tmp/CTLFireability5848219563835858987.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11861894521652786024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5848219563835858987.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20754,0.234821,11288,2,2901,5,27572,6,0,525,36691,0


Converting to forward existential form...Done !
original formula: EG(EF(EX(E((((((((Turn_0>=1)&&(TestTurn_4>=1))||((Turn_1>=1)&&(TestTurn_0>=1)))||(((Turn_2>=1)&&(TestTurn_0>=1))||((Turn_5>=1)&&(TestTurn...1050
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX(E((((((((Turn_0>=1)&&(TestTurn_4>=1))||((Turn_1>=1)&&(TestTurn_0>=1)))||(((Turn_2>=1)&&(T...1099
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t45, t46, ...311
(forward)formula 0,1,2.28607,71872,1,0,358,375867,281,188,3393,274982,394
FORMULA Peterson-COL-2-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 126/126 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 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 72 place count 66 transition count 72
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 108 place count 48 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 42 transition count 66
Applied a total of 120 rules in 20 ms. Remains 42 /102 variables (removed 60) and now considering 66/126 (removed 60) transitions.
[2024-05-26 13:36:48] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 42 cols
[2024-05-26 13:36:48] [INFO ] Computed 11 invariants in 3 ms
[2024-05-26 13:36:48] [INFO ] Implicit Places using invariants in 55 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 39/102 places, 66/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 79 ms. Remains : 39/102 places, 66/126 transitions.
[2024-05-26 13:36:48] [INFO ] Flatten gal took : 2 ms
[2024-05-26 13:36:48] [INFO ] Flatten gal took : 3 ms
[2024-05-26 13:36:48] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-26 13:36:48] [INFO ] Flatten gal took : 3 ms
[2024-05-26 13:36:48] [INFO ] Flatten gal took : 2 ms
[2024-05-26 13:36:48] [INFO ] Time to serialize gal into /tmp/CTLFireability762776288391686983.gal : 1 ms
[2024-05-26 13:36:48] [INFO ] Time to serialize properties into /tmp/CTLFireability6438024299742708009.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability762776288391686983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6438024299742708009.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1254,0.044688,4696,2,735,5,5332,6,0,225,5676,0


Converting to forward existential form...Done !
original formula: AF(EG((((((Turn_1<1)||(TestTurn_2<1))&&((Turn_5<1)||(TestTurn_5<1)))&&(((Turn_4<1)||(TestTurn_3<1))&&((Turn_3<1)||(TestTurn_1<1))))&&(((T...214
=> equivalent forward existential formula: [FwdG(Init,!(EG((((((Turn_1<1)||(TestTurn_2<1))&&((Turn_5<1)||(TestTurn_5<1)))&&(((Turn_4<1)||(TestTurn_3<1))&&(...259
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, ...288
(forward)formula 0,0,0.375814,12616,1,0,197,50416,156,81,1613,37154,183
FORMULA Peterson-COL-2-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 102 transition count 91
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 67 transition count 91
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 70 place count 67 transition count 75
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 102 place count 51 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 108 place count 48 transition count 72
Applied a total of 108 rules in 11 ms. Remains 48 /102 variables (removed 54) and now considering 72/126 (removed 54) transitions.
[2024-05-26 13:36:49] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
// Phase 1: matrix 66 rows 48 cols
[2024-05-26 13:36:49] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 13:36:49] [INFO ] Implicit Places using invariants in 117 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 118 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 45/102 places, 72/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 135 ms. Remains : 45/102 places, 72/126 transitions.
[2024-05-26 13:36:49] [INFO ] Flatten gal took : 4 ms
[2024-05-26 13:36:49] [INFO ] Flatten gal took : 4 ms
[2024-05-26 13:36:49] [INFO ] Input system was already deterministic with 72 transitions.
RANDOM walk for 81 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
FORMULA Peterson-COL-2-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-26 13:36:49] [INFO ] Flatten gal took : 4 ms
[2024-05-26 13:36:49] [INFO ] Flatten gal took : 5 ms
[2024-05-26 13:36:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2058385483940585873.gal : 1 ms
[2024-05-26 13:36:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1017137587819092102.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2058385483940585873.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1017137587819092102.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-26 13:36:49] [INFO ] Flatten gal took : 11 ms
[2024-05-26 13:36:49] [INFO ] Flatten gal took : 4 ms
Total runtime 156299 ms.

BK_STOP 1716730609537

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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="Peterson-COL-2"
export BK_EXAMINATION="CTLFireability"
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 Peterson-COL-2, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-171654407100202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-2.tgz
mv Peterson-COL-2 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;