Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017200779.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-COL-S10J30, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017200779
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 9.4K Apr 30 04:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 04:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 03:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 03:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 93K May 10 09:34 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 PolyORBNT-COL-S10J30-LTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S10J30-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652944505782

Running Version 202205111006
[2022-05-19 07:15:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 07:15:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 07:15:07] [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.
[2022-05-19 07:15:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 07:15:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 656 ms
[2022-05-19 07:15:07] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 42 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 07:15:07] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 8 ms.
[2022-05-19 07:15:07] [INFO ] Skeletonized 14 HLPN properties in 0 ms.
Initial state reduction rules removed 5 formulas.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 573 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 22) seen :16
Incomplete Best-First random walk after 10001 steps, including 206 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 206 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 248 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 244 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 07:15:08] [INFO ] Computed 13 place invariants in 11 ms
[2022-05-19 07:15:08] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-19 07:15:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 07:15:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 07:15:08] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2022-05-19 07:15:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:15:08] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2022-05-19 07:15:08] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-19 07:15:08] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
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 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 37 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 35 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 28
Applied a total of 27 rules in 18 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 34 cols
[2022-05-19 07:15:08] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-19 07:15:09] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10005 steps, including 738 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 410 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Probably explored full state space saw : 521 states, properties seen :0
Probabilistic random walk after 1393 steps, saw 521 distinct states, run finished after 28 ms. (steps per millisecond=49 ) properties seen :0
Explored full state space saw : 521 states, properties seen :0
Exhaustive walk after 1393 steps, saw 521 distinct states, run finished after 4 ms. (steps per millisecond=348 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 9 simplifications.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 07:15:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 07:15:09] [INFO ] Flatten gal took : 23 ms
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 07:15:09] [INFO ] Flatten gal took : 6 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-19 07:15:09] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 264 ms.
[2022-05-19 07:15:09] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Deduced a syphon composed of 30 places in 21 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 458 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 92 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
[2022-05-19 07:15:09] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2022-05-19 07:15:09] [INFO ] Computed 82 place invariants in 93 ms
[2022-05-19 07:15:10] [INFO ] Dead Transitions using invariants and state equation in 1082 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2022-05-19 07:15:10] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:15:10] [INFO ] Computed 82 place invariants in 40 ms
[2022-05-19 07:15:11] [INFO ] Implicit Places using invariants in 302 ms returned []
[2022-05-19 07:15:11] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:15:11] [INFO ] Computed 82 place invariants in 26 ms
[2022-05-19 07:15:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:15:13] [INFO ] Implicit Places using invariants and state equation in 2584 ms returned []
Implicit Place search using SMT with State Equation took 2889 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1940 transitions.
Applied a total of 0 rules in 20 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 653/664 places, 1324/1940 transitions.
Support contains 458 out of 653 places after structural reductions.
[2022-05-19 07:15:13] [INFO ] Flatten gal took : 146 ms
[2022-05-19 07:15:13] [INFO ] Flatten gal took : 123 ms
[2022-05-19 07:15:14] [INFO ] Input system was already deterministic with 1324 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 17) seen :8
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2022-05-19 07:15:15] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:15:15] [INFO ] Computed 82 place invariants in 25 ms
[2022-05-19 07:15:15] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-19 07:15:15] [INFO ] [Nat]Absence check using 76 positive place invariants in 33 ms returned sat
[2022-05-19 07:15:15] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 10 ms returned sat
[2022-05-19 07:15:26] [INFO ] After 10693ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2022-05-19 07:15:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:15:27] [INFO ] After 1025ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :6
[2022-05-19 07:15:28] [INFO ] Deduced a trap composed of 322 places in 331 ms of which 2 ms to minimize.
[2022-05-19 07:15:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 451 ms
[2022-05-19 07:15:31] [INFO ] After 4690ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 1124 ms.
[2022-05-19 07:15:32] [INFO ] After 16830ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 381 out of 653 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 653 transition count 1321
Reduce places removed 3 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 1 with 34 rules applied. Total rules applied 37 place count 650 transition count 1290
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 68 place count 619 transition count 1290
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 68 place count 619 transition count 1288
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 617 transition count 1288
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 615 transition count 1286
Applied a total of 76 rules in 111 ms. Remains 615 /653 variables (removed 38) and now considering 1286/1324 (removed 38) transitions.
[2022-05-19 07:15:32] [INFO ] Flow matrix only has 1277 transitions (discarded 9 similar events)
// Phase 1: matrix 1277 rows 615 cols
[2022-05-19 07:15:32] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 07:15:33] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 615/653 places, 1286/1324 transitions.
Incomplete random walk after 10000 steps, including 693 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 07:15:33] [INFO ] Flow matrix only has 1277 transitions (discarded 9 similar events)
// Phase 1: matrix 1277 rows 615 cols
[2022-05-19 07:15:33] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 07:15:33] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2022-05-19 07:15:33] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 16 ms returned sat
[2022-05-19 07:15:33] [INFO ] After 495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:15:33] [INFO ] [Nat]Absence check using 76 positive place invariants in 17 ms returned sat
[2022-05-19 07:15:34] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 16 ms returned sat
[2022-05-19 07:15:34] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:15:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:15:34] [INFO ] After 58ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 07:15:34] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-19 07:15:34] [INFO ] After 694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(X(X(p0))))||p1)))'
Support contains 34 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 26 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:15:34] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:15:34] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 07:15:35] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
[2022-05-19 07:15:35] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:15:35] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 07:15:35] [INFO ] Implicit Places using invariants in 502 ms returned []
[2022-05-19 07:15:35] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:15:35] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 07:15:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:15:38] [INFO ] Implicit Places using invariants and state equation in 2387 ms returned []
Implicit Place search using SMT with State Equation took 2897 ms to find 0 implicit places.
[2022-05-19 07:15:38] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:15:38] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 07:15:39] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 320 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=5, aps=[p1:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31) s650), p0:(OR (LEQ (ADD s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 928 ms.
Product exploration explored 100000 steps with 50000 reset in 872 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), (X p1), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-01 finished in 6523 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 43 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:15:41] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:15:41] [INFO ] Computed 82 place invariants in 24 ms
[2022-05-19 07:15:42] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
[2022-05-19 07:15:42] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:15:42] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 07:15:42] [INFO ] Implicit Places using invariants in 490 ms returned []
[2022-05-19 07:15:42] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:15:42] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 07:15:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:15:44] [INFO ] Implicit Places using invariants and state equation in 2390 ms returned []
Implicit Place search using SMT with State Equation took 2886 ms to find 0 implicit places.
[2022-05-19 07:15:44] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:15:44] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 07:15:45] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 1787 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s584)], 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 3 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-04 finished in 6149 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F(X((X(p0)&&(G(p1)||p2))))))))'
Support contains 34 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 31 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:15:47] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:15:47] [INFO ] Computed 82 place invariants in 29 ms
[2022-05-19 07:15:48] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
[2022-05-19 07:15:48] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:15:48] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 07:15:48] [INFO ] Implicit Places using invariants in 502 ms returned []
[2022-05-19 07:15:48] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:15:48] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:15:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:15:51] [INFO ] Implicit Places using invariants and state equation in 2467 ms returned []
Implicit Place search using SMT with State Equation took 2972 ms to find 0 implicit places.
[2022-05-19 07:15:51] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:15:51] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 07:15:51] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR p2 p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GT 1 s583) (GT s580 (ADD s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6110 reset in 882 ms.
Product exploration explored 100000 steps with 6086 reset in 838 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 p2) (NOT p1) p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (OR p2 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
Knowledge based reduction with 13 factoid took 728 ms. Reduced automaton from 5 states, 17 edges and 3 AP to 5 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 558 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-19 07:15:55] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:15:55] [INFO ] Computed 82 place invariants in 24 ms
[2022-05-19 07:15:55] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (OR p2 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (G (NOT (AND (NOT p0) p2 (NOT p1)))), (G (NOT (AND (NOT p0) p2 p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p2 (NOT p1))), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1)), (F (OR p2 p1)), (F (AND p2 p1))]
Knowledge based reduction with 15 factoid took 1556 ms. Reduced automaton from 5 states, 17 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 225 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
[2022-05-19 07:15:57] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:15:57] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 07:15:58] [INFO ] [Real]Absence check using 76 positive place invariants in 76 ms returned sat
[2022-05-19 07:15:58] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 39 ms returned sat
[2022-05-19 07:15:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:15:59] [INFO ] [Real]Absence check using state equation in 1338 ms returned sat
[2022-05-19 07:15:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 07:16:00] [INFO ] [Nat]Absence check using 76 positive place invariants in 61 ms returned sat
[2022-05-19 07:16:00] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 41 ms returned sat
[2022-05-19 07:16:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 07:16:02] [INFO ] [Nat]Absence check using state equation in 2135 ms returned sat
[2022-05-19 07:16:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:16:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 32 ms returned sat
[2022-05-19 07:16:02] [INFO ] Computed and/alt/rep : 831/2537/831 causal constraints (skipped 473 transitions) in 123 ms.
[2022-05-19 07:16:03] [INFO ] Added : 19 causal constraints over 4 iterations in 524 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 34 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 18 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:16:03] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:16:03] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 07:16:03] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
[2022-05-19 07:16:03] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:16:03] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:16:04] [INFO ] Implicit Places using invariants in 508 ms returned []
[2022-05-19 07:16:04] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:16:04] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 07:16:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:16:06] [INFO ] Implicit Places using invariants and state equation in 2574 ms returned []
Implicit Place search using SMT with State Equation took 3084 ms to find 0 implicit places.
[2022-05-19 07:16:06] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:16:06] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 07:16:07] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 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 p2) (NOT p1)), (X (NOT (OR (AND p0 p2) p1))), (X (NOT (AND (NOT p0) p1))), (X (OR p0 (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND p0 p2) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 13 factoid took 718 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 340 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 561 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 07:16:08] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:16:08] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 07:16:08] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (OR (AND p0 p2) p1))), (X (NOT (AND (NOT p0) p1))), (X (OR p0 (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND p0 p2) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p0) p1)), (F (OR (AND p0 p2) p1)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 p2))]
Knowledge based reduction with 14 factoid took 872 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 5 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
[2022-05-19 07:16:10] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:16:10] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 07:16:11] [INFO ] [Real]Absence check using 76 positive place invariants in 76 ms returned sat
[2022-05-19 07:16:11] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 39 ms returned sat
[2022-05-19 07:16:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:16:12] [INFO ] [Real]Absence check using state equation in 1353 ms returned sat
[2022-05-19 07:16:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 07:16:13] [INFO ] [Nat]Absence check using 76 positive place invariants in 67 ms returned sat
[2022-05-19 07:16:13] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 41 ms returned sat
[2022-05-19 07:16:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 07:16:15] [INFO ] [Nat]Absence check using state equation in 2102 ms returned sat
[2022-05-19 07:16:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:16:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 28 ms returned sat
[2022-05-19 07:16:15] [INFO ] Computed and/alt/rep : 831/2537/831 causal constraints (skipped 473 transitions) in 86 ms.
[2022-05-19 07:16:16] [INFO ] Added : 19 causal constraints over 4 iterations in 477 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 1003 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6095 reset in 713 ms.
Product exploration explored 100000 steps with 6096 reset in 747 ms.
Built C files in :
/tmp/ltsmin7755527350788787327
[2022-05-19 07:16:18] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7755527350788787327
Running compilation step : cd /tmp/ltsmin7755527350788787327;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2988 ms.
Running link step : cd /tmp/ltsmin7755527350788787327;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin7755527350788787327;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10768108746968974675.hoa' '--buchi-type=spotba'
LTSmin run took 650 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-08 finished in 35051 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 312 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 10 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:16:22] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:16:22] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 07:16:23] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
[2022-05-19 07:16:23] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:16:23] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 07:16:23] [INFO ] Implicit Places using invariants in 389 ms returned []
[2022-05-19 07:16:23] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:16:23] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 07:16:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:16:26] [INFO ] Implicit Places using invariants and state equation in 3021 ms returned []
Implicit Place search using SMT with State Equation took 3412 ms to find 0 implicit places.
[2022-05-19 07:16:26] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:16:26] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 07:16:27] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s581 (ADD s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10654 reset in 894 ms.
Product exploration explored 100000 steps with 10659 reset in 907 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) p0), (X (NOT p1)), (X p0), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
[2022-05-19 07:16:29] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:16:29] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 07:16:31] [INFO ] [Real]Absence check using 76 positive place invariants in 68 ms returned sat
[2022-05-19 07:16:31] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 13 ms returned sat
[2022-05-19 07:16:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:16:32] [INFO ] [Real]Absence check using state equation in 1170 ms returned sat
[2022-05-19 07:16:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 07:16:33] [INFO ] [Nat]Absence check using 76 positive place invariants in 118 ms returned sat
[2022-05-19 07:16:33] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 12 ms returned sat
[2022-05-19 07:16:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 07:16:35] [INFO ] [Nat]Absence check using state equation in 1234 ms returned sat
[2022-05-19 07:16:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:16:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 22 ms returned sat
[2022-05-19 07:16:35] [INFO ] Computed and/alt/rep : 831/2537/831 causal constraints (skipped 473 transitions) in 97 ms.
[2022-05-19 07:16:35] [INFO ] Added : 15 causal constraints over 3 iterations in 387 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 311 out of 653 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 653 transition count 1290
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 619 transition count 1290
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 68 place count 619 transition count 1255
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 138 place count 584 transition count 1255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 582 transition count 1253
Applied a total of 142 rules in 75 ms. Remains 582 /653 variables (removed 71) and now considering 1253/1324 (removed 71) transitions.
[2022-05-19 07:16:35] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:16:35] [INFO ] Computed 82 place invariants in 43 ms
[2022-05-19 07:16:36] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
[2022-05-19 07:16:36] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:16:36] [INFO ] Computed 82 place invariants in 33 ms
[2022-05-19 07:16:36] [INFO ] Implicit Places using invariants in 376 ms returned []
[2022-05-19 07:16:36] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:16:36] [INFO ] Computed 82 place invariants in 28 ms
[2022-05-19 07:16:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:16:39] [INFO ] Implicit Places using invariants and state equation in 2523 ms returned []
Implicit Place search using SMT with State Equation took 2902 ms to find 0 implicit places.
[2022-05-19 07:16:39] [INFO ] Redundant transitions in 84 ms returned []
[2022-05-19 07:16:39] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:16:39] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:16:39] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/653 places, 1253/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 582/653 places, 1253/1324 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 (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
[2022-05-19 07:16:40] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:16:40] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 07:16:41] [INFO ] [Real]Absence check using 75 positive place invariants in 56 ms returned sat
[2022-05-19 07:16:41] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2022-05-19 07:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:16:42] [INFO ] [Real]Absence check using state equation in 1195 ms returned sat
[2022-05-19 07:16:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 07:16:44] [INFO ] [Nat]Absence check using 75 positive place invariants in 122 ms returned sat
[2022-05-19 07:16:44] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-19 07:16:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 07:16:45] [INFO ] [Nat]Absence check using state equation in 999 ms returned sat
[2022-05-19 07:16:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:16:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 18 ms returned sat
[2022-05-19 07:16:45] [INFO ] Computed and/alt/rep : 762/3026/762 causal constraints (skipped 471 transitions) in 98 ms.
[2022-05-19 07:16:45] [INFO ] Added : 8 causal constraints over 2 iterations in 323 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Product exploration explored 100000 steps with 9537 reset in 1509 ms.
Product exploration explored 100000 steps with 9435 reset in 1526 ms.
Built C files in :
/tmp/ltsmin6468661239269487691
[2022-05-19 07:16:48] [INFO ] Computing symmetric may disable matrix : 1253 transitions.
[2022-05-19 07:16:48] [INFO ] Computation of Complete disable matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:16:48] [INFO ] Computing symmetric may enable matrix : 1253 transitions.
[2022-05-19 07:16:48] [INFO ] Computation of Complete enable matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:16:49] [INFO ] Computing Do-Not-Accords matrix : 1253 transitions.
[2022-05-19 07:16:49] [INFO ] Computation of Completed DNA matrix. took 75 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:16:49] [INFO ] Built C files in 370ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6468661239269487691
Running compilation step : cd /tmp/ltsmin6468661239269487691;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6468661239269487691;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6468661239269487691;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 311 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 582 transition count 1252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 581 transition count 1252
Applied a total of 2 rules in 41 ms. Remains 581 /582 variables (removed 1) and now considering 1252/1253 (removed 1) transitions.
[2022-05-19 07:16:52] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:16:52] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 07:16:52] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
[2022-05-19 07:16:52] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:16:52] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 07:16:53] [INFO ] Implicit Places using invariants in 338 ms returned []
[2022-05-19 07:16:53] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:16:53] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 07:16:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:16:55] [INFO ] Implicit Places using invariants and state equation in 2135 ms returned []
Implicit Place search using SMT with State Equation took 2475 ms to find 0 implicit places.
[2022-05-19 07:16:55] [INFO ] Redundant transitions in 23 ms returned []
[2022-05-19 07:16:55] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:16:55] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:16:55] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/582 places, 1252/1253 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/582 places, 1252/1253 transitions.
Built C files in :
/tmp/ltsmin8955677355596357444
[2022-05-19 07:16:55] [INFO ] Computing symmetric may disable matrix : 1252 transitions.
[2022-05-19 07:16:55] [INFO ] Computation of Complete disable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:16:55] [INFO ] Computing symmetric may enable matrix : 1252 transitions.
[2022-05-19 07:16:55] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:16:56] [INFO ] Computing Do-Not-Accords matrix : 1252 transitions.
[2022-05-19 07:16:56] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:16:56] [INFO ] Built C files in 253ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8955677355596357444
Running compilation step : cd /tmp/ltsmin8955677355596357444;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8955677355596357444;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8955677355596357444;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:16:59] [INFO ] Flatten gal took : 82 ms
[2022-05-19 07:16:59] [INFO ] Flatten gal took : 84 ms
[2022-05-19 07:16:59] [INFO ] Time to serialize gal into /tmp/LTL73229036906168016.gal : 20 ms
[2022-05-19 07:16:59] [INFO ] Time to serialize properties into /tmp/LTL2337312114780818801.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL73229036906168016.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2337312114780818801.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7322903...264
Read 1 LTL properties
Checking formula 0 : !(((X("(place_520_0<1)"))&&(F("(CanInjectEvent_0<=(((((((((CreatedJobs_0+CreatedJobs_1)+(CreatedJobs_2+CreatedJobs_3))+((CreatedJobs_4...5544
Formula 0 simplified : !(X"(place_520_0<1)" & F"(CanInjectEvent_0<=(((((((((CreatedJobs_0+CreatedJobs_1)+(CreatedJobs_2+CreatedJobs_3))+((CreatedJobs_4+Cre...5537
Detected timeout of ITS tools.
[2022-05-19 07:17:14] [INFO ] Flatten gal took : 78 ms
[2022-05-19 07:17:14] [INFO ] Applying decomposition
[2022-05-19 07:17:14] [INFO ] Flatten gal took : 76 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6242758745609960400.txt' '-o' '/tmp/graph6242758745609960400.bin' '-w' '/tmp/graph6242758745609960400.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6242758745609960400.bin' '-l' '-1' '-v' '-w' '/tmp/graph6242758745609960400.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:17:15] [INFO ] Decomposing Gal with order
[2022-05-19 07:17:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:17:15] [INFO ] Removed a total of 1582 redundant transitions.
[2022-05-19 07:17:15] [INFO ] Flatten gal took : 782 ms
[2022-05-19 07:17:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 242 labels/synchronizations in 46 ms.
[2022-05-19 07:17:16] [INFO ] Time to serialize gal into /tmp/LTL16252901501241090893.gal : 12 ms
[2022-05-19 07:17:16] [INFO ] Time to serialize properties into /tmp/LTL1957446431853515570.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16252901501241090893.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1957446431853515570.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1625290...267
Read 1 LTL properties
Checking formula 0 : !(((X("(gi0.gi1.gu17.place_520_0<1)"))&&(F("(gu18.CanInjectEvent_0<=(((((((((gu18.CreatedJobs_0+gu18.CreatedJobs_1)+(gu18.CreatedJobs_...7112
Formula 0 simplified : !(X"(gi0.gi1.gu17.place_520_0<1)" & F"(gu18.CanInjectEvent_0<=(((((((((gu18.CreatedJobs_0+gu18.CreatedJobs_1)+(gu18.CreatedJobs_2+gu...7105
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16107892500212540590
[2022-05-19 07:17:31] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16107892500212540590
Running compilation step : cd /tmp/ltsmin16107892500212540590;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2474 ms.
Running link step : cd /tmp/ltsmin16107892500212540590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16107892500212540590;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true))&&<>((LTLAPp1==true)))' '--buchi-type=spotba'
LTSmin run took 11189 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-09 finished in 82443 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(F(!(false U !(!X(p0)&&p1))))))))'
Support contains 4 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 16 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:17:44] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:17:44] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 07:17:45] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
[2022-05-19 07:17:45] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:17:45] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 07:17:46] [INFO ] Implicit Places using invariants in 492 ms returned []
[2022-05-19 07:17:46] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:17:46] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 07:17:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:17:49] [INFO ] Implicit Places using invariants and state equation in 3485 ms returned []
Implicit Place search using SMT with State Equation took 3994 ms to find 0 implicit places.
[2022-05-19 07:17:49] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:17:49] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 07:17:50] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 391 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s161 s199), p0:(GT s198 s214)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33401 reset in 706 ms.
Product exploration explored 100000 steps with 33433 reset in 716 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 493 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Finished probabilistic random walk after 1268 steps, run visited all 3 properties in 31 ms. (steps per millisecond=40 )
Probabilistic random walk after 1268 steps, saw 674 distinct states, run finished after 32 ms. (steps per millisecond=39 ) properties seen :3
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 303 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0]
Support contains 4 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 14 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:17:53] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:17:53] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 07:17:54] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
[2022-05-19 07:17:54] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:17:54] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 07:17:54] [INFO ] Implicit Places using invariants in 507 ms returned []
[2022-05-19 07:17:55] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:17:55] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:17:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:17:57] [INFO ] Implicit Places using invariants and state equation in 2686 ms returned []
Implicit Place search using SMT with State Equation took 3196 ms to find 0 implicit places.
[2022-05-19 07:17:57] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:17:57] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 07:17:58] [INFO ] Dead Transitions using invariants and state equation in 731 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 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 (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 243 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 559 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Finished probabilistic random walk after 1268 steps, run visited all 3 properties in 19 ms. (steps per millisecond=66 )
Probabilistic random walk after 1268 steps, saw 674 distinct states, run finished after 19 ms. (steps per millisecond=66 ) properties seen :3
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 327 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0]
Product exploration explored 100000 steps with 33278 reset in 719 ms.
Product exploration explored 100000 steps with 33392 reset in 713 ms.
Built C files in :
/tmp/ltsmin8979863829521539152
[2022-05-19 07:18:01] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8979863829521539152
Running compilation step : cd /tmp/ltsmin8979863829521539152;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2571 ms.
Running link step : cd /tmp/ltsmin8979863829521539152;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8979863829521539152;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2123679024872139930.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 10 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:18:16] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:18:16] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 07:18:17] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
[2022-05-19 07:18:17] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:18:17] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 07:18:17] [INFO ] Implicit Places using invariants in 488 ms returned []
[2022-05-19 07:18:17] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:18:17] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 07:18:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:18:20] [INFO ] Implicit Places using invariants and state equation in 2945 ms returned []
Implicit Place search using SMT with State Equation took 3437 ms to find 0 implicit places.
[2022-05-19 07:18:20] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:18:20] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:18:21] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 transitions.
Built C files in :
/tmp/ltsmin933377516416851979
[2022-05-19 07:18:21] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin933377516416851979
Running compilation step : cd /tmp/ltsmin933377516416851979;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2716 ms.
Running link step : cd /tmp/ltsmin933377516416851979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin933377516416851979;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10206355861662823026.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 07:18:36] [INFO ] Flatten gal took : 81 ms
[2022-05-19 07:18:36] [INFO ] Flatten gal took : 70 ms
[2022-05-19 07:18:36] [INFO ] Time to serialize gal into /tmp/LTL1393992024621475567.gal : 7 ms
[2022-05-19 07:18:36] [INFO ] Time to serialize properties into /tmp/LTL6318638623201910488.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1393992024621475567.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6318638623201910488.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1393992...266
Read 1 LTL properties
Checking formula 0 : !((F(X(X(G(F((!(X("(place_523_0>cSources_0)")))&&("(mi3_0<=place_522_0)"))))))))
Formula 0 simplified : !FXXGF("(mi3_0<=place_522_0)" & !X"(place_523_0>cSources_0)")
Detected timeout of ITS tools.
[2022-05-19 07:18:51] [INFO ] Flatten gal took : 79 ms
[2022-05-19 07:18:51] [INFO ] Applying decomposition
[2022-05-19 07:18:51] [INFO ] Flatten gal took : 67 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14649746331567151173.txt' '-o' '/tmp/graph14649746331567151173.bin' '-w' '/tmp/graph14649746331567151173.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14649746331567151173.bin' '-l' '-1' '-v' '-w' '/tmp/graph14649746331567151173.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:18:52] [INFO ] Decomposing Gal with order
[2022-05-19 07:18:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:18:52] [INFO ] Removed a total of 3126 redundant transitions.
[2022-05-19 07:18:52] [INFO ] Flatten gal took : 150 ms
[2022-05-19 07:18:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 403 labels/synchronizations in 50 ms.
[2022-05-19 07:18:52] [INFO ] Time to serialize gal into /tmp/LTL7006186744039277334.gal : 9 ms
[2022-05-19 07:18:52] [INFO ] Time to serialize properties into /tmp/LTL16120227613988525024.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7006186744039277334.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16120227613988525024.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7006186...267
Read 1 LTL properties
Checking formula 0 : !((F(X(X(G(F((!(X("(gu26.place_523_0>gu26.cSources_0)")))&&("(gu16.mi3_0<=gu16.place_522_0)"))))))))
Formula 0 simplified : !FXXGF("(gu16.mi3_0<=gu16.place_522_0)" & !X"(gu26.place_523_0>gu26.cSources_0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12208636980196027924
[2022-05-19 07:19:07] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12208636980196027924
Running compilation step : cd /tmp/ltsmin12208636980196027924;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2809 ms.
Running link step : cd /tmp/ltsmin12208636980196027924;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12208636980196027924;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X([](<>(!(false U !(!X((LTLAPp0==true))&&(LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-10 finished in 97655 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)||X(F(p2)))))'
Support contains 43 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 653 transition count 1289
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 618 transition count 1289
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 618 transition count 1255
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 584 transition count 1255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 582 transition count 1253
Applied a total of 142 rules in 68 ms. Remains 582 /653 variables (removed 71) and now considering 1253/1324 (removed 71) transitions.
[2022-05-19 07:19:22] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:19:22] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:19:23] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
[2022-05-19 07:19:23] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:19:23] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 07:19:23] [INFO ] Implicit Places using invariants in 400 ms returned []
[2022-05-19 07:19:23] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:19:23] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 07:19:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:19:25] [INFO ] Implicit Places using invariants and state equation in 2155 ms returned []
Implicit Place search using SMT with State Equation took 2558 ms to find 0 implicit places.
[2022-05-19 07:19:25] [INFO ] Redundant transitions in 16 ms returned []
[2022-05-19 07:19:25] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:19:25] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:19:26] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/653 places, 1253/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 582/653 places, 1253/1324 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 2 (ADD s198 s199 s200 s201 s202 s203 s204 s205 s206 s207)), p0:(LEQ (ADD s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s...], 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]]
Product exploration explored 100000 steps with 20349 reset in 1053 ms.
Product exploration explored 100000 steps with 20415 reset in 1013 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) p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
Knowledge based reduction with 3 factoid took 310 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 730 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 07:19:29] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:19:29] [INFO ] Computed 82 place invariants in 23 ms
[2022-05-19 07:19:29] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:19:29] [INFO ] [Nat]Absence check using 75 positive place invariants in 18 ms returned sat
[2022-05-19 07:19:29] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 18 ms returned sat
[2022-05-19 07:19:29] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 357 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 43 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 32 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2022-05-19 07:19:29] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:19:29] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 07:19:30] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
[2022-05-19 07:19:30] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:19:30] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 07:19:30] [INFO ] Implicit Places using invariants in 400 ms returned []
[2022-05-19 07:19:30] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:19:30] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:19:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:19:33] [INFO ] Implicit Places using invariants and state equation in 2453 ms returned []
Implicit Place search using SMT with State Equation took 2856 ms to find 0 implicit places.
[2022-05-19 07:19:33] [INFO ] Redundant transitions in 16 ms returned []
[2022-05-19 07:19:33] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:19:33] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:19:33] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 582/582 places, 1253/1253 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) p2)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Finished random walk after 371 steps, including 27 resets, run visited all 4 properties in 6 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p0 (NOT p1) p2)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 254 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 20158 reset in 1005 ms.
Product exploration explored 100000 steps with 20400 reset in 1037 ms.
Built C files in :
/tmp/ltsmin15865641579903678549
[2022-05-19 07:19:37] [INFO ] Computing symmetric may disable matrix : 1253 transitions.
[2022-05-19 07:19:37] [INFO ] Computation of Complete disable matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:19:37] [INFO ] Computing symmetric may enable matrix : 1253 transitions.
[2022-05-19 07:19:37] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:19:37] [INFO ] Computing Do-Not-Accords matrix : 1253 transitions.
[2022-05-19 07:19:37] [INFO ] Computation of Completed DNA matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:19:37] [INFO ] Built C files in 259ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15865641579903678549
Running compilation step : cd /tmp/ltsmin15865641579903678549;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15865641579903678549;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15865641579903678549;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 43 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 28 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2022-05-19 07:19:41] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:19:41] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 07:19:41] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
[2022-05-19 07:19:41] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:19:41] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 07:19:41] [INFO ] Implicit Places using invariants in 394 ms returned []
[2022-05-19 07:19:41] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:19:42] [INFO ] Computed 82 place invariants in 23 ms
[2022-05-19 07:19:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:19:44] [INFO ] Implicit Places using invariants and state equation in 2317 ms returned []
Implicit Place search using SMT with State Equation took 2716 ms to find 0 implicit places.
[2022-05-19 07:19:44] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-19 07:19:44] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:19:44] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 07:19:44] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 582/582 places, 1253/1253 transitions.
Built C files in :
/tmp/ltsmin14238253193294265532
[2022-05-19 07:19:44] [INFO ] Computing symmetric may disable matrix : 1253 transitions.
[2022-05-19 07:19:44] [INFO ] Computation of Complete disable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:19:44] [INFO ] Computing symmetric may enable matrix : 1253 transitions.
[2022-05-19 07:19:44] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:19:45] [INFO ] Computing Do-Not-Accords matrix : 1253 transitions.
[2022-05-19 07:19:45] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:19:45] [INFO ] Built C files in 242ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14238253193294265532
Running compilation step : cd /tmp/ltsmin14238253193294265532;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14238253193294265532;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14238253193294265532;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:19:48] [INFO ] Flatten gal took : 66 ms
[2022-05-19 07:19:48] [INFO ] Flatten gal took : 63 ms
[2022-05-19 07:19:48] [INFO ] Time to serialize gal into /tmp/LTL3299192359159232666.gal : 11 ms
[2022-05-19 07:19:48] [INFO ] Time to serialize properties into /tmp/LTL7779311981398968652.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3299192359159232666.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7779311981398968652.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3299192...266
Read 1 LTL properties
Checking formula 0 : !((G((("((((((QueueJobB_0+QueueJobB_1)+(QueueJobB_2+QueueJobB_3))+((QueueJobB_4+QueueJobB_5)+(QueueJobB_6+QueueJobB_7)))+(((QueueJobB_...719
Formula 0 simplified : !G(("((((((QueueJobB_0+QueueJobB_1)+(QueueJobB_2+QueueJobB_3))+((QueueJobB_4+QueueJobB_5)+(QueueJobB_6+QueueJobB_7)))+(((QueueJobB_8...710
Detected timeout of ITS tools.
[2022-05-19 07:20:03] [INFO ] Flatten gal took : 60 ms
[2022-05-19 07:20:03] [INFO ] Applying decomposition
[2022-05-19 07:20:03] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10161233883761537055.txt' '-o' '/tmp/graph10161233883761537055.bin' '-w' '/tmp/graph10161233883761537055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10161233883761537055.bin' '-l' '-1' '-v' '-w' '/tmp/graph10161233883761537055.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:20:03] [INFO ] Decomposing Gal with order
[2022-05-19 07:20:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:20:03] [INFO ] Removed a total of 461 redundant transitions.
[2022-05-19 07:20:04] [INFO ] Flatten gal took : 264 ms
[2022-05-19 07:20:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 690 labels/synchronizations in 25 ms.
[2022-05-19 07:20:04] [INFO ] Time to serialize gal into /tmp/LTL9137328336111258511.gal : 36 ms
[2022-05-19 07:20:04] [INFO ] Time to serialize properties into /tmp/LTL6414148468050620390.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9137328336111258511.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6414148468050620390.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9137328...266
Read 1 LTL properties
Checking formula 0 : !((G((("((((((gu1.QueueJobB_0+gu1.QueueJobB_1)+(gu1.QueueJobB_2+gu1.QueueJobB_3))+((gu1.QueueJobB_4+gu1.QueueJobB_5)+(gu1.QueueJobB_6+...985
Formula 0 simplified : !G(("((((((gu1.QueueJobB_0+gu1.QueueJobB_1)+(gu1.QueueJobB_2+gu1.QueueJobB_3))+((gu1.QueueJobB_4+gu1.QueueJobB_5)+(gu1.QueueJobB_6+g...976
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18113215462649229561
[2022-05-19 07:20:19] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18113215462649229561
Running compilation step : cd /tmp/ltsmin18113215462649229561;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2659 ms.
Running link step : cd /tmp/ltsmin18113215462649229561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18113215462649229561;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((((LTLAPp0==true) U (LTLAPp1==true))||X(<>((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-12 finished in 71877 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)&&p0))))'
Support contains 32 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 14 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:20:34] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:20:34] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 07:20:35] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
[2022-05-19 07:20:35] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:20:35] [INFO ] Computed 82 place invariants in 23 ms
[2022-05-19 07:20:35] [INFO ] Implicit Places using invariants in 497 ms returned []
[2022-05-19 07:20:35] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:20:35] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 07:20:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:20:38] [INFO ] Implicit Places using invariants and state equation in 2442 ms returned []
Implicit Place search using SMT with State Equation took 2947 ms to find 0 implicit places.
[2022-05-19 07:20:38] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:20:38] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 07:20:38] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 (ADD s617 s618 s619 s620 s621 s622 s623 s624 s625 s626 s627 s628 s629 s630 s631 s632 s633 s634 s635 s636 s637 s638 s639 s640 s641 s642 s643 s644 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-15 finished in 4475 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(F(!(false U !(!X(p0)&&p1))))))))'
Found a CL insensitive property : PolyORBNT-COL-S10J30-LTLCardinality-10
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0]
Support contains 4 out of 653 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 653 transition count 1290
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 619 transition count 1290
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 68 place count 619 transition count 1255
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 138 place count 584 transition count 1255
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 581 transition count 1252
Applied a total of 144 rules in 63 ms. Remains 581 /653 variables (removed 72) and now considering 1252/1324 (removed 72) transitions.
[2022-05-19 07:20:39] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:20:39] [INFO ] Computed 82 place invariants in 34 ms
[2022-05-19 07:20:39] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
[2022-05-19 07:20:39] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:20:39] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 07:20:40] [INFO ] Implicit Places using invariants in 424 ms returned []
[2022-05-19 07:20:40] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:20:40] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 07:20:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:20:43] [INFO ] Implicit Places using invariants and state equation in 3106 ms returned []
Implicit Place search using SMT with State Equation took 3532 ms to find 0 implicit places.
[2022-05-19 07:20:43] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:20:43] [INFO ] Computed 82 place invariants in 23 ms
[2022-05-19 07:20:43] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 581/653 places, 1252/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/653 places, 1252/1324 transitions.
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s161 s196), p0:(GT s195 s209)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33360 reset in 738 ms.
Stuttering criterion allowed to conclude after 81160 steps with 27020 reset in 623 ms.
Treatment of property PolyORBNT-COL-S10J30-LTLCardinality-10 finished in 6272 ms.
CL/SL decision was in the wrong direction : CL + false
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)||X(F(p2)))))'
[2022-05-19 07:20:45] [INFO ] Flatten gal took : 64 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7273680204868844870
[2022-05-19 07:20:45] [INFO ] Computing symmetric may disable matrix : 1324 transitions.
[2022-05-19 07:20:45] [INFO ] Applying decomposition
[2022-05-19 07:20:45] [INFO ] Computation of Complete disable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:20:45] [INFO ] Computing symmetric may enable matrix : 1324 transitions.
[2022-05-19 07:20:45] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:20:45] [INFO ] Flatten gal took : 74 ms
[2022-05-19 07:20:45] [INFO ] Computing Do-Not-Accords matrix : 1324 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7837829178544830583.txt' '-o' '/tmp/graph7837829178544830583.bin' '-w' '/tmp/graph7837829178544830583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7837829178544830583.bin' '-l' '-1' '-v' '-w' '/tmp/graph7837829178544830583.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:20:45] [INFO ] Decomposing Gal with order
[2022-05-19 07:20:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:20:45] [INFO ] Computation of Completed DNA matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:20:45] [INFO ] Built C files in 342ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7273680204868844870
Running compilation step : cd /tmp/ltsmin7273680204868844870;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 07:20:45] [INFO ] Removed a total of 1515 redundant transitions.
[2022-05-19 07:20:45] [INFO ] Flatten gal took : 227 ms
[2022-05-19 07:20:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 1309 labels/synchronizations in 37 ms.
[2022-05-19 07:20:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality15287485225073774616.gal : 8 ms
[2022-05-19 07:20:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality15747457594691285621.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15287485225073774616.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15747457594691285621.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 2 LTL properties
Checking formula 0 : !((F(X(X(G(F((!(X("(gi2.gu27.place_523_0>gi2.gu27.cSources_0)")))&&("(gi0.gi0.gu24.mi3_0<=gi0.gi0.gu24.place_522_0)"))))))))
Formula 0 simplified : !FXXGF("(gi0.gi0.gu24.mi3_0<=gi0.gi0.gu24.place_522_0)" & !X"(gi2.gu27.place_523_0>gi2.gu27.cSources_0)")
Compilation finished in 6020 ms.
Running link step : cd /tmp/ltsmin7273680204868844870;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin7273680204868844870;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X([](<>(!(false U !(!X((LTLAPp0==true))&&(LTLAPp1==true))))))))' '--buchi-type=spotba'
LTSmin run took 576852 ms.
FORMULA PolyORBNT-COL-S10J30-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin7273680204868844870;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((((LTLAPp2==true) U (LTLAPp3==true))||X(<>((LTLAPp4==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 07:42:39] [INFO ] Applying decomposition
[2022-05-19 07:42:39] [INFO ] Flatten gal took : 156 ms
[2022-05-19 07:42:39] [INFO ] Decomposing Gal with order
[2022-05-19 07:42:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:42:40] [INFO ] Removed a total of 6716 redundant transitions.
[2022-05-19 07:42:40] [INFO ] Flatten gal took : 391 ms
[2022-05-19 07:42:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 56 ms.
[2022-05-19 07:42:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality10711851034400127715.gal : 36 ms
[2022-05-19 07:42:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality13765202617368379887.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10711851034400127715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13765202617368379887.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 1 LTL properties
Checking formula 0 : !((G((("((((((gThreadsJobs0.QueueJobB_0+gThreadsJobs1.QueueJobB_1)+(gThreadsJobs2.QueueJobB_2+gThreadsJobs3.QueueJobB_3))+((gThreadsJo...1319
Formula 0 simplified : !G(("((((((gThreadsJobs0.QueueJobB_0+gThreadsJobs1.QueueJobB_1)+(gThreadsJobs2.QueueJobB_2+gThreadsJobs3.QueueJobB_3))+((gThreadsJob...1310
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.134: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.134: LTL layer: formula: []((((LTLAPp2==true) U (LTLAPp3==true))||X(<>((LTLAPp4==true)))))
pins2lts-mc-linux64( 7/ 8), 0.134: "[]((((LTLAPp2==true) U (LTLAPp3==true))||X(<>((LTLAPp4==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.134: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.138: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.139: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.146: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.143: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.151: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.154: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.148: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.180: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.302: DFS-FIFO for weak LTL, using special progress label 1330
pins2lts-mc-linux64( 0/ 8), 0.302: There are 1331 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.302: State length is 654, there are 1330 groups
pins2lts-mc-linux64( 0/ 8), 0.302: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.302: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.302: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.302: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.392: ~4 levels ~960 states ~4168 transitions
pins2lts-mc-linux64( 5/ 8), 0.450: ~4 levels ~1920 states ~11488 transitions
pins2lts-mc-linux64( 5/ 8), 0.565: ~4 levels ~3840 states ~22808 transitions
pins2lts-mc-linux64( 2/ 8), 0.842: ~4 levels ~7680 states ~47584 transitions
pins2lts-mc-linux64( 5/ 8), 1.260: ~4 levels ~15360 states ~59808 transitions
pins2lts-mc-linux64( 0/ 8), 2.075: ~4 levels ~30720 states ~94104 transitions
pins2lts-mc-linux64( 5/ 8), 3.620: ~4 levels ~61440 states ~146768 transitions
pins2lts-mc-linux64( 5/ 8), 6.590: ~4 levels ~122880 states ~349680 transitions
pins2lts-mc-linux64( 6/ 8), 12.157: ~2 levels ~245760 states ~758264 transitions
pins2lts-mc-linux64( 5/ 8), 22.505: ~4 levels ~491520 states ~1473832 transitions
pins2lts-mc-linux64( 5/ 8), 41.156: ~4 levels ~983040 states ~2252440 transitions
pins2lts-mc-linux64( 5/ 8), 84.419: ~4 levels ~1966080 states ~4288456 transitions
pins2lts-mc-linux64( 5/ 8), 194.447: ~4 levels ~3932160 states ~11890440 transitions
pins2lts-mc-linux64( 5/ 8), 400.658: ~4 levels ~7864320 states ~29588424 transitions
pins2lts-mc-linux64( 5/ 8), 757.212: ~4 levels ~15728640 states ~64704840 transitions
pins2lts-mc-linux64( 7/ 8), 797.777: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 798.889:
pins2lts-mc-linux64( 0/ 8), 798.889: mean standard work distribution: 9.9% (states) 9.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 798.889:
pins2lts-mc-linux64( 0/ 8), 798.889: Explored 15319510 states 67928433 transitions, fanout: 4.434
pins2lts-mc-linux64( 0/ 8), 798.889: Total exploration time 798.570 sec (797.560 sec minimum, 798.057 sec on average)
pins2lts-mc-linux64( 0/ 8), 798.889: States per second: 19184, Transitions per second: 85063
pins2lts-mc-linux64( 0/ 8), 798.889:
pins2lts-mc-linux64( 0/ 8), 798.889: Progress states detected: 12566744
pins2lts-mc-linux64( 0/ 8), 798.889: Redundant explorations: -43.1606
pins2lts-mc-linux64( 0/ 8), 798.889:
pins2lts-mc-linux64( 0/ 8), 798.889: Queue width: 8B, total height: 15893276, memory: 121.26MB
pins2lts-mc-linux64( 0/ 8), 798.889: Tree memory: 461.6MB, 18.0 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 798.889: Tree fill ratio (roots/leafs): 20.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 798.889: Stored 1360 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 798.889: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 798.889: Est. total memory use: 582.9MB (~1145.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7273680204868844870;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((((LTLAPp2==true) U (LTLAPp3==true))||X(<>((LTLAPp4==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7273680204868844870;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((((LTLAPp2==true) U (LTLAPp3==true))||X(<>((LTLAPp4==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 08:04:57] [INFO ] Flatten gal took : 389 ms
[2022-05-19 08:04:59] [INFO ] Input system was already deterministic with 1324 transitions.
[2022-05-19 08:04:59] [INFO ] Transformed 653 places.
[2022-05-19 08:04:59] [INFO ] Transformed 1324 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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
[2022-05-19 08:05:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality9295931048013485851.gal : 10 ms
[2022-05-19 08:05:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality14912165936605915386.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9295931048013485851.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14912165936605915386.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((("((((((QueueJobB_0+QueueJobB_1)+(QueueJobB_2+QueueJobB_3))+((QueueJobB_4+QueueJobB_5)+(QueueJobB_6+QueueJobB_7)))+(((QueueJobB_...719
Formula 0 simplified : !G(("((((((QueueJobB_0+QueueJobB_1)+(QueueJobB_2+QueueJobB_3))+((QueueJobB_4+QueueJobB_5)+(QueueJobB_6+QueueJobB_7)))+(((QueueJobB_8...710

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="PolyORBNT-COL-S10J30"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S10J30, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277017200779"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J30.tgz
mv PolyORBNT-COL-S10J30 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;