Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.5K Feb 25 22:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 22:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 22:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 25 22:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 44K Mar 5 18:23 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-4-LTLFireability-00
FORMULA_NAME Peterson-COL-4-LTLFireability-01
FORMULA_NAME Peterson-COL-4-LTLFireability-02
FORMULA_NAME Peterson-COL-4-LTLFireability-03
FORMULA_NAME Peterson-COL-4-LTLFireability-04
FORMULA_NAME Peterson-COL-4-LTLFireability-05
FORMULA_NAME Peterson-COL-4-LTLFireability-06
FORMULA_NAME Peterson-COL-4-LTLFireability-07
FORMULA_NAME Peterson-COL-4-LTLFireability-08
FORMULA_NAME Peterson-COL-4-LTLFireability-09
FORMULA_NAME Peterson-COL-4-LTLFireability-10
FORMULA_NAME Peterson-COL-4-LTLFireability-11
FORMULA_NAME Peterson-COL-4-LTLFireability-12
FORMULA_NAME Peterson-COL-4-LTLFireability-13
FORMULA_NAME Peterson-COL-4-LTLFireability-14
FORMULA_NAME Peterson-COL-4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679009116711

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-4
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-16 23:25:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 23:25:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 23:25:19] [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.
[2023-03-16 23:25:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 23:25:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1047 ms
[2023-03-16 23:25:21] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 39 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 23:25:21] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 8 ms.
[2023-03-16 23:25:21] [INFO ] Skeletonized 15 HLPN properties in 2 ms. Removed 1 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-COL-4-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 12 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
Finished random walk after 936 steps, including 0 resets, run visited all 13 properties in 47 ms. (steps per millisecond=19 )
[2023-03-16 23:25:21] [INFO ] Flatten gal took : 28 ms
[2023-03-16 23:25:21] [INFO ] Flatten gal took : 6 ms
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
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.
[2023-03-16 23:25:21] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 59 ms.
[2023-03-16 23:25:21] [INFO ] Unfolded 15 HLPN properties in 2 ms.
Deduced a syphon composed of 20 places in 11 ms
Reduce places removed 20 places and 40 transitions.
Support contains 480 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 27 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-16 23:25:21] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-16 23:25:21] [INFO ] Computed 19 place invariants in 45 ms
[2023-03-16 23:25:22] [INFO ] Implicit Places using invariants in 475 ms returned []
[2023-03-16 23:25:22] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:25:22] [INFO ] Invariant cache hit.
[2023-03-16 23:25:22] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:25:22] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
[2023-03-16 23:25:22] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:25:22] [INFO ] Invariant cache hit.
[2023-03-16 23:25:23] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1894 ms. Remains : 480/480 places, 690/690 transitions.
Support contains 480 out of 480 places after structural reductions.
[2023-03-16 23:25:23] [INFO ] Flatten gal took : 143 ms
[2023-03-16 23:25:24] [INFO ] Flatten gal took : 103 ms
[2023-03-16 23:25:24] [INFO ] Input system was already deterministic with 690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 23) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:25:24] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:25:24] [INFO ] Invariant cache hit.
[2023-03-16 23:25:25] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned sat
[2023-03-16 23:25:25] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 8 ms returned sat
[2023-03-16 23:25:25] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:25:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-16 23:25:25] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 15 ms returned sat
[2023-03-16 23:25:25] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:25:25] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:25:25] [INFO ] After 71ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:25:26] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 11 ms to minimize.
[2023-03-16 23:25:26] [INFO ] Deduced a trap composed of 49 places in 266 ms of which 2 ms to minimize.
[2023-03-16 23:25:26] [INFO ] Deduced a trap composed of 86 places in 253 ms of which 2 ms to minimize.
[2023-03-16 23:25:26] [INFO ] Deduced a trap composed of 50 places in 263 ms of which 1 ms to minimize.
[2023-03-16 23:25:27] [INFO ] Deduced a trap composed of 44 places in 206 ms of which 2 ms to minimize.
[2023-03-16 23:25:27] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 1 ms to minimize.
[2023-03-16 23:25:27] [INFO ] Deduced a trap composed of 69 places in 301 ms of which 2 ms to minimize.
[2023-03-16 23:25:28] [INFO ] Deduced a trap composed of 73 places in 244 ms of which 2 ms to minimize.
[2023-03-16 23:25:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2518 ms
[2023-03-16 23:25:28] [INFO ] After 2632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-16 23:25:28] [INFO ] After 3194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 20 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 480 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 288 transition count 498
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 384 place count 288 transition count 394
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 592 place count 184 transition count 394
Applied a total of 592 rules in 97 ms. Remains 184 /480 variables (removed 296) and now considering 394/690 (removed 296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 184/480 places, 394/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Finished probabilistic random walk after 46 steps, run visited all 1 properties in 10 ms. (steps per millisecond=4 )
Probabilistic random walk after 46 steps, saw 41 distinct states, run finished after 11 ms. (steps per millisecond=4 ) properties seen :1
FORMULA Peterson-COL-4-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 60 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 45 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-16 23:25:29] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:25:29] [INFO ] Invariant cache hit.
[2023-03-16 23:25:29] [INFO ] Implicit Places using invariants in 224 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 231 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 25 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 301 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 444 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-4-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (OR (AND (GEQ s33 1) (GEQ s62 1)) (AND (GEQ s47 1) (GEQ s61 1)) (AND (GEQ s35 1) (GEQ s51 1)) (AND (GEQ s37 1) (GEQ s59 1)) (AND (GEQ s31 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20442 reset in 724 ms.
Product exploration explored 100000 steps with 20369 reset in 717 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 325 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1)]
Knowledge based reduction with 3 factoid took 434 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-16 23:25:32] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-16 23:25:32] [INFO ] Computed 14 place invariants in 7 ms
[2023-03-16 23:25:34] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-16 23:25:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 23:25:35] [INFO ] [Real]Absence check using state equation in 822 ms returned sat
[2023-03-16 23:25:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 23:25:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2023-03-16 23:25:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 23:25:37] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2023-03-16 23:25:37] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:25:37] [INFO ] [Nat]Added 116 Read/Feed constraints in 30 ms returned sat
[2023-03-16 23:25:37] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 50 ms.
[2023-03-16 23:25:44] [INFO ] Added : 387 causal constraints over 78 iterations in 6769 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 26 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-16 23:25:44] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:25:44] [INFO ] Invariant cache hit.
[2023-03-16 23:25:44] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-16 23:25:44] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:25:44] [INFO ] Invariant cache hit.
[2023-03-16 23:25:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:25:45] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
[2023-03-16 23:25:45] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:25:45] [INFO ] Invariant cache hit.
[2023-03-16 23:25:45] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1556 ms. Remains : 475/475 places, 690/690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-16 23:25:46] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:25:46] [INFO ] Invariant cache hit.
[2023-03-16 23:25:48] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned sat
[2023-03-16 23:25:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 23:25:49] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2023-03-16 23:25:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 23:25:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-16 23:25:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 23:25:51] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2023-03-16 23:25:51] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:25:51] [INFO ] [Nat]Added 116 Read/Feed constraints in 37 ms returned sat
[2023-03-16 23:25:51] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 1 ms to minimize.
[2023-03-16 23:25:51] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 1 ms to minimize.
[2023-03-16 23:25:52] [INFO ] Deduced a trap composed of 48 places in 320 ms of which 1 ms to minimize.
[2023-03-16 23:25:52] [INFO ] Deduced a trap composed of 27 places in 336 ms of which 1 ms to minimize.
[2023-03-16 23:25:52] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 1 ms to minimize.
[2023-03-16 23:25:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1664 ms
[2023-03-16 23:25:53] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 69 ms.
[2023-03-16 23:25:59] [INFO ] Added : 399 causal constraints over 80 iterations in 6620 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20397 reset in 834 ms.
Stack based approach found an accepted trace after 63342 steps with 12888 reset with depth 9 and stack size 9 in 537 ms.
FORMULA Peterson-COL-4-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-00 finished in 32077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((X((G(p0) U (p2&&G(p0))))||p1))))))'
Support contains 110 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 480 transition count 686
Reduce places removed 4 places and 0 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 1 with 104 rules applied. Total rules applied 108 place count 476 transition count 586
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 208 place count 376 transition count 586
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 208 place count 376 transition count 566
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 248 place count 356 transition count 566
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 280 place count 340 transition count 550
Applied a total of 280 rules in 86 ms. Remains 340 /480 variables (removed 140) and now considering 550/690 (removed 140) transitions.
[2023-03-16 23:26:01] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
// Phase 1: matrix 490 rows 340 cols
[2023-03-16 23:26:01] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-16 23:26:01] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-16 23:26:01] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
[2023-03-16 23:26:01] [INFO ] Invariant cache hit.
[2023-03-16 23:26:01] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:26:02] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1326 ms to find 0 implicit places.
[2023-03-16 23:26:02] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-16 23:26:02] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
[2023-03-16 23:26:02] [INFO ] Invariant cache hit.
[2023-03-16 23:26:03] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 340/480 places, 550/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2059 ms. Remains : 340/480 places, 550/690 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-4-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={1} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={1} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s116 1) (GEQ s120 1) (GEQ s124 1) (GEQ s128 1) (GEQ s63 1) (GEQ s132 1) (GEQ s67 1) (GEQ s136 1) (GEQ s71 1) (GEQ s140 1) (GEQ s75 1) (GEQ s14...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1056 ms.
Stack based approach found an accepted trace after 125 steps with 3 reset with depth 94 and stack size 94 in 2 ms.
FORMULA Peterson-COL-4-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-01 finished in 3394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(p1))))))'
Support contains 130 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-16 23:26:04] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-16 23:26:04] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-16 23:26:04] [INFO ] Implicit Places using invariants in 222 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 224 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 235 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-4-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (GEQ s427 1) (GEQ s425 1) (GEQ s423 1) (GEQ s437 1) (GEQ s435 1) (GEQ s433 1) (GEQ s431 1) (GEQ s382 1) (GEQ s445 1) (GEQ s380 1) (GEQ s443 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1281 ms.
Product exploration explored 100000 steps with 0 reset in 1308 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 188 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 149 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 263 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 130 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-16 23:26:08] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-16 23:26:08] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-16 23:26:09] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-16 23:26:09] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:26:09] [INFO ] Invariant cache hit.
[2023-03-16 23:26:09] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:26:09] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2023-03-16 23:26:09] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:26:09] [INFO ] Invariant cache hit.
[2023-03-16 23:26:10] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1930 ms. Remains : 475/475 places, 690/690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 67 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 244 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1510 ms.
Product exploration explored 100000 steps with 0 reset in 1232 ms.
Built C files in :
/tmp/ltsmin13046165656887834688
[2023-03-16 23:26:14] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13046165656887834688
Running compilation step : cd /tmp/ltsmin13046165656887834688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1978 ms.
Running link step : cd /tmp/ltsmin13046165656887834688;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin13046165656887834688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15392134510290998484.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 130 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-16 23:26:30] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:26:30] [INFO ] Invariant cache hit.
[2023-03-16 23:26:30] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-16 23:26:30] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:26:30] [INFO ] Invariant cache hit.
[2023-03-16 23:26:30] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:26:31] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
[2023-03-16 23:26:31] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:26:31] [INFO ] Invariant cache hit.
[2023-03-16 23:26:31] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1837 ms. Remains : 475/475 places, 690/690 transitions.
Built C files in :
/tmp/ltsmin9390325857003158042
[2023-03-16 23:26:31] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9390325857003158042
Running compilation step : cd /tmp/ltsmin9390325857003158042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1763 ms.
Running link step : cd /tmp/ltsmin9390325857003158042;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9390325857003158042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15059708777663525686.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 23:26:47] [INFO ] Flatten gal took : 48 ms
[2023-03-16 23:26:47] [INFO ] Flatten gal took : 43 ms
[2023-03-16 23:26:47] [INFO ] Time to serialize gal into /tmp/LTL5005571157387044694.gal : 8 ms
[2023-03-16 23:26:47] [INFO ] Time to serialize properties into /tmp/LTL9061120667223238650.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5005571157387044694.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13113869826389892133.hoa' '-atoms' '/tmp/LTL9061120667223238650.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9061120667223238650.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13113869826389892133.hoa
Detected timeout of ITS tools.
[2023-03-16 23:27:02] [INFO ] Flatten gal took : 35 ms
[2023-03-16 23:27:02] [INFO ] Flatten gal took : 38 ms
[2023-03-16 23:27:02] [INFO ] Time to serialize gal into /tmp/LTL8403777715103008543.gal : 4 ms
[2023-03-16 23:27:02] [INFO ] Time to serialize properties into /tmp/LTL11858886788403917192.ltl : 3 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8403777715103008543.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11858886788403917192.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("((((((((IsEndLoop_52>=1)||(IsEndLoop_50>=1))||((IsEndLoop_48>=1)||(IsEndLoop_62>=1)))||(((IsEndLoop_60>=1)||(IsEndLoop_58...5677
Formula 0 simplified : XXF(!"(((((((((AskForSection_2<1)||(Turn_13<1))&&((AskForSection_7<1)||(Turn_18<1)))&&(((AskForSection_11<1)||(Turn_17<1))&&((AskFor...5667
Detected timeout of ITS tools.
[2023-03-16 23:27:17] [INFO ] Flatten gal took : 33 ms
[2023-03-16 23:27:17] [INFO ] Applying decomposition
[2023-03-16 23:27:17] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14193122896483610071.txt' '-o' '/tmp/graph14193122896483610071.bin' '-w' '/tmp/graph14193122896483610071.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14193122896483610071.bin' '-l' '-1' '-v' '-w' '/tmp/graph14193122896483610071.weights' '-q' '0' '-e' '0.001'
[2023-03-16 23:27:17] [INFO ] Decomposing Gal with order
[2023-03-16 23:27:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 23:27:17] [INFO ] Removed a total of 504 redundant transitions.
[2023-03-16 23:27:17] [INFO ] Flatten gal took : 103 ms
[2023-03-16 23:27:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 16 ms.
[2023-03-16 23:27:17] [INFO ] Time to serialize gal into /tmp/LTL2213350446499223983.gal : 17 ms
[2023-03-16 23:27:17] [INFO ] Time to serialize properties into /tmp/LTL11102263252318890592.ltl : 3 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2213350446499223983.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11102263252318890592.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("((((((((i14.i2.u162.IsEndLoop_52>=1)||(i14.i1.u161.IsEndLoop_50>=1))||((i13.i1.u42.IsEndLoop_48>=1)||(i7.i1.u49.IsEndLoop...8025
Formula 0 simplified : XXF(!"(((((((((i2.u67.AskForSection_2<1)||(i2.u13.Turn_13<1))&&((i3.u68.AskForSection_7<1)||(i3.u73.Turn_18<1)))&&(((i3.u71.AskForSe...8015
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18352811218150676382
[2023-03-16 23:27:33] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18352811218150676382
Running compilation step : cd /tmp/ltsmin18352811218150676382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1801 ms.
Running link step : cd /tmp/ltsmin18352811218150676382;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18352811218150676382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X((LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Peterson-COL-4-LTLFireability-02 finished in 103544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F(!p1))||p0)) U (F(p2)&&X(p3))))'
Support contains 200 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-16 23:27:48] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-16 23:27:48] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-16 23:27:48] [INFO ] Implicit Places using invariants in 242 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 244 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 256 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3) p1), (NOT p3), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (GEQ s188 1) (GEQ s187 1) (GEQ s170 1) (GEQ s174 1) (GEQ s172 1) (GEQ s171 1) (GEQ s178 1) (GEQ s176 1) (GEQ s175 1) (GEQ s182 1) (GEQ s180 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6661 reset in 1079 ms.
Stack based approach found an accepted trace after 16430 steps with 1102 reset with depth 14 and stack size 14 in 290 ms.
FORMULA Peterson-COL-4-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-05 finished in 1973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G((X(p1)||p0)))) U (G(p2)||X(p3))))'
Support contains 200 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-16 23:27:50] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:27:50] [INFO ] Invariant cache hit.
[2023-03-16 23:27:50] [INFO ] Implicit Places using invariants in 282 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 284 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 297 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 458 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p2), acceptance={} source=9 dest: 6}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(OR (GEQ s427 1) (GEQ s425 1) (GEQ s423 1) (GEQ s437 1) (GEQ s435 1) (GEQ s433 1) (GEQ s431 1) (GEQ s382 1) (GEQ s445 1) (GEQ s380 1) (GEQ s443 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-4-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-4-LTLFireability-06 finished in 787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(((p1||X(X(F(p2)))) U (p3&&(p1||X(X(F(p2)))))))||p0))))'
Support contains 225 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-16 23:27:50] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:27:50] [INFO ] Invariant cache hit.
[2023-03-16 23:27:51] [INFO ] Implicit Places using invariants in 187 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 189 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 203 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s313 1)) (AND (GEQ s3 1) (GEQ s360 1)) (AND (GEQ s3 1) (GEQ s307 1)) (AND (GEQ s9 1) (GEQ s310 1)) (AND (GEQ s7 1) (GEQ s366 1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13361 reset in 947 ms.
Product exploration explored 100000 steps with 13335 reset in 686 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 6 states, 7 edges and 4 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Finished random walk after 24 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p3), (F p2), (F p1)]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
[2023-03-16 23:27:54] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-16 23:27:54] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-16 23:27:55] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-16 23:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 23:27:56] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2023-03-16 23:27:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 23:27:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 24 ms returned sat
[2023-03-16 23:27:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 23:27:58] [INFO ] [Nat]Absence check using state equation in 900 ms returned sat
[2023-03-16 23:27:58] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:27:58] [INFO ] [Nat]Added 116 Read/Feed constraints in 51 ms returned sat
[2023-03-16 23:27:59] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 1 ms to minimize.
[2023-03-16 23:27:59] [INFO ] Deduced a trap composed of 14 places in 400 ms of which 1 ms to minimize.
[2023-03-16 23:28:00] [INFO ] Deduced a trap composed of 46 places in 349 ms of which 4 ms to minimize.
[2023-03-16 23:28:00] [INFO ] Deduced a trap composed of 98 places in 272 ms of which 1 ms to minimize.
[2023-03-16 23:28:00] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 0 ms to minimize.
[2023-03-16 23:28:01] [INFO ] Deduced a trap composed of 73 places in 279 ms of which 0 ms to minimize.
[2023-03-16 23:28:01] [INFO ] Deduced a trap composed of 91 places in 316 ms of which 1 ms to minimize.
[2023-03-16 23:28:01] [INFO ] Deduced a trap composed of 95 places in 209 ms of which 1 ms to minimize.
[2023-03-16 23:28:01] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 0 ms to minimize.
[2023-03-16 23:28:02] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 0 ms to minimize.
[2023-03-16 23:28:02] [INFO ] Deduced a trap composed of 95 places in 180 ms of which 1 ms to minimize.
[2023-03-16 23:28:02] [INFO ] Deduced a trap composed of 73 places in 186 ms of which 1 ms to minimize.
[2023-03-16 23:28:02] [INFO ] Deduced a trap composed of 91 places in 183 ms of which 1 ms to minimize.
[2023-03-16 23:28:03] [INFO ] Deduced a trap composed of 69 places in 257 ms of which 1 ms to minimize.
[2023-03-16 23:28:03] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4197 ms
[2023-03-16 23:28:03] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 106 ms.
[2023-03-16 23:28:11] [INFO ] Added : 435 causal constraints over 87 iterations in 8410 ms. Result :unknown
Could not prove EG (NOT p3)
[2023-03-16 23:28:11] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:28:11] [INFO ] Invariant cache hit.
[2023-03-16 23:28:14] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-16 23:28:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 23:28:15] [INFO ] [Real]Absence check using state equation in 974 ms returned sat
[2023-03-16 23:28:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 23:28:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2023-03-16 23:28:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 23:28:17] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2023-03-16 23:28:17] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:28:17] [INFO ] [Nat]Added 116 Read/Feed constraints in 56 ms returned sat
[2023-03-16 23:28:18] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 1 ms to minimize.
[2023-03-16 23:28:18] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 1 ms to minimize.
[2023-03-16 23:28:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 485 ms
[2023-03-16 23:28:18] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 53 ms.
[2023-03-16 23:28:21] [INFO ] Added : 201 causal constraints over 41 iterations in 3540 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 225 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-16 23:28:21] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:28:21] [INFO ] Invariant cache hit.
[2023-03-16 23:28:22] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-16 23:28:22] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:28:22] [INFO ] Invariant cache hit.
[2023-03-16 23:28:22] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:28:22] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2023-03-16 23:28:22] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:28:22] [INFO ] Invariant cache hit.
[2023-03-16 23:28:23] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1297 ms. Remains : 475/475 places, 690/690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Finished random walk after 16 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F p3), (F p2), (F p1)]
Knowledge based reduction with 2 factoid took 217 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
[2023-03-16 23:28:24] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:28:24] [INFO ] Invariant cache hit.
[2023-03-16 23:28:26] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-16 23:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 23:28:27] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2023-03-16 23:28:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 23:28:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-16 23:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 23:28:28] [INFO ] [Nat]Absence check using state equation in 695 ms returned sat
[2023-03-16 23:28:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:28:28] [INFO ] [Nat]Added 116 Read/Feed constraints in 49 ms returned sat
[2023-03-16 23:28:29] [INFO ] Deduced a trap composed of 17 places in 387 ms of which 1 ms to minimize.
[2023-03-16 23:28:29] [INFO ] Deduced a trap composed of 53 places in 374 ms of which 1 ms to minimize.
[2023-03-16 23:28:30] [INFO ] Deduced a trap composed of 42 places in 346 ms of which 1 ms to minimize.
[2023-03-16 23:28:30] [INFO ] Deduced a trap composed of 43 places in 310 ms of which 2 ms to minimize.
[2023-03-16 23:28:30] [INFO ] Deduced a trap composed of 39 places in 371 ms of which 1 ms to minimize.
[2023-03-16 23:28:31] [INFO ] Deduced a trap composed of 14 places in 375 ms of which 1 ms to minimize.
[2023-03-16 23:28:31] [INFO ] Deduced a trap composed of 42 places in 371 ms of which 1 ms to minimize.
[2023-03-16 23:28:32] [INFO ] Deduced a trap composed of 61 places in 385 ms of which 1 ms to minimize.
[2023-03-16 23:28:32] [INFO ] Deduced a trap composed of 34 places in 285 ms of which 1 ms to minimize.
[2023-03-16 23:28:32] [INFO ] Deduced a trap composed of 91 places in 305 ms of which 1 ms to minimize.
[2023-03-16 23:28:33] [INFO ] Deduced a trap composed of 116 places in 405 ms of which 1 ms to minimize.
[2023-03-16 23:28:33] [INFO ] Deduced a trap composed of 62 places in 300 ms of which 1 ms to minimize.
[2023-03-16 23:28:34] [INFO ] Deduced a trap composed of 49 places in 380 ms of which 3 ms to minimize.
[2023-03-16 23:28:34] [INFO ] Deduced a trap composed of 64 places in 304 ms of which 1 ms to minimize.
[2023-03-16 23:28:34] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5565 ms
[2023-03-16 23:28:34] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 37 ms.
[2023-03-16 23:28:40] [INFO ] Added : 442 causal constraints over 89 iterations in 6455 ms. Result :sat
Could not prove EG (NOT p3)
[2023-03-16 23:28:40] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:28:41] [INFO ] Invariant cache hit.
[2023-03-16 23:28:43] [INFO ] [Real]Absence check using 14 positive place invariants in 25 ms returned sat
[2023-03-16 23:28:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 23:28:44] [INFO ] [Real]Absence check using state equation in 1017 ms returned sat
[2023-03-16 23:28:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 23:28:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-16 23:28:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 23:28:46] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2023-03-16 23:28:46] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:28:47] [INFO ] [Nat]Added 116 Read/Feed constraints in 55 ms returned sat
[2023-03-16 23:28:47] [INFO ] Deduced a trap composed of 25 places in 342 ms of which 1 ms to minimize.
[2023-03-16 23:28:47] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 1 ms to minimize.
[2023-03-16 23:28:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 677 ms
[2023-03-16 23:28:47] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 49 ms.
[2023-03-16 23:28:50] [INFO ] Added : 201 causal constraints over 41 iterations in 3047 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 13349 reset in 588 ms.
Product exploration explored 100000 steps with 13374 reset in 608 ms.
Applying partial POR strategy [false, false, false, false, false, true]
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Support contains 225 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 475 transition count 690
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 89 Pre rules applied. Total rules applied 36 place count 475 transition count 690
Deduced a syphon composed of 125 places in 0 ms
Iterating global reduction 1 with 89 rules applied. Total rules applied 125 place count 475 transition count 690
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 177 place count 423 transition count 638
Deduced a syphon composed of 73 places in 1 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 229 place count 423 transition count 638
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 249 place count 423 transition count 638
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 253 place count 419 transition count 634
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 257 place count 419 transition count 634
Deduced a syphon composed of 89 places in 0 ms
Applied a total of 257 rules in 65 ms. Remains 419 /475 variables (removed 56) and now considering 634/690 (removed 56) transitions.
[2023-03-16 23:28:52] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-16 23:28:52] [INFO ] Flow matrix only has 574 transitions (discarded 60 similar events)
// Phase 1: matrix 574 rows 419 cols
[2023-03-16 23:28:52] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-16 23:28:53] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/475 places, 634/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 597 ms. Remains : 419/475 places, 634/690 transitions.
Built C files in :
/tmp/ltsmin11857989982194509591
[2023-03-16 23:28:53] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11857989982194509591
Running compilation step : cd /tmp/ltsmin11857989982194509591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2366 ms.
Running link step : cd /tmp/ltsmin11857989982194509591;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11857989982194509591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8069859703870896205.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 225 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-16 23:29:08] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-16 23:29:08] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-16 23:29:08] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-16 23:29:08] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:29:08] [INFO ] Invariant cache hit.
[2023-03-16 23:29:09] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:29:09] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2023-03-16 23:29:09] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:29:09] [INFO ] Invariant cache hit.
[2023-03-16 23:29:09] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1244 ms. Remains : 475/475 places, 690/690 transitions.
Built C files in :
/tmp/ltsmin4058040722339850560
[2023-03-16 23:29:09] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4058040722339850560
Running compilation step : cd /tmp/ltsmin4058040722339850560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1939 ms.
Running link step : cd /tmp/ltsmin4058040722339850560;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin4058040722339850560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10404133818297574108.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 23:29:24] [INFO ] Flatten gal took : 27 ms
[2023-03-16 23:29:25] [INFO ] Flatten gal took : 30 ms
[2023-03-16 23:29:25] [INFO ] Time to serialize gal into /tmp/LTL12542454712743571177.gal : 5 ms
[2023-03-16 23:29:25] [INFO ] Time to serialize properties into /tmp/LTL8382755550245051492.prop : 3 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12542454712743571177.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15978754108190791737.hoa' '-atoms' '/tmp/LTL8382755550245051492.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8382755550245051492.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15978754108190791737.hoa
Detected timeout of ITS tools.
[2023-03-16 23:29:40] [INFO ] Flatten gal took : 27 ms
[2023-03-16 23:29:40] [INFO ] Flatten gal took : 27 ms
[2023-03-16 23:29:40] [INFO ] Time to serialize gal into /tmp/LTL14601547897211778404.gal : 5 ms
[2023-03-16 23:29:40] [INFO ] Time to serialize properties into /tmp/LTL7538442829606409740.ltl : 4 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14601547897211778404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7538442829606409740.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((((((((X((("(((((((((TestIdentity_61>=1)||(TestIdentity_59>=1))||((TestIdentity_2>=1)||(TestIdentity_69>=1)))||(((TestIdentity_...24006
Formula 0 simplified : XX(!"(((((((WantSection_1>=1)&&(TestAlone_80>=1))||((WantSection_7>=1)&&(TestAlone_53>=1)))||(((WantSection_5>=1)&&(TestAlone_32>=1)...15440
Detected timeout of ITS tools.
[2023-03-16 23:29:55] [INFO ] Flatten gal took : 25 ms
[2023-03-16 23:29:55] [INFO ] Applying decomposition
[2023-03-16 23:29:55] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11672880101911752449.txt' '-o' '/tmp/graph11672880101911752449.bin' '-w' '/tmp/graph11672880101911752449.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11672880101911752449.bin' '-l' '-1' '-v' '-w' '/tmp/graph11672880101911752449.weights' '-q' '0' '-e' '0.001'
[2023-03-16 23:29:55] [INFO ] Decomposing Gal with order
[2023-03-16 23:29:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 23:29:55] [INFO ] Removed a total of 530 redundant transitions.
[2023-03-16 23:29:55] [INFO ] Flatten gal took : 84 ms
[2023-03-16 23:29:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-16 23:29:55] [INFO ] Time to serialize gal into /tmp/LTL5451721085323554428.gal : 9 ms
[2023-03-16 23:29:55] [INFO ] Time to serialize properties into /tmp/LTL4306674960808249013.ltl : 7 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5451721085323554428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4306674960808249013.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((((((((X((("(((((((((i18.u125.TestIdentity_61>=1)||(i10.i1.u52.TestIdentity_59>=1))||((i4.i0.u87.TestIdentity_2>=1)||(i23.i1.u5...33772
Formula 0 simplified : XX(!"(((((((i4.i0.u1.WantSection_3>=1)&&(i22.i0.u39.TestAlone_41>=1))||((i8.i0.u0.WantSection_1>=1)&&(i1.u56.TestAlone_70>=1)))||(((...21860
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1615127122785721810
[2023-03-16 23:30:10] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1615127122785721810
Running compilation step : cd /tmp/ltsmin1615127122785721810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1808 ms.
Running link step : cd /tmp/ltsmin1615127122785721810;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1615127122785721810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((X((((LTLAPp1==true)||X(X(<>((LTLAPp2==true))))) U ((LTLAPp3==true)&&((LTLAPp1==true)||X(X(<>((LTLAPp2==true))))))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Peterson-COL-4-LTLFireability-07 finished in 155050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 80 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 480 transition count 634
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 424 transition count 634
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 112 place count 424 transition count 550
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 280 place count 340 transition count 550
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
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 320 place count 320 transition count 530
Applied a total of 320 rules in 55 ms. Remains 320 /480 variables (removed 160) and now considering 530/690 (removed 160) transitions.
[2023-03-16 23:30:26] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
// Phase 1: matrix 470 rows 320 cols
[2023-03-16 23:30:26] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-16 23:30:26] [INFO ] Implicit Places using invariants in 188 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 190 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 315/480 places, 530/690 transitions.
Applied a total of 0 rules in 11 ms. Remains 315 /315 variables (removed 0) and now considering 530/530 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 257 ms. Remains : 315/480 places, 530/690 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s144 1) (GEQ s142 1) (GEQ s96 1) (GEQ s150 1) (GEQ s152 1) (GEQ s147 1) (GEQ s99 1) (GEQ s98 1) (GEQ s149 1) (GEQ s157 1) (GEQ s101 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7751 reset in 765 ms.
Product exploration explored 100000 steps with 7720 reset in 556 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2023-03-16 23:30:27] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
// Phase 1: matrix 470 rows 315 cols
[2023-03-16 23:30:28] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-16 23:30:28] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-16 23:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 23:30:28] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2023-03-16 23:30:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 23:30:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-16 23:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 23:30:29] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2023-03-16 23:30:29] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:30:29] [INFO ] [Nat]Added 116 Read/Feed constraints in 44 ms returned sat
[2023-03-16 23:30:30] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 1 ms to minimize.
[2023-03-16 23:30:30] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 1 ms to minimize.
[2023-03-16 23:30:30] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 1 ms to minimize.
[2023-03-16 23:30:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 530 ms
[2023-03-16 23:30:30] [INFO ] Computed and/alt/rep : 429/946/429 causal constraints (skipped 36 transitions) in 32 ms.
[2023-03-16 23:30:31] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 0 ms to minimize.
[2023-03-16 23:30:32] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 0 ms to minimize.
[2023-03-16 23:30:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 433 ms
[2023-03-16 23:30:32] [INFO ] Added : 141 causal constraints over 29 iterations in 1930 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 80 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 530/530 transitions.
Applied a total of 0 rules in 20 ms. Remains 315 /315 variables (removed 0) and now considering 530/530 (removed 0) transitions.
[2023-03-16 23:30:32] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-16 23:30:32] [INFO ] Invariant cache hit.
[2023-03-16 23:30:32] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-16 23:30:32] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-16 23:30:32] [INFO ] Invariant cache hit.
[2023-03-16 23:30:32] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:30:33] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
[2023-03-16 23:30:33] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 23:30:33] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-16 23:30:33] [INFO ] Invariant cache hit.
[2023-03-16 23:30:34] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1733 ms. Remains : 315/315 places, 530/530 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2023-03-16 23:30:34] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-16 23:30:34] [INFO ] Invariant cache hit.
[2023-03-16 23:30:35] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-16 23:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 23:30:35] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2023-03-16 23:30:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 23:30:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 31 ms returned sat
[2023-03-16 23:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 23:30:36] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2023-03-16 23:30:36] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:30:36] [INFO ] [Nat]Added 116 Read/Feed constraints in 67 ms returned sat
[2023-03-16 23:30:36] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 0 ms to minimize.
[2023-03-16 23:30:36] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 0 ms to minimize.
[2023-03-16 23:30:37] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 1 ms to minimize.
[2023-03-16 23:30:37] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 1 ms to minimize.
[2023-03-16 23:30:37] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2023-03-16 23:30:37] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 1 ms to minimize.
[2023-03-16 23:30:37] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 1 ms to minimize.
[2023-03-16 23:30:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1241 ms
[2023-03-16 23:30:37] [INFO ] Computed and/alt/rep : 429/946/429 causal constraints (skipped 36 transitions) in 46 ms.
[2023-03-16 23:30:39] [INFO ] Added : 169 causal constraints over 34 iterations in 1683 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7749 reset in 712 ms.
Product exploration explored 100000 steps with 7770 reset in 475 ms.
Built C files in :
/tmp/ltsmin17049115469080006908
[2023-03-16 23:30:40] [INFO ] Computing symmetric may disable matrix : 530 transitions.
[2023-03-16 23:30:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 23:30:40] [INFO ] Computing symmetric may enable matrix : 530 transitions.
[2023-03-16 23:30:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 23:30:40] [INFO ] Computing Do-Not-Accords matrix : 530 transitions.
[2023-03-16 23:30:40] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 23:30:40] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17049115469080006908
Running compilation step : cd /tmp/ltsmin17049115469080006908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1750 ms.
Running link step : cd /tmp/ltsmin17049115469080006908;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17049115469080006908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14645977866883204223.hoa' '--buchi-type=spotba'
LTSmin run took 8115 ms.
FORMULA Peterson-COL-4-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-COL-4-LTLFireability-08 finished in 24901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 40 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 400 place count 280 transition count 390
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 600 place count 180 transition count 390
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
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 640 place count 160 transition count 370
Applied a total of 640 rules in 29 ms. Remains 160 /480 variables (removed 320) and now considering 370/690 (removed 320) transitions.
[2023-03-16 23:30:50] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 160 cols
[2023-03-16 23:30:50] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-16 23:30:51] [INFO ] Implicit Places using invariants in 220 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 221 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/480 places, 370/690 transitions.
Applied a total of 0 rules in 22 ms. Remains 155 /155 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 273 ms. Remains : 155/480 places, 370/690 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s43 1)) (AND (GEQ s20 1) (GEQ s44 1)) (AND (GEQ s25 1) (GEQ s49 1)) (AND (GEQ s30 1) (GEQ s46 1)) (AND (GEQ s15 1) (GEQ s47 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 12917 reset in 918 ms.
Stack based approach found an accepted trace after 197 steps with 24 reset with depth 7 and stack size 7 in 2 ms.
FORMULA Peterson-COL-4-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-09 finished in 1248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 120 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 480 transition count 634
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 424 transition count 634
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 112 place count 424 transition count 565
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 250 place count 355 transition count 565
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 290 place count 335 transition count 545
Applied a total of 290 rules in 28 ms. Remains 335 /480 variables (removed 145) and now considering 545/690 (removed 145) transitions.
[2023-03-16 23:30:52] [INFO ] Flow matrix only has 485 transitions (discarded 60 similar events)
// Phase 1: matrix 485 rows 335 cols
[2023-03-16 23:30:52] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-16 23:30:52] [INFO ] Implicit Places using invariants in 465 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 468 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 330/480 places, 545/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 330 /330 variables (removed 0) and now considering 545/545 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 505 ms. Remains : 330/480 places, 545/690 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s159 1) (GEQ s157 1) (GEQ s111 1) (GEQ s165 1) (GEQ s167 1) (GEQ s162 1) (GEQ s114 1) (GEQ s113 1) (GEQ s164 1) (GEQ s172 1) (GEQ s116 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-4-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-4-LTLFireability-10 finished in 665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 15 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-16 23:30:52] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-16 23:30:52] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-16 23:30:53] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-16 23:30:53] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:30:53] [INFO ] Invariant cache hit.
[2023-03-16 23:30:53] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:30:54] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1506 ms to find 0 implicit places.
[2023-03-16 23:30:54] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:30:54] [INFO ] Invariant cache hit.
[2023-03-16 23:30:54] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1967 ms. Remains : 480/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-4-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (GEQ s178 1) (GEQ s194 1) (GEQ s182 1) (GEQ s186 1) (GEQ s190 1)), p0:(OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s3 1) (GEQ s11 1)) (AND (GEQ s2 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 833 reset in 281 ms.
Stack based approach found an accepted trace after 1104 steps with 8 reset with depth 81 and stack size 81 in 4 ms.
FORMULA Peterson-COL-4-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-11 finished in 2400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((!p1 U (p2||G(!p1)))&&p0))))'
Support contains 130 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 480 transition count 570
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 360 transition count 570
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 240 place count 360 transition count 475
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 430 place count 265 transition count 475
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
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 470 place count 245 transition count 455
Applied a total of 470 rules in 34 ms. Remains 245 /480 variables (removed 235) and now considering 455/690 (removed 235) transitions.
[2023-03-16 23:30:55] [INFO ] Flow matrix only has 395 transitions (discarded 60 similar events)
// Phase 1: matrix 395 rows 245 cols
[2023-03-16 23:30:55] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-16 23:30:55] [INFO ] Implicit Places using invariants in 127 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 129 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 240/480 places, 455/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 240 /240 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 174 ms. Remains : 240/480 places, 455/690 transitions.
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : Peterson-COL-4-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND (NOT p1) p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (NOT (OR (AND (GEQ s7 1) (GEQ s118 1)) (AND (GEQ s3 1) (GEQ s165 1)) (AND (GEQ s3 1) (GEQ s112 1)) (AND (GEQ s9 1) (GEQ s115 1)) (AND (GEQ s7 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2086 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 1 ms.
FORMULA Peterson-COL-4-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-12 finished in 2340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((F(p0)&&F(G(!p1)))))))'
Support contains 160 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 480 transition count 682
Reduce places removed 8 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 24 rules applied. Total rules applied 32 place count 472 transition count 666
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 48 place count 456 transition count 666
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 48 place count 456 transition count 642
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 96 place count 432 transition count 642
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 128 place count 416 transition count 626
Applied a total of 128 rules in 27 ms. Remains 416 /480 variables (removed 64) and now considering 626/690 (removed 64) transitions.
[2023-03-16 23:30:57] [INFO ] Flow matrix only has 566 transitions (discarded 60 similar events)
// Phase 1: matrix 566 rows 416 cols
[2023-03-16 23:30:57] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-16 23:30:57] [INFO ] Implicit Places using invariants in 260 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 263 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/480 places, 626/690 transitions.
Applied a total of 0 rules in 12 ms. Remains 411 /411 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 303 ms. Remains : 411/480 places, 626/690 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : Peterson-COL-4-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s373 1) (GEQ s371 1) (GEQ s370 1) (GEQ s381 1) (GEQ s379 1) (GEQ s378 1) (GEQ s376 1) (GEQ s337 1) (GEQ s387 1) (GEQ s335 1) (GEQ s386 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 198 reset in 784 ms.
Stack based approach found an accepted trace after 826 steps with 30 reset with depth 22 and stack size 22 in 4 ms.
FORMULA Peterson-COL-4-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-13 finished in 1256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||(F(p0)&&X(X(X(F((!p1||G(p0))))))))))'
Support contains 60 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-16 23:30:58] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-16 23:30:58] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-16 23:30:58] [INFO ] Implicit Places using invariants in 187 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 204 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 218 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (LT s429 1) (LT s459 1) (LT s394 1) (LT s424 1) (LT s469 1) (LT s404 1) (LT s434 1) (LT s399 1) (LT s464 1) (LT s414 1) (LT s379 1) (LT s444 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17802 reset in 813 ms.
Product exploration explored 100000 steps with 17826 reset in 571 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 23:31:01] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-16 23:31:01] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-16 23:31:01] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-16 23:31:01] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 23:31:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-16 23:31:02] [INFO ] After 976ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 23:31:02] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:31:03] [INFO ] After 601ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 23:31:03] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 1 ms to minimize.
[2023-03-16 23:31:03] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 1 ms to minimize.
[2023-03-16 23:31:04] [INFO ] Deduced a trap composed of 81 places in 230 ms of which 1 ms to minimize.
[2023-03-16 23:31:04] [INFO ] Deduced a trap composed of 58 places in 237 ms of which 1 ms to minimize.
[2023-03-16 23:31:04] [INFO ] Deduced a trap composed of 89 places in 178 ms of which 0 ms to minimize.
[2023-03-16 23:31:04] [INFO ] Deduced a trap composed of 56 places in 223 ms of which 5 ms to minimize.
[2023-03-16 23:31:05] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 1 ms to minimize.
[2023-03-16 23:31:05] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 1 ms to minimize.
[2023-03-16 23:31:05] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 0 ms to minimize.
[2023-03-16 23:31:05] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 5 ms to minimize.
[2023-03-16 23:31:05] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 0 ms to minimize.
[2023-03-16 23:31:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2242 ms
[2023-03-16 23:31:06] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 0 ms to minimize.
[2023-03-16 23:31:06] [INFO ] Deduced a trap composed of 25 places in 297 ms of which 1 ms to minimize.
[2023-03-16 23:31:07] [INFO ] Deduced a trap composed of 47 places in 224 ms of which 1 ms to minimize.
[2023-03-16 23:31:07] [INFO ] Deduced a trap composed of 47 places in 245 ms of which 1 ms to minimize.
[2023-03-16 23:31:07] [INFO ] Deduced a trap composed of 14 places in 253 ms of which 1 ms to minimize.
[2023-03-16 23:31:08] [INFO ] Deduced a trap composed of 26 places in 243 ms of which 1 ms to minimize.
[2023-03-16 23:31:08] [INFO ] Deduced a trap composed of 14 places in 239 ms of which 1 ms to minimize.
[2023-03-16 23:31:08] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 1 ms to minimize.
[2023-03-16 23:31:08] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 1 ms to minimize.
[2023-03-16 23:31:08] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 1 ms to minimize.
[2023-03-16 23:31:09] [INFO ] Deduced a trap composed of 80 places in 187 ms of which 1 ms to minimize.
[2023-03-16 23:31:09] [INFO ] Deduced a trap composed of 69 places in 187 ms of which 1 ms to minimize.
[2023-03-16 23:31:09] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 1 ms to minimize.
[2023-03-16 23:31:10] [INFO ] Deduced a trap composed of 61 places in 201 ms of which 1 ms to minimize.
[2023-03-16 23:31:10] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3921 ms
[2023-03-16 23:31:10] [INFO ] After 7226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1031 ms.
[2023-03-16 23:31:11] [INFO ] After 9424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 72 ms.
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 690/690 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 475 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 283 transition count 498
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 384 place count 283 transition count 394
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 592 place count 179 transition count 394
Applied a total of 592 rules in 21 ms. Remains 179 /475 variables (removed 296) and now considering 394/690 (removed 296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 179/475 places, 394/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 720096 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :{0=1}
Probabilistic random walk after 720096 steps, saw 120757 distinct states, run finished after 3005 ms. (steps per millisecond=239 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-16 23:31:14] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
// Phase 1: matrix 334 rows 179 cols
[2023-03-16 23:31:14] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-16 23:31:14] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-16 23:31:14] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:31:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-16 23:31:15] [INFO ] After 663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:31:15] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:31:16] [INFO ] After 472ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:31:16] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2023-03-16 23:31:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-03-16 23:31:16] [INFO ] After 1028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 493 ms.
[2023-03-16 23:31:17] [INFO ] After 2250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 6 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 179/179 places, 394/394 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 666984 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 666984 steps, saw 111849 distinct states, run finished after 3002 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:31:20] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-16 23:31:20] [INFO ] Invariant cache hit.
[2023-03-16 23:31:20] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-16 23:31:20] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:31:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-16 23:31:20] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:31:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:31:21] [INFO ] After 328ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:31:21] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
[2023-03-16 23:31:21] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
[2023-03-16 23:31:21] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2023-03-16 23:31:21] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2023-03-16 23:31:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 503 ms
[2023-03-16 23:31:22] [INFO ] After 1141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 321 ms.
[2023-03-16 23:31:22] [INFO ] After 1959ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 7 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 179/179 places, 394/394 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 7 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2023-03-16 23:31:22] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-16 23:31:22] [INFO ] Invariant cache hit.
[2023-03-16 23:31:22] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-16 23:31:22] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-16 23:31:22] [INFO ] Invariant cache hit.
[2023-03-16 23:31:22] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:31:23] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
[2023-03-16 23:31:23] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-16 23:31:23] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-16 23:31:23] [INFO ] Invariant cache hit.
[2023-03-16 23:31:23] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1215 ms. Remains : 179/179 places, 394/394 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 179 transition count 334
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 169 transition count 329
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 164 transition count 324
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 1 with 60 rules applied. Total rules applied 145 place count 164 transition count 264
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 40 rules applied. Total rules applied 185 place count 164 transition count 224
Reduce places removed 40 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 60 rules applied. Total rules applied 245 place count 124 transition count 204
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 265 place count 104 transition count 204
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 269 place count 104 transition count 200
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 273 place count 100 transition count 200
Applied a total of 273 rules in 99 ms. Remains 100 /179 variables (removed 79) and now considering 200/394 (removed 194) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 200 rows 100 cols
[2023-03-16 23:31:23] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-16 23:31:23] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-16 23:31:23] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:31:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-16 23:31:24] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:31:24] [INFO ] After 831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 345 ms.
[2023-03-16 23:31:25] [INFO ] After 1233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 286 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 27 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-16 23:31:25] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-16 23:31:25] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-16 23:31:26] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-16 23:31:26] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:31:26] [INFO ] Invariant cache hit.
[2023-03-16 23:31:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:31:27] [INFO ] Implicit Places using invariants and state equation in 1153 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
[2023-03-16 23:31:27] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:31:27] [INFO ] Invariant cache hit.
[2023-03-16 23:31:27] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2039 ms. Remains : 475/475 places, 690/690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 23:31:28] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:31:28] [INFO ] Invariant cache hit.
[2023-03-16 23:31:29] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-16 23:31:29] [INFO ] After 584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 23:31:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-16 23:31:30] [INFO ] After 998ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 23:31:30] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:31:31] [INFO ] After 717ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 23:31:31] [INFO ] Deduced a trap composed of 54 places in 159 ms of which 0 ms to minimize.
[2023-03-16 23:31:31] [INFO ] Deduced a trap composed of 65 places in 173 ms of which 1 ms to minimize.
[2023-03-16 23:31:32] [INFO ] Deduced a trap composed of 54 places in 257 ms of which 2 ms to minimize.
[2023-03-16 23:31:32] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 1 ms to minimize.
[2023-03-16 23:31:32] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 1 ms to minimize.
[2023-03-16 23:31:32] [INFO ] Deduced a trap composed of 50 places in 180 ms of which 1 ms to minimize.
[2023-03-16 23:31:33] [INFO ] Deduced a trap composed of 53 places in 274 ms of which 0 ms to minimize.
[2023-03-16 23:31:33] [INFO ] Deduced a trap composed of 70 places in 197 ms of which 2 ms to minimize.
[2023-03-16 23:31:33] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 1 ms to minimize.
[2023-03-16 23:31:33] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 1 ms to minimize.
[2023-03-16 23:31:34] [INFO ] Deduced a trap composed of 61 places in 238 ms of which 1 ms to minimize.
[2023-03-16 23:31:34] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 1 ms to minimize.
[2023-03-16 23:31:34] [INFO ] Deduced a trap composed of 36 places in 254 ms of which 1 ms to minimize.
[2023-03-16 23:31:34] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 1 ms to minimize.
[2023-03-16 23:31:35] [INFO ] Deduced a trap composed of 40 places in 285 ms of which 1 ms to minimize.
[2023-03-16 23:31:35] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 1 ms to minimize.
[2023-03-16 23:31:35] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4140 ms
[2023-03-16 23:31:36] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 0 ms to minimize.
[2023-03-16 23:31:36] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 1 ms to minimize.
[2023-03-16 23:31:37] [INFO ] Deduced a trap composed of 17 places in 339 ms of which 1 ms to minimize.
[2023-03-16 23:31:37] [INFO ] Deduced a trap composed of 25 places in 364 ms of which 1 ms to minimize.
[2023-03-16 23:31:37] [INFO ] Deduced a trap composed of 69 places in 174 ms of which 1 ms to minimize.
[2023-03-16 23:31:38] [INFO ] Deduced a trap composed of 58 places in 264 ms of which 1 ms to minimize.
[2023-03-16 23:31:38] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 0 ms to minimize.
[2023-03-16 23:31:38] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 1 ms to minimize.
[2023-03-16 23:31:39] [INFO ] Deduced a trap composed of 58 places in 270 ms of which 1 ms to minimize.
[2023-03-16 23:31:39] [INFO ] Deduced a trap composed of 78 places in 188 ms of which 1 ms to minimize.
[2023-03-16 23:31:39] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 1 ms to minimize.
[2023-03-16 23:31:40] [INFO ] Deduced a trap composed of 69 places in 158 ms of which 0 ms to minimize.
[2023-03-16 23:31:40] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 1 ms to minimize.
[2023-03-16 23:31:40] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 0 ms to minimize.
[2023-03-16 23:31:41] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 1 ms to minimize.
[2023-03-16 23:31:41] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 0 ms to minimize.
[2023-03-16 23:31:42] [INFO ] Deduced a trap composed of 25 places in 327 ms of which 1 ms to minimize.
[2023-03-16 23:31:42] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 1 ms to minimize.
[2023-03-16 23:31:42] [INFO ] Deduced a trap composed of 39 places in 232 ms of which 1 ms to minimize.
[2023-03-16 23:31:43] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 1 ms to minimize.
[2023-03-16 23:31:43] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 1 ms to minimize.
[2023-03-16 23:31:43] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 7259 ms
[2023-03-16 23:31:43] [INFO ] After 12836ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 921 ms.
[2023-03-16 23:31:44] [INFO ] After 14928ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 89 ms.
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 690/690 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 475 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 283 transition count 498
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 384 place count 283 transition count 394
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 592 place count 179 transition count 394
Applied a total of 592 rules in 21 ms. Remains 179 /475 variables (removed 296) and now considering 394/690 (removed 296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 179/475 places, 394/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Finished probabilistic random walk after 773782 steps, run visited all 2 properties in 2765 ms. (steps per millisecond=279 )
Probabilistic random walk after 773782 steps, saw 129645 distinct states, run finished after 2765 ms. (steps per millisecond=279 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 374 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 509 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 17771 reset in 807 ms.
Product exploration explored 100000 steps with 17861 reset in 699 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 475 transition count 690
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 89 Pre rules applied. Total rules applied 112 place count 475 transition count 690
Deduced a syphon composed of 201 places in 1 ms
Iterating global reduction 1 with 89 rules applied. Total rules applied 201 place count 475 transition count 690
Discarding 112 places :
Symmetric choice reduction at 1 with 112 rule applications. Total rules 313 place count 363 transition count 578
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 112 rules applied. Total rules applied 425 place count 363 transition count 578
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 184 places in 0 ms
Iterating global reduction 1 with 95 rules applied. Total rules applied 520 place count 363 transition count 578
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 600 place count 283 transition count 498
Deduced a syphon composed of 104 places in 1 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 680 place count 283 transition count 498
Deduced a syphon composed of 104 places in 15 ms
Applied a total of 680 rules in 89 ms. Remains 283 /475 variables (removed 192) and now considering 498/690 (removed 192) transitions.
[2023-03-16 23:31:50] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 23:31:50] [INFO ] Flow matrix only has 438 transitions (discarded 60 similar events)
// Phase 1: matrix 438 rows 283 cols
[2023-03-16 23:31:50] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-16 23:31:51] [INFO ] Dead Transitions using invariants and state equation in 731 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/475 places, 498/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 842 ms. Remains : 283/475 places, 498/690 transitions.
Built C files in :
/tmp/ltsmin10019341692668640514
[2023-03-16 23:31:51] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10019341692668640514
Running compilation step : cd /tmp/ltsmin10019341692668640514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1657 ms.
Running link step : cd /tmp/ltsmin10019341692668640514;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10019341692668640514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3510308802502665302.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-16 23:32:06] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-16 23:32:06] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-16 23:32:06] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-16 23:32:06] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:32:06] [INFO ] Invariant cache hit.
[2023-03-16 23:32:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:32:07] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
[2023-03-16 23:32:07] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-16 23:32:07] [INFO ] Invariant cache hit.
[2023-03-16 23:32:08] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1686 ms. Remains : 475/475 places, 690/690 transitions.
Built C files in :
/tmp/ltsmin10536526995584110010
[2023-03-16 23:32:08] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10536526995584110010
Running compilation step : cd /tmp/ltsmin10536526995584110010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1696 ms.
Running link step : cd /tmp/ltsmin10536526995584110010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10536526995584110010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15601864645522732112.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 23:32:23] [INFO ] Flatten gal took : 24 ms
[2023-03-16 23:32:23] [INFO ] Flatten gal took : 20 ms
[2023-03-16 23:32:23] [INFO ] Time to serialize gal into /tmp/LTL2405173540040878210.gal : 8 ms
[2023-03-16 23:32:23] [INFO ] Time to serialize properties into /tmp/LTL9158324535797489267.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2405173540040878210.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16974101844948809286.hoa' '-atoms' '/tmp/LTL9158324535797489267.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9158324535797489267.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16974101844948809286.hoa
Detected timeout of ITS tools.
[2023-03-16 23:32:38] [INFO ] Flatten gal took : 37 ms
[2023-03-16 23:32:38] [INFO ] Flatten gal took : 34 ms
[2023-03-16 23:32:38] [INFO ] Time to serialize gal into /tmp/LTL6648352491292230942.gal : 18 ms
[2023-03-16 23:32:38] [INFO ] Time to serialize properties into /tmp/LTL7305236640897216625.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6648352491292230942.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7305236640897216625.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((((((IsEndLoop_54<1)&&(IsEndLoop_84<1))&&((IsEndLoop_19<1)&&(IsEndLoop_49<1)))&&(((IsEndLoop_94<1)&&(IsEndLoop_29<1))&&((I...3897
Formula 0 simplified : X(FG!"((((((IsEndLoop_54<1)&&(IsEndLoop_84<1))&&((IsEndLoop_19<1)&&(IsEndLoop_49<1)))&&(((IsEndLoop_94<1)&&(IsEndLoop_29<1))&&((IsEn...3877
Detected timeout of ITS tools.
[2023-03-16 23:32:53] [INFO ] Flatten gal took : 20 ms
[2023-03-16 23:32:53] [INFO ] Applying decomposition
[2023-03-16 23:32:53] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16036397616485105673.txt' '-o' '/tmp/graph16036397616485105673.bin' '-w' '/tmp/graph16036397616485105673.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16036397616485105673.bin' '-l' '-1' '-v' '-w' '/tmp/graph16036397616485105673.weights' '-q' '0' '-e' '0.001'
[2023-03-16 23:32:53] [INFO ] Decomposing Gal with order
[2023-03-16 23:32:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 23:32:53] [INFO ] Removed a total of 530 redundant transitions.
[2023-03-16 23:32:53] [INFO ] Flatten gal took : 47 ms
[2023-03-16 23:32:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-16 23:32:54] [INFO ] Time to serialize gal into /tmp/LTL8178507168101832325.gal : 8 ms
[2023-03-16 23:32:54] [INFO ] Time to serialize properties into /tmp/LTL17451535184690825663.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8178507168101832325.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17451535184690825663.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((((((i0.u8.IsEndLoop_54<1)&&(i14.i1.u131.IsEndLoop_84<1))&&((i1.u5.IsEndLoop_19<1)&&(i4.u82.IsEndLoop_49<1)))&&(((i15.i1.u...5494
Formula 0 simplified : X(FG!"((((((i0.u8.IsEndLoop_54<1)&&(i14.i1.u131.IsEndLoop_84<1))&&((i1.u5.IsEndLoop_19<1)&&(i4.u82.IsEndLoop_49<1)))&&(((i15.i1.u164...5474
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5942134971587084489
[2023-03-16 23:33:09] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5942134971587084489
Running compilation step : cd /tmp/ltsmin5942134971587084489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1940 ms.
Running link step : cd /tmp/ltsmin5942134971587084489;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5942134971587084489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(X(X(<>(((LTLAPp1==true)||[]((LTLAPp0==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Peterson-COL-4-LTLFireability-14 finished in 145406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 80 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 480 transition count 602
Reduce places removed 88 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 168 rules applied. Total rules applied 256 place count 392 transition count 522
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 336 place count 312 transition count 522
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 336 place count 312 transition count 482
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 416 place count 272 transition count 482
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 448 place count 256 transition count 466
Applied a total of 448 rules in 32 ms. Remains 256 /480 variables (removed 224) and now considering 466/690 (removed 224) transitions.
[2023-03-16 23:33:24] [INFO ] Flow matrix only has 406 transitions (discarded 60 similar events)
// Phase 1: matrix 406 rows 256 cols
[2023-03-16 23:33:24] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-16 23:33:24] [INFO ] Implicit Places using invariants in 319 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 321 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/480 places, 466/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 251 /251 variables (removed 0) and now considering 466/466 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 363 ms. Remains : 251/480 places, 466/690 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s213 1) (GEQ s211 1) (GEQ s210 1) (GEQ s221 1) (GEQ s219 1) (GEQ s218 1) (GEQ s216 1) (GEQ s177 1) (GEQ s227 1) (GEQ s175 1) (GEQ s226 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 827 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA Peterson-COL-4-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-15 finished in 1272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(p1))))))'
Found a Lengthening insensitive property : Peterson-COL-4-LTLFireability-02
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 130 out of 480 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 480 transition count 602
Reduce places removed 88 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 168 rules applied. Total rules applied 256 place count 392 transition count 522
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 336 place count 312 transition count 522
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 336 place count 312 transition count 502
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 376 place count 292 transition count 502
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 408 place count 276 transition count 486
Applied a total of 408 rules in 22 ms. Remains 276 /480 variables (removed 204) and now considering 486/690 (removed 204) transitions.
[2023-03-16 23:33:25] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
// Phase 1: matrix 426 rows 276 cols
[2023-03-16 23:33:25] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-16 23:33:26] [INFO ] Implicit Places using invariants in 265 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 276 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 271/480 places, 486/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 271 /271 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 306 ms. Remains : 271/480 places, 486/690 transitions.
Running random walk in product with property : Peterson-COL-4-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (GEQ s233 1) (GEQ s231 1) (GEQ s230 1) (GEQ s241 1) (GEQ s239 1) (GEQ s238 1) (GEQ s236 1) (GEQ s197 1) (GEQ s247 1) (GEQ s195 1) (GEQ s246 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1586 ms.
Product exploration explored 100000 steps with 0 reset in 1269 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 85 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 248 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 130 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 486/486 transitions.
Applied a total of 0 rules in 3 ms. Remains 271 /271 variables (removed 0) and now considering 486/486 (removed 0) transitions.
[2023-03-16 23:33:30] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
// Phase 1: matrix 426 rows 271 cols
[2023-03-16 23:33:30] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-16 23:33:30] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-16 23:33:30] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-16 23:33:30] [INFO ] Invariant cache hit.
[2023-03-16 23:33:30] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:33:30] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
[2023-03-16 23:33:30] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-16 23:33:30] [INFO ] Invariant cache hit.
[2023-03-16 23:33:31] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1558 ms. Remains : 271/271 places, 486/486 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 147 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 94 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=94 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 322 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1529 ms.
Product exploration explored 100000 steps with 0 reset in 1167 ms.
Built C files in :
/tmp/ltsmin8063214893955689035
[2023-03-16 23:33:35] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8063214893955689035
Running compilation step : cd /tmp/ltsmin8063214893955689035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1233 ms.
Running link step : cd /tmp/ltsmin8063214893955689035;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8063214893955689035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8633579796926665301.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 130 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 486/486 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 486/486 (removed 0) transitions.
[2023-03-16 23:33:50] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-16 23:33:50] [INFO ] Invariant cache hit.
[2023-03-16 23:33:50] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-16 23:33:50] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-16 23:33:50] [INFO ] Invariant cache hit.
[2023-03-16 23:33:51] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:33:51] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2023-03-16 23:33:51] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-16 23:33:51] [INFO ] Invariant cache hit.
[2023-03-16 23:33:51] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1085 ms. Remains : 271/271 places, 486/486 transitions.
Built C files in :
/tmp/ltsmin7885842861210778258
[2023-03-16 23:33:51] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7885842861210778258
Running compilation step : cd /tmp/ltsmin7885842861210778258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1392 ms.
Running link step : cd /tmp/ltsmin7885842861210778258;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7885842861210778258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1975284396337513748.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 23:34:07] [INFO ] Flatten gal took : 12 ms
[2023-03-16 23:34:07] [INFO ] Flatten gal took : 12 ms
[2023-03-16 23:34:07] [INFO ] Time to serialize gal into /tmp/LTL15482492247936666400.gal : 3 ms
[2023-03-16 23:34:07] [INFO ] Time to serialize properties into /tmp/LTL9498728511210772235.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15482492247936666400.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5629629026105794322.hoa' '-atoms' '/tmp/LTL9498728511210772235.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9498728511210772235.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5629629026105794322.hoa
Detected timeout of ITS tools.
[2023-03-16 23:34:22] [INFO ] Flatten gal took : 20 ms
[2023-03-16 23:34:22] [INFO ] Flatten gal took : 21 ms
[2023-03-16 23:34:22] [INFO ] Time to serialize gal into /tmp/LTL3786611966498220899.gal : 4 ms
[2023-03-16 23:34:22] [INFO ] Time to serialize properties into /tmp/LTL10721624947345014294.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3786611966498220899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10721624947345014294.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("((((((((IsEndLoop_52>=1)||(IsEndLoop_50>=1))||((IsEndLoop_48>=1)||(IsEndLoop_62>=1)))||(((IsEndLoop_60>=1)||(IsEndLoop_58...5677
Formula 0 simplified : XXF(!"(((((((((AskForSection_2<1)||(Turn_13<1))&&((AskForSection_7<1)||(Turn_18<1)))&&(((AskForSection_11<1)||(Turn_17<1))&&((AskFor...5667
Detected timeout of ITS tools.
[2023-03-16 23:34:37] [INFO ] Flatten gal took : 16 ms
[2023-03-16 23:34:37] [INFO ] Applying decomposition
[2023-03-16 23:34:37] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10355392276667522298.txt' '-o' '/tmp/graph10355392276667522298.bin' '-w' '/tmp/graph10355392276667522298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10355392276667522298.bin' '-l' '-1' '-v' '-w' '/tmp/graph10355392276667522298.weights' '-q' '0' '-e' '0.001'
[2023-03-16 23:34:37] [INFO ] Decomposing Gal with order
[2023-03-16 23:34:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 23:34:37] [INFO ] Removed a total of 472 redundant transitions.
[2023-03-16 23:34:37] [INFO ] Flatten gal took : 38 ms
[2023-03-16 23:34:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 18 ms.
[2023-03-16 23:34:37] [INFO ] Time to serialize gal into /tmp/LTL5471384655881805760.gal : 17 ms
[2023-03-16 23:34:37] [INFO ] Time to serialize properties into /tmp/LTL2698117918067361181.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5471384655881805760.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2698117918067361181.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("((((((((i6.i0.u31.IsEndLoop_52>=1)||(i4.i0.u80.IsEndLoop_50>=1))||((i0.i1.u79.IsEndLoop_48>=1)||(i11.u33.IsEndLoop_62>=1)...8453
Formula 0 simplified : XXF(!"(((((((((i3.i0.u22.AskForSection_2<1)||(i3.i0.u15.Turn_13<1))&&((i1.i0.u10.AskForSection_7<1)||(i1.i0.u26.Turn_18<1)))&&(((i1....8443
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3452082233169055899
[2023-03-16 23:34:52] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3452082233169055899
Running compilation step : cd /tmp/ltsmin3452082233169055899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1300 ms.
Running link step : cd /tmp/ltsmin3452082233169055899;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3452082233169055899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X((LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Peterson-COL-4-LTLFireability-02 finished in 102144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(((p1||X(X(F(p2)))) U (p3&&(p1||X(X(F(p2)))))))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||(F(p0)&&X(X(X(F((!p1||G(p0))))))))))'
Found a Shortening insensitive property : Peterson-COL-4-LTLFireability-14
Stuttering acceptance computed with spot in 442 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 60 out of 480 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 480 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 288 transition count 498
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 384 place count 288 transition count 394
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 592 place count 184 transition count 394
Applied a total of 592 rules in 20 ms. Remains 184 /480 variables (removed 296) and now considering 394/690 (removed 296) transitions.
[2023-03-16 23:35:08] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
// Phase 1: matrix 334 rows 184 cols
[2023-03-16 23:35:08] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-16 23:35:08] [INFO ] Implicit Places using invariants in 235 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 252 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 179/480 places, 394/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 279 ms. Remains : 179/480 places, 394/690 transitions.
Running random walk in product with property : Peterson-COL-4-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (LT s138 1) (LT s163 1) (LT s110 1) (LT s134 1) (LT s173 1) (LT s118 1) (LT s142 1) (LT s114 1) (LT s168 1) (LT s126 1) (LT s98 1) (LT s150 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17640 reset in 468 ms.
Product exploration explored 100000 steps with 17516 reset in 427 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 222 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 23:35:10] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
// Phase 1: matrix 334 rows 179 cols
[2023-03-16 23:35:10] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-16 23:35:10] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-16 23:35:10] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 23:35:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-16 23:35:11] [INFO ] After 479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 23:35:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:35:11] [INFO ] After 355ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 23:35:12] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2023-03-16 23:35:12] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 1 ms to minimize.
[2023-03-16 23:35:12] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 0 ms to minimize.
[2023-03-16 23:35:12] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2023-03-16 23:35:12] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 1 ms to minimize.
[2023-03-16 23:35:12] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2023-03-16 23:35:12] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 1 ms to minimize.
[2023-03-16 23:35:12] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2023-03-16 23:35:13] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2023-03-16 23:35:13] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2023-03-16 23:35:13] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 0 ms to minimize.
[2023-03-16 23:35:13] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2023-03-16 23:35:13] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2023-03-16 23:35:13] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2023-03-16 23:35:13] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2023-03-16 23:35:13] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1936 ms
[2023-03-16 23:35:14] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2023-03-16 23:35:14] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 1 ms to minimize.
[2023-03-16 23:35:14] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2023-03-16 23:35:14] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2023-03-16 23:35:14] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 0 ms to minimize.
[2023-03-16 23:35:15] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 1 ms to minimize.
[2023-03-16 23:35:15] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2023-03-16 23:35:15] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2023-03-16 23:35:15] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2023-03-16 23:35:15] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2023-03-16 23:35:15] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2023-03-16 23:35:15] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2023-03-16 23:35:15] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2023-03-16 23:35:16] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2023-03-16 23:35:16] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2023-03-16 23:35:16] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-16 23:35:16] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
[2023-03-16 23:35:16] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2023-03-16 23:35:16] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2023-03-16 23:35:16] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2023-03-16 23:35:17] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2023-03-16 23:35:17] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2967 ms
[2023-03-16 23:35:17] [INFO ] After 5606ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 544 ms.
[2023-03-16 23:35:17] [INFO ] After 6738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 48 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 9 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 179/179 places, 394/394 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 708972 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :{0=1}
Probabilistic random walk after 708972 steps, saw 118843 distinct states, run finished after 3001 ms. (steps per millisecond=236 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-16 23:35:21] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-16 23:35:21] [INFO ] Invariant cache hit.
[2023-03-16 23:35:21] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-16 23:35:21] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:35:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-16 23:35:21] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:35:21] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:35:22] [INFO ] After 363ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:35:22] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2023-03-16 23:35:22] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 0 ms to minimize.
[2023-03-16 23:35:23] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2023-03-16 23:35:23] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2023-03-16 23:35:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 610 ms
[2023-03-16 23:35:23] [INFO ] After 1323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 502 ms.
[2023-03-16 23:35:23] [INFO ] After 2336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 7 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 179/179 places, 394/394 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 688962 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :{}
Probabilistic random walk after 688962 steps, saw 115501 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:35:27] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-16 23:35:27] [INFO ] Invariant cache hit.
[2023-03-16 23:35:27] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-16 23:35:27] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:35:27] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-16 23:35:27] [INFO ] After 424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:35:27] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:35:27] [INFO ] After 308ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:35:28] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
[2023-03-16 23:35:28] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-16 23:35:28] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2023-03-16 23:35:28] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2023-03-16 23:35:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 601 ms
[2023-03-16 23:35:28] [INFO ] After 1205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 322 ms.
[2023-03-16 23:35:29] [INFO ] After 2009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 6 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 179/179 places, 394/394 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 5 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2023-03-16 23:35:29] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-16 23:35:29] [INFO ] Invariant cache hit.
[2023-03-16 23:35:29] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-16 23:35:29] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-16 23:35:29] [INFO ] Invariant cache hit.
[2023-03-16 23:35:29] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:35:29] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
[2023-03-16 23:35:29] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 23:35:30] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-16 23:35:30] [INFO ] Invariant cache hit.
[2023-03-16 23:35:30] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1278 ms. Remains : 179/179 places, 394/394 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 179 transition count 334
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 169 transition count 329
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 164 transition count 324
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 1 with 60 rules applied. Total rules applied 145 place count 164 transition count 264
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 40 rules applied. Total rules applied 185 place count 164 transition count 224
Reduce places removed 40 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 60 rules applied. Total rules applied 245 place count 124 transition count 204
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 265 place count 104 transition count 204
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 269 place count 104 transition count 200
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 273 place count 100 transition count 200
Applied a total of 273 rules in 57 ms. Remains 100 /179 variables (removed 79) and now considering 200/394 (removed 194) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 200 rows 100 cols
[2023-03-16 23:35:30] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-16 23:35:30] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-16 23:35:30] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:35:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2023-03-16 23:35:31] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:35:31] [INFO ] After 887ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 337 ms.
[2023-03-16 23:35:31] [INFO ] After 1284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 323 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2023-03-16 23:35:32] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
// Phase 1: matrix 334 rows 179 cols
[2023-03-16 23:35:32] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-16 23:35:33] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-16 23:35:33] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-16 23:35:33] [INFO ] Invariant cache hit.
[2023-03-16 23:35:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:35:33] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2023-03-16 23:35:33] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-16 23:35:33] [INFO ] Invariant cache hit.
[2023-03-16 23:35:33] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1077 ms. Remains : 179/179 places, 394/394 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 23:35:34] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-16 23:35:34] [INFO ] Invariant cache hit.
[2023-03-16 23:35:34] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-16 23:35:34] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 23:35:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-16 23:35:35] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 23:35:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-16 23:35:35] [INFO ] After 345ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 23:35:35] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2023-03-16 23:35:35] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2023-03-16 23:35:35] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2023-03-16 23:35:36] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 1 ms to minimize.
[2023-03-16 23:35:36] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2023-03-16 23:35:36] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 0 ms to minimize.
[2023-03-16 23:35:36] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2023-03-16 23:35:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 807 ms
[2023-03-16 23:35:37] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2023-03-16 23:35:37] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2023-03-16 23:35:37] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2023-03-16 23:35:37] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2023-03-16 23:35:37] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 1 ms to minimize.
[2023-03-16 23:35:37] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2023-03-16 23:35:37] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2023-03-16 23:35:38] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 1 ms to minimize.
[2023-03-16 23:35:38] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2023-03-16 23:35:38] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2023-03-16 23:35:38] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2023-03-16 23:35:38] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2023-03-16 23:35:38] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2023-03-16 23:35:38] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1706 ms
[2023-03-16 23:35:38] [INFO ] After 3387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 457 ms.
[2023-03-16 23:35:39] [INFO ] After 4366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 179/179 places, 394/394 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Finished probabilistic random walk after 773782 steps, run visited all 2 properties in 2725 ms. (steps per millisecond=283 )
Probabilistic random walk after 773782 steps, saw 129645 distinct states, run finished after 2726 ms. (steps per millisecond=283 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 17590 reset in 403 ms.
Product exploration explored 100000 steps with 17612 reset in 419 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2023-03-16 23:35:44] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 23:35:44] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-16 23:35:44] [INFO ] Invariant cache hit.
[2023-03-16 23:35:44] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 265 ms. Remains : 179/179 places, 394/394 transitions.
Built C files in :
/tmp/ltsmin5889783224012478454
[2023-03-16 23:35:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5889783224012478454
Running compilation step : cd /tmp/ltsmin5889783224012478454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 903 ms.
Running link step : cd /tmp/ltsmin5889783224012478454;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5889783224012478454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6386365729777450298.hoa' '--buchi-type=spotba'
LTSmin run took 5690 ms.
Treatment of property Peterson-COL-4-LTLFireability-14 finished in 43246 ms.
FORMULA Peterson-COL-4-LTLFireability-14 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2023-03-16 23:35:51] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9013808434768471621
[2023-03-16 23:35:51] [INFO ] Computing symmetric may disable matrix : 690 transitions.
[2023-03-16 23:35:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 23:35:51] [INFO ] Computing symmetric may enable matrix : 690 transitions.
[2023-03-16 23:35:51] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 23:35:51] [INFO ] Applying decomposition
[2023-03-16 23:35:51] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3460244381236032343.txt' '-o' '/tmp/graph3460244381236032343.bin' '-w' '/tmp/graph3460244381236032343.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3460244381236032343.bin' '-l' '-1' '-v' '-w' '/tmp/graph3460244381236032343.weights' '-q' '0' '-e' '0.001'
[2023-03-16 23:35:51] [INFO ] Decomposing Gal with order
[2023-03-16 23:35:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 23:35:51] [INFO ] Removed a total of 500 redundant transitions.
[2023-03-16 23:35:51] [INFO ] Flatten gal took : 44 ms
[2023-03-16 23:35:51] [INFO ] Computing Do-Not-Accords matrix : 690 transitions.
[2023-03-16 23:35:51] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 23:35:51] [INFO ] Built C files in 273ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9013808434768471621
Running compilation step : cd /tmp/ltsmin9013808434768471621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 23:35:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 8 ms.
[2023-03-16 23:35:51] [INFO ] Time to serialize gal into /tmp/LTLFireability17209729190263890410.gal : 6 ms
[2023-03-16 23:35:51] [INFO ] Time to serialize properties into /tmp/LTLFireability8734869922672374652.ltl : 4 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17209729190263890410.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8734869922672374652.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(X(G(("(((((((((i12.u6.AskForSection_2<1)||(i12.u12.Turn_13<1))&&((i3.u10.AskForSection_7<1)||(i3.u51.Turn_18<1)))&&(((i3.u13.AskF...7924
Formula 0 simplified : XXF(!"(((((((((i12.u6.AskForSection_2<1)||(i12.u12.Turn_13<1))&&((i3.u10.AskForSection_7<1)||(i3.u51.Turn_18<1)))&&(((i3.u13.AskForS...7914
Compilation finished in 2877 ms.
Running link step : cd /tmp/ltsmin9013808434768471621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin9013808434768471621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](((LTLAPp0==true)||X((LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t59, t79, t225, t226, t227, t228, t229, t515, t516, t517, t518, t519, t520, t521, t522, t523,...1417
Detected timeout of ITS tools.
[2023-03-16 23:59:21] [INFO ] Applying decomposition
[2023-03-16 23:59:21] [INFO ] Flatten gal took : 34 ms
[2023-03-16 23:59:21] [INFO ] Decomposing Gal with order
[2023-03-16 23:59:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 23:59:21] [INFO ] Removed a total of 570 redundant transitions.
[2023-03-16 23:59:22] [INFO ] Flatten gal took : 146 ms
[2023-03-16 23:59:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2023-03-16 23:59:22] [INFO ] Time to serialize gal into /tmp/LTLFireability13078451768771394537.gal : 23 ms
[2023-03-16 23:59:22] [INFO ] Time to serialize properties into /tmp/LTLFireability17798372784065923083.ltl : 5 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13078451768771394537.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17798372784065923083.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((X(X(G(("(((((((((ProcessTour2.AskForSection_2<1)||(TourProcess13.Turn_13<1))&&((ProcessTour7.AskForSection_7<1)||(TourProcess18.Tur...10159
Formula 0 simplified : XXF(!"(((((((((ProcessTour2.AskForSection_2<1)||(TourProcess13.Turn_13<1))&&((ProcessTour7.AskForSection_7<1)||(TourProcess18.Turn_1...10149
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin9013808434768471621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](((LTLAPp0==true)||X((LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9013808434768471621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((X((((LTLAPp3==true)||X(X(<>((LTLAPp4==true))))) U ((LTLAPp5==true)&&((LTLAPp3==true)||X(X(<>((LTLAPp4==true))))))))||(LTLAPp2==true))))' '--buchi-type=spotba'
LTSmin run took 144369 ms.
FORMULA Peterson-COL-4-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin9013808434768471621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](((LTLAPp0==true)||X((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-17 00:22:53] [INFO ] Flatten gal took : 74 ms
[2023-03-17 00:22:53] [INFO ] Input system was already deterministic with 690 transitions.
[2023-03-17 00:22:53] [INFO ] Transformed 480 places.
[2023-03-17 00:22:53] [INFO ] Transformed 690 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-17 00:22:53] [INFO ] Time to serialize gal into /tmp/LTLFireability17929890980450047319.gal : 11 ms
[2023-03-17 00:22:53] [INFO ] Time to serialize properties into /tmp/LTLFireability11282731586723033627.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17929890980450047319.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11282731586723033627.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(G(("(((((((((AskForSection_2<1)||(Turn_13<1))&&((AskForSection_7<1)||(Turn_18<1)))&&(((AskForSection_11<1)||(Turn_17<1))&&((Ask...5677
Formula 0 simplified : XXF(!"(((((((((AskForSection_2<1)||(Turn_13<1))&&((AskForSection_7<1)||(Turn_18<1)))&&(((AskForSection_11<1)||(Turn_17<1))&&((AskFor...5667
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 12580116 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16028832 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-4"
export BK_EXAMINATION="LTLFireability"
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-5348"
echo " Executing tool itstools"
echo " Input is Peterson-COL-4, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-smll-167863536500572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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