fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r168-tall-165277017200771
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for PolyORBNT-COL-S10J20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16215.411 3600000.00 7943395.00 221303.00 FF?TT?TFFFTTFTTF normal

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-165277017200771.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-S10J20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017200771
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.3K Apr 30 04:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 04:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 03:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 03:35 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.4K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 92K 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-S10J20-LTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652941095418

Running Version 202205111006
[2022-05-19 06:18:16] [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 06:18:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 06:18:16] [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 06:18:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 06:18:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 618 ms
[2022-05-19 06:18:17] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 06:18:17] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 10 ms.
[2022-05-19 06:18:17] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 5 formulas.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10004 steps, including 570 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 23) seen :13
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 200 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 205 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 203 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 244 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 193 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 06:18:18] [INFO ] Computed 13 place invariants in 7 ms
[2022-05-19 06:18:18] [INFO ] [Real]Absence check using 6 positive place invariants in 16 ms returned sat
[2022-05-19 06:18:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-19 06:18:19] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2022-05-19 06:18:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 06:18:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:18:19] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2022-05-19 06:18:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:18:19] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :4 sat :1
[2022-05-19 06:18:19] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 2 ms to minimize.
[2022-05-19 06:18:19] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2022-05-19 06:18:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2022-05-19 06:18:19] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-19 06:18:19] [INFO ] After 509ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 3 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 17 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 06:18:19] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-19 06:18:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10005 steps, including 740 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 257 resets, run finished after 9 ms. (steps per millisecond=1111 ) 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 35 ms. (steps per millisecond=39 ) 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 3 ms. (steps per millisecond=464 ) properties seen :0
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 06:18:19] [INFO ] Flatten gal took : 29 ms
[2022-05-19 06:18:19] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 06:18:19] [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 06:18:20] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 337 ms.
[2022-05-19 06:18:20] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 27 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 292 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1650
Applied a total of 10 rules in 58 ms. Remains 464 /474 variables (removed 10) and now considering 1650/1650 (removed 0) transitions.
[2022-05-19 06:18:20] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 464 cols
[2022-05-19 06:18:20] [INFO ] Computed 62 place invariants in 67 ms
[2022-05-19 06:18:21] [INFO ] Dead Transitions using invariants and state equation in 924 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 06:18:21] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:18:21] [INFO ] Computed 62 place invariants in 54 ms
[2022-05-19 06:18:21] [INFO ] Implicit Places using invariants in 284 ms returned []
[2022-05-19 06:18:21] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:18:21] [INFO ] Computed 62 place invariants in 31 ms
[2022-05-19 06:18:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:18:22] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 1712 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 464/474 places, 1035/1650 transitions.
Applied a total of 0 rules in 15 ms. Remains 464 /464 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 464/474 places, 1035/1650 transitions.
Support contains 292 out of 464 places after structural reductions.
[2022-05-19 06:18:23] [INFO ] Flatten gal took : 129 ms
[2022-05-19 06:18:23] [INFO ] Flatten gal took : 101 ms
[2022-05-19 06:18:23] [INFO ] Input system was already deterministic with 1035 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 583 ms. (steps per millisecond=17 ) properties (out of 18) seen :5
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2022-05-19 06:18:25] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:18:25] [INFO ] Computed 62 place invariants in 30 ms
[2022-05-19 06:18:26] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-19 06:18:26] [INFO ] [Nat]Absence check using 56 positive place invariants in 14 ms returned sat
[2022-05-19 06:18:26] [INFO ] [Nat]Absence check using 56 positive and 6 generalized place invariants in 8 ms returned sat
[2022-05-19 06:18:51] [INFO ] After 24706ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2022-05-19 06:18:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:18:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 06:18:51] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 276 out of 464 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 464 transition count 1033
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 462 transition count 1032
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 461 transition count 1032
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 461 transition count 1030
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 459 transition count 1030
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 14 place count 457 transition count 1028
Applied a total of 14 rules in 98 ms. Remains 457 /464 variables (removed 7) and now considering 1028/1035 (removed 7) transitions.
[2022-05-19 06:18:51] [INFO ] Flow matrix only has 1019 transitions (discarded 9 similar events)
// Phase 1: matrix 1019 rows 457 cols
[2022-05-19 06:18:51] [INFO ] Computed 62 place invariants in 26 ms
[2022-05-19 06:18:51] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 457/464 places, 1028/1035 transitions.
Incomplete random walk after 10000 steps, including 682 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 06:18:52] [INFO ] Flow matrix only has 1019 transitions (discarded 9 similar events)
// Phase 1: matrix 1019 rows 457 cols
[2022-05-19 06:18:52] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 06:18:52] [INFO ] [Real]Absence check using 56 positive place invariants in 20 ms returned sat
[2022-05-19 06:18:52] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-19 06:18:52] [INFO ] After 474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 06:18:52] [INFO ] [Nat]Absence check using 56 positive place invariants in 12 ms returned sat
[2022-05-19 06:18:52] [INFO ] [Nat]Absence check using 56 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-19 06:19:01] [INFO ] After 9405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 457 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 457/457 places, 1028/1028 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 457 transition count 1005
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 434 transition count 1005
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 46 place count 434 transition count 982
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 92 place count 411 transition count 982
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 410 transition count 981
Applied a total of 94 rules in 85 ms. Remains 410 /457 variables (removed 47) and now considering 981/1028 (removed 47) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/457 places, 981/1028 transitions.
Incomplete random walk after 10000 steps, including 737 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 501928 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 501928 steps, saw 81664 distinct states, run finished after 3003 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 06:19:05] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:19:05] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 06:19:05] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:19:05] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-19 06:19:05] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 06:19:05] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-19 06:19:05] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-19 06:19:14] [INFO ] After 9365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 35 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 29 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-19 06:19:14] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:19:14] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 06:19:15] [INFO ] Implicit Places using invariants in 340 ms returned []
[2022-05-19 06:19:15] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:19:15] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 06:19:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:19:16] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 2015 ms to find 0 implicit places.
[2022-05-19 06:19:16] [INFO ] Redundant transitions in 63 ms returned []
[2022-05-19 06:19:16] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:19:16] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-19 06:19:17] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 102 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 960 rows 398 cols
[2022-05-19 06:19:17] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:19:17] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-19 06:19:17] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-19 06:19:17] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 06:19:17] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2022-05-19 06:19:17] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-19 06:19:26] [INFO ] After 9366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-19 06:19:26] [INFO ] Flatten gal took : 63 ms
[2022-05-19 06:19:27] [INFO ] Flatten gal took : 76 ms
[2022-05-19 06:19:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17258236236462013742.gal : 26 ms
[2022-05-19 06:19:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3688896036776915903.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16149695903994466278;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17258236236462013742.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3688896036776915903.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality3688896036776915903.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 388
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :388 after 392
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :392 after 403
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :403 after 431
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :431 after 491
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :491 after 615
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :615 after 954
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :954 after 5853
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5853 after 251318
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :251318 after 255298
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :255298 after 322512
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :322512 after 456958
Detected timeout of ITS tools.
[2022-05-19 06:19:42] [INFO ] Flatten gal took : 56 ms
[2022-05-19 06:19:42] [INFO ] Applying decomposition
[2022-05-19 06:19:42] [INFO ] Flatten gal took : 55 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/graph14463383386800470798.txt' '-o' '/tmp/graph14463383386800470798.bin' '-w' '/tmp/graph14463383386800470798.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14463383386800470798.bin' '-l' '-1' '-v' '-w' '/tmp/graph14463383386800470798.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:19:42] [INFO ] Decomposing Gal with order
[2022-05-19 06:19:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:19:42] [INFO ] Removed a total of 65 redundant transitions.
[2022-05-19 06:19:42] [INFO ] Flatten gal took : 122 ms
[2022-05-19 06:19:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 6 ms.
[2022-05-19 06:19:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9765641322493010919.gal : 11 ms
[2022-05-19 06:19:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3585198378274878768.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16149695903994466278;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9765641322493010919.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3585198378274878768.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3585198378274878768.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 396
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :396 after 424
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :424 after 502
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :502 after 688
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :688 after 1076
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1076 after 1866
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1866 after 4168
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16594552077509066378
[2022-05-19 06:19:57] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16594552077509066378
Running compilation step : cd /tmp/ltsmin16594552077509066378;'/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 2240 ms.
Running link step : cd /tmp/ltsmin16594552077509066378;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16594552077509066378;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp15==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Successfully simplified 1 atomic propositions for a total of 9 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' '!(G((X(p0)||F((X(p1)||p2)))))'
Support contains 5 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Applied a total of 0 rules in 8 ms. Remains 464 /464 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
[2022-05-19 06:20:13] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:20:13] [INFO ] Computed 62 place invariants in 19 ms
[2022-05-19 06:20:13] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
[2022-05-19 06:20:13] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:20:13] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:20:14] [INFO ] Implicit Places using invariants in 346 ms returned []
[2022-05-19 06:20:14] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:20:14] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:20:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:20:16] [INFO ] Implicit Places using invariants and state equation in 2089 ms returned []
Implicit Place search using SMT with State Equation took 2438 ms to find 0 implicit places.
[2022-05-19 06:20:16] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:20:16] [INFO ] Computed 62 place invariants in 27 ms
[2022-05-19 06:20:16] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 464/464 places, 1035/1035 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GT s0 s460) (GT s414 s462)), p0:(GT s23 s414), p1:(GT s414 s462)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 464 steps with 43 reset in 22 ms.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-00 finished in 3882 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 463 transition count 1034
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 1034
Applied a total of 2 rules in 19 ms. Remains 463 /464 variables (removed 1) and now considering 1034/1035 (removed 1) transitions.
[2022-05-19 06:20:17] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:20:17] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 06:20:17] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
[2022-05-19 06:20:17] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:20:17] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 06:20:17] [INFO ] Implicit Places using invariants in 359 ms returned []
[2022-05-19 06:20:17] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:20:17] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 06:20:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:20:19] [INFO ] Implicit Places using invariants and state equation in 2037 ms returned []
Implicit Place search using SMT with State Equation took 2398 ms to find 0 implicit places.
[2022-05-19 06:20:19] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:20:19] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-19 06:20:20] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/464 places, 1034/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 463/464 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-01 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:(LEQ 3 s375)], 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 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-01 finished in 3546 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Support contains 2 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 439 transition count 1009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 438 transition count 1009
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 52 place count 438 transition count 985
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 100 place count 414 transition count 985
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 413 transition count 984
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 413 transition count 984
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 3 with 4 rules applied. Total rules applied 106 place count 411 transition count 982
Applied a total of 106 rules in 107 ms. Remains 411 /464 variables (removed 53) and now considering 982/1035 (removed 53) transitions.
[2022-05-19 06:20:20] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:20:20] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 06:20:21] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
[2022-05-19 06:20:21] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:20:21] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:20:21] [INFO ] Implicit Places using invariants in 334 ms returned []
[2022-05-19 06:20:21] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:20:21] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-19 06:20:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:20:22] [INFO ] Implicit Places using invariants and state equation in 1393 ms returned []
Implicit Place search using SMT with State Equation took 1733 ms to find 0 implicit places.
[2022-05-19 06:20:22] [INFO ] Redundant transitions in 16 ms returned []
[2022-05-19 06:20:22] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:20:22] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 06:20:23] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/464 places, 982/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/464 places, 982/1035 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s114 s66)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7181 reset in 1014 ms.
Product exploration explored 100000 steps with 7141 reset in 983 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 107 steps, including 9 resets, run visited all 1 properties in 3 ms. (steps per millisecond=35 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 424 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 41 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2022-05-19 06:20:26] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:20:26] [INFO ] Computed 62 place invariants in 19 ms
[2022-05-19 06:20:26] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
[2022-05-19 06:20:26] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:20:26] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-19 06:20:26] [INFO ] Implicit Places using invariants in 328 ms returned []
[2022-05-19 06:20:26] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:20:26] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 06:20:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:20:28] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
[2022-05-19 06:20:28] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-19 06:20:28] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:20:28] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 06:20:28] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 72 steps, including 5 resets, run visited all 1 properties in 3 ms. (steps per millisecond=24 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7139 reset in 918 ms.
Product exploration explored 100000 steps with 7158 reset in 922 ms.
Built C files in :
/tmp/ltsmin1217082660178110438
[2022-05-19 06:20:30] [INFO ] Computing symmetric may disable matrix : 982 transitions.
[2022-05-19 06:20:31] [INFO ] Computation of Complete disable matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:20:31] [INFO ] Computing symmetric may enable matrix : 982 transitions.
[2022-05-19 06:20:31] [INFO ] Computation of Complete enable matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:20:31] [INFO ] Computing Do-Not-Accords matrix : 982 transitions.
[2022-05-19 06:20:31] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:20:31] [INFO ] Built C files in 281ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1217082660178110438
Running compilation step : cd /tmp/ltsmin1217082660178110438;'/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/ltsmin1217082660178110438;'/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/ltsmin1217082660178110438;'/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 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 21 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2022-05-19 06:20:34] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:20:34] [INFO ] Computed 62 place invariants in 21 ms
[2022-05-19 06:20:34] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
[2022-05-19 06:20:34] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:20:34] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-19 06:20:35] [INFO ] Implicit Places using invariants in 331 ms returned []
[2022-05-19 06:20:35] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:20:35] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 06:20:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:20:36] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 1755 ms to find 0 implicit places.
[2022-05-19 06:20:36] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-19 06:20:36] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:20:36] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-19 06:20:36] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Built C files in :
/tmp/ltsmin11471457062207081220
[2022-05-19 06:20:37] [INFO ] Computing symmetric may disable matrix : 982 transitions.
[2022-05-19 06:20:37] [INFO ] Computation of Complete disable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:20:37] [INFO ] Computing symmetric may enable matrix : 982 transitions.
[2022-05-19 06:20:37] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:20:37] [INFO ] Computing Do-Not-Accords matrix : 982 transitions.
[2022-05-19 06:20:37] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:20:37] [INFO ] Built C files in 195ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11471457062207081220
Running compilation step : cd /tmp/ltsmin11471457062207081220;'/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/ltsmin11471457062207081220;'/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/ltsmin11471457062207081220;'/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 06:20:40] [INFO ] Flatten gal took : 67 ms
[2022-05-19 06:20:40] [INFO ] Flatten gal took : 60 ms
[2022-05-19 06:20:40] [INFO ] Time to serialize gal into /tmp/LTL11860824967599764915.gal : 8 ms
[2022-05-19 06:20:40] [INFO ] Time to serialize properties into /tmp/LTL10407242847489541181.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/LTL11860824967599764915.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10407242847489541181.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/LTL1186082...268
Read 1 LTL properties
Checking formula 0 : !((X(F(G("(NotifyEventJobQueuedE_0<=mo3_0)")))))
Formula 0 simplified : !XFG"(NotifyEventJobQueuedE_0<=mo3_0)"
Detected timeout of ITS tools.
[2022-05-19 06:20:56] [INFO ] Flatten gal took : 55 ms
[2022-05-19 06:20:56] [INFO ] Applying decomposition
[2022-05-19 06:20:56] [INFO ] Flatten gal took : 55 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/graph5752148499193260000.txt' '-o' '/tmp/graph5752148499193260000.bin' '-w' '/tmp/graph5752148499193260000.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5752148499193260000.bin' '-l' '-1' '-v' '-w' '/tmp/graph5752148499193260000.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:20:56] [INFO ] Decomposing Gal with order
[2022-05-19 06:20:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:20:56] [INFO ] Removed a total of 2782 redundant transitions.
[2022-05-19 06:20:56] [INFO ] Flatten gal took : 142 ms
[2022-05-19 06:20:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 221 labels/synchronizations in 41 ms.
[2022-05-19 06:20:56] [INFO ] Time to serialize gal into /tmp/LTL7671296917960318953.gal : 9 ms
[2022-05-19 06:20:56] [INFO ] Time to serialize properties into /tmp/LTL10387162623810383296.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/LTL7671296917960318953.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10387162623810383296.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/LTL7671296...267
Read 1 LTL properties
Checking formula 0 : !((X(F(G("(gu1.NotifyEventJobQueuedE_0<=gu1.mo3_0)")))))
Formula 0 simplified : !XFG"(gu1.NotifyEventJobQueuedE_0<=gu1.mo3_0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15772468620098123395
[2022-05-19 06:21:11] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15772468620098123395
Running compilation step : cd /tmp/ltsmin15772468620098123395;'/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 1966 ms.
Running link step : cd /tmp/ltsmin15772468620098123395;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15772468620098123395;'/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))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-02 finished in 66162 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||p1))))'
Support contains 12 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 463 transition count 1034
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 1034
Applied a total of 2 rules in 16 ms. Remains 463 /464 variables (removed 1) and now considering 1034/1035 (removed 1) transitions.
[2022-05-19 06:21:26] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:21:26] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 06:21:27] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
[2022-05-19 06:21:27] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:21:27] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-19 06:21:27] [INFO ] Implicit Places using invariants in 372 ms returned []
[2022-05-19 06:21:27] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:21:27] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-19 06:21:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:21:29] [INFO ] Implicit Places using invariants and state equation in 1961 ms returned []
Implicit Place search using SMT with State Equation took 2335 ms to find 0 implicit places.
[2022-05-19 06:21:29] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:21:29] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:21:30] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/464 places, 1034/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 463/464 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT (ADD s365 s366 s367 s368 s369 s370 s371 s372 s373 s374) s141), p0:(LEQ s141 s66)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 659 ms.
Product exploration explored 100000 steps with 33333 reset in 643 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 (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-04 finished in 4910 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 50 place count 439 transition count 985
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 414 transition count 985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 413 transition count 984
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 413 transition count 984
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 106 place count 411 transition count 982
Applied a total of 106 rules in 51 ms. Remains 411 /464 variables (removed 53) and now considering 982/1035 (removed 53) transitions.
[2022-05-19 06:21:31] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:21:31] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 06:21:32] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
[2022-05-19 06:21:32] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:21:32] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 06:21:32] [INFO ] Implicit Places using invariants in 330 ms returned []
[2022-05-19 06:21:32] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:21:32] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 06:21:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:21:34] [INFO ] Implicit Places using invariants and state equation in 1789 ms returned []
Implicit Place search using SMT with State Equation took 2126 ms to find 0 implicit places.
[2022-05-19 06:21:34] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-19 06:21:34] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:21:34] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 06:21:34] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/464 places, 982/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/464 places, 982/1035 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s406 (ADD s394 s395 s396 s397 s398 s399 s400 s401 s402 s403))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7383 reset in 1057 ms.
Product exploration explored 100000 steps with 7379 reset in 1060 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 76 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=38 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 11 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 22 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2022-05-19 06:21:37] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:21:37] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-19 06:21:37] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
[2022-05-19 06:21:37] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:21:37] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:21:38] [INFO ] Implicit Places using invariants in 328 ms returned []
[2022-05-19 06:21:38] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:21:38] [INFO ] Computed 62 place invariants in 20 ms
[2022-05-19 06:21:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:21:39] [INFO ] Implicit Places using invariants and state equation in 1745 ms returned []
Implicit Place search using SMT with State Equation took 2075 ms to find 0 implicit places.
[2022-05-19 06:21:39] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-19 06:21:39] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:21:39] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 06:21:40] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 519 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7367 reset in 1038 ms.
Product exploration explored 100000 steps with 7375 reset in 1056 ms.
Built C files in :
/tmp/ltsmin16414554009579113103
[2022-05-19 06:21:43] [INFO ] Computing symmetric may disable matrix : 982 transitions.
[2022-05-19 06:21:43] [INFO ] Computation of Complete disable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:21:43] [INFO ] Computing symmetric may enable matrix : 982 transitions.
[2022-05-19 06:21:43] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:21:43] [INFO ] Computing Do-Not-Accords matrix : 982 transitions.
[2022-05-19 06:21:43] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:21:43] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16414554009579113103
Running compilation step : cd /tmp/ltsmin16414554009579113103;'/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/ltsmin16414554009579113103;'/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/ltsmin16414554009579113103;'/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 11 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 16 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2022-05-19 06:21:46] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:21:46] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:21:46] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
[2022-05-19 06:21:46] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:21:46] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:21:47] [INFO ] Implicit Places using invariants in 305 ms returned []
[2022-05-19 06:21:47] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:21:47] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-19 06:21:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:21:49] [INFO ] Implicit Places using invariants and state equation in 1735 ms returned []
Implicit Place search using SMT with State Equation took 2043 ms to find 0 implicit places.
[2022-05-19 06:21:49] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-19 06:21:49] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:21:49] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 06:21:49] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Built C files in :
/tmp/ltsmin4314277366332935105
[2022-05-19 06:21:49] [INFO ] Computing symmetric may disable matrix : 982 transitions.
[2022-05-19 06:21:49] [INFO ] Computation of Complete disable matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:21:49] [INFO ] Computing symmetric may enable matrix : 982 transitions.
[2022-05-19 06:21:49] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:21:49] [INFO ] Computing Do-Not-Accords matrix : 982 transitions.
[2022-05-19 06:21:49] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:21:49] [INFO ] Built C files in 176ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4314277366332935105
Running compilation step : cd /tmp/ltsmin4314277366332935105;'/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/ltsmin4314277366332935105;'/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/ltsmin4314277366332935105;'/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 06:21:52] [INFO ] Flatten gal took : 71 ms
[2022-05-19 06:21:52] [INFO ] Flatten gal took : 79 ms
[2022-05-19 06:21:52] [INFO ] Time to serialize gal into /tmp/LTL3167148704076215899.gal : 20 ms
[2022-05-19 06:21:52] [INFO ] Time to serialize properties into /tmp/LTL9556069172451216798.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/LTL3167148704076215899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9556069172451216798.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/LTL3167148...266
Read 1 LTL properties
Checking formula 0 : !((G(F("(Check_Sources_B_0<=((((DataOnSrc_0+DataOnSrc_1)+(DataOnSrc_2+DataOnSrc_3))+((DataOnSrc_4+DataOnSrc_5)+(DataOnSrc_6+DataOnSrc_...192
Formula 0 simplified : !GF"(Check_Sources_B_0<=((((DataOnSrc_0+DataOnSrc_1)+(DataOnSrc_2+DataOnSrc_3))+((DataOnSrc_4+DataOnSrc_5)+(DataOnSrc_6+DataOnSrc_7)...186
Detected timeout of ITS tools.
[2022-05-19 06:22:08] [INFO ] Flatten gal took : 53 ms
[2022-05-19 06:22:08] [INFO ] Applying decomposition
[2022-05-19 06:22:08] [INFO ] Flatten gal took : 80 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/graph18290703039337987876.txt' '-o' '/tmp/graph18290703039337987876.bin' '-w' '/tmp/graph18290703039337987876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18290703039337987876.bin' '-l' '-1' '-v' '-w' '/tmp/graph18290703039337987876.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:22:08] [INFO ] Decomposing Gal with order
[2022-05-19 06:22:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:22:08] [INFO ] Removed a total of 678 redundant transitions.
[2022-05-19 06:22:08] [INFO ] Flatten gal took : 120 ms
[2022-05-19 06:22:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 479 labels/synchronizations in 54 ms.
[2022-05-19 06:22:08] [INFO ] Time to serialize gal into /tmp/LTL4923072478142052049.gal : 21 ms
[2022-05-19 06:22:08] [INFO ] Time to serialize properties into /tmp/LTL14920261340287157647.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/LTL4923072478142052049.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14920261340287157647.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/LTL4923072...267
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu23.Check_Sources_B_0<=((((gu23.DataOnSrc_0+gu23.DataOnSrc_1)+(gu23.DataOnSrc_2+gu23.DataOnSrc_3))+((gu23.DataOnSrc_4+gu23.D...247
Formula 0 simplified : !GF"(gu23.Check_Sources_B_0<=((((gu23.DataOnSrc_0+gu23.DataOnSrc_1)+(gu23.DataOnSrc_2+gu23.DataOnSrc_3))+((gu23.DataOnSrc_4+gu23.Dat...241
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3920020897543897531
[2022-05-19 06:22:23] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3920020897543897531
Running compilation step : cd /tmp/ltsmin3920020897543897531;'/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 1963 ms.
Running link step : cd /tmp/ltsmin3920020897543897531;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin3920020897543897531;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-05 finished in 67217 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(F(X(G(p0))))))))'
Support contains 2 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 464 transition count 1009
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 438 transition count 1009
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 52 place count 438 transition count 984
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 102 place count 413 transition count 984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 412 transition count 983
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 412 transition count 983
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 2 with 4 rules applied. Total rules applied 108 place count 410 transition count 981
Applied a total of 108 rules in 43 ms. Remains 410 /464 variables (removed 54) and now considering 981/1035 (removed 54) transitions.
[2022-05-19 06:22:38] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:22:38] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:22:39] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
[2022-05-19 06:22:39] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:22:39] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 06:22:39] [INFO ] Implicit Places using invariants in 433 ms returned []
[2022-05-19 06:22:39] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:22:39] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 06:22:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:22:41] [INFO ] Implicit Places using invariants and state equation in 1360 ms returned []
Implicit Place search using SMT with State Equation took 1800 ms to find 0 implicit places.
[2022-05-19 06:22:41] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-19 06:22:41] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:22:41] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 06:22:41] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 410/464 places, 981/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/464 places, 981/1035 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s22 s112)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-07 finished in 2988 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(p0 U ((F(p1)||p0)&&p1)) U G(p1))))'
Support contains 211 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 50 place count 439 transition count 985
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 414 transition count 985
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 413 transition count 984
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 413 transition count 984
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 106 place count 411 transition count 982
Applied a total of 106 rules in 39 ms. Remains 411 /464 variables (removed 53) and now considering 982/1035 (removed 53) transitions.
[2022-05-19 06:22:41] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:22:41] [INFO ] Computed 62 place invariants in 33 ms
[2022-05-19 06:22:42] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
[2022-05-19 06:22:42] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:22:42] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-19 06:22:43] [INFO ] Implicit Places using invariants in 380 ms returned []
[2022-05-19 06:22:43] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:22:43] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:22:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:22:44] [INFO ] Implicit Places using invariants and state equation in 1259 ms returned []
Implicit Place search using SMT with State Equation took 1670 ms to find 0 implicit places.
[2022-05-19 06:22:44] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-19 06:22:44] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:22:44] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:22:44] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/464 places, 982/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/464 places, 982/1035 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), true, true]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 2 s149), p0:(LEQ 2 (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-08 finished in 3068 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(p0)))&&F(p1)))'
Support contains 213 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 463 transition count 1034
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 1034
Applied a total of 2 rules in 8 ms. Remains 463 /464 variables (removed 1) and now considering 1034/1035 (removed 1) transitions.
[2022-05-19 06:22:44] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:22:44] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 06:22:45] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
[2022-05-19 06:22:45] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:22:45] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 06:22:45] [INFO ] Implicit Places using invariants in 293 ms returned []
[2022-05-19 06:22:45] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:22:45] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-19 06:22:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:22:47] [INFO ] Implicit Places using invariants and state equation in 1887 ms returned []
Implicit Place search using SMT with State Equation took 2198 ms to find 0 implicit places.
[2022-05-19 06:22:47] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:22:47] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:22:48] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/464 places, 1034/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 463/464 places, 1034/1035 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s377 (ADD s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-12 finished in 3548 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0)||p1))||(X(p2)&&F(p3))))'
Support contains 49 out of 464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 1035/1035 transitions.
Applied a total of 0 rules in 6 ms. Remains 464 /464 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
[2022-05-19 06:22:48] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:22:48] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:22:49] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
[2022-05-19 06:22:49] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:22:49] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:22:49] [INFO ] Implicit Places using invariants in 379 ms returned []
[2022-05-19 06:22:49] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:22:49] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:22:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:22:51] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 1959 ms to find 0 implicit places.
[2022-05-19 06:22:51] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:22:51] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 06:22:51] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 464/464 places, 1035/1035 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s461 s460), p3:(LEQ s67 s377), p0:(LEQ s141 (ADD s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65)), p2:(OR (LE...], 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 50000 reset in 719 ms.
Product exploration explored 100000 steps with 50000 reset in 737 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) p3 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 4 states, 5 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-13 finished in 4997 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-05-19 06:22:53] [INFO ] Flatten gal took : 53 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17394896738127706805
[2022-05-19 06:22:53] [INFO ] Computing symmetric may disable matrix : 1035 transitions.
[2022-05-19 06:22:53] [INFO ] Applying decomposition
[2022-05-19 06:22:53] [INFO ] Computation of Complete disable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:22:53] [INFO ] Computing symmetric may enable matrix : 1035 transitions.
[2022-05-19 06:22:53] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:22:53] [INFO ] Flatten gal took : 54 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/graph4494473111967208117.txt' '-o' '/tmp/graph4494473111967208117.bin' '-w' '/tmp/graph4494473111967208117.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4494473111967208117.bin' '-l' '-1' '-v' '-w' '/tmp/graph4494473111967208117.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:22:54] [INFO ] Decomposing Gal with order
[2022-05-19 06:22:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:22:54] [INFO ] Computing Do-Not-Accords matrix : 1035 transitions.
[2022-05-19 06:22:54] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:22:54] [INFO ] Built C files in 404ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17394896738127706805
Running compilation step : cd /tmp/ltsmin17394896738127706805;'/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 06:22:54] [INFO ] Removed a total of 735 redundant transitions.
[2022-05-19 06:22:54] [INFO ] Flatten gal took : 202 ms
[2022-05-19 06:22:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 622 labels/synchronizations in 28 ms.
[2022-05-19 06:22:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality7959838244758051064.gal : 23 ms
[2022-05-19 06:22:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality8540691863123181126.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/LTLCardinality7959838244758051064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8540691863123181126.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...288
Read 2 LTL properties
Checking formula 0 : !((X(F(G("(gi0.gi0.gu10.NotifyEventJobQueuedE_0<=gi0.gi0.gu10.mo3_0)")))))
Formula 0 simplified : !XFG"(gi0.gi0.gu10.NotifyEventJobQueuedE_0<=gi0.gi0.gu10.mo3_0)"
Compilation finished in 4625 ms.
Running link step : cd /tmp/ltsmin17394896738127706805;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin17394896738127706805;'/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))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 06:44:28] [INFO ] Applying decomposition
[2022-05-19 06:44:28] [INFO ] Flatten gal took : 237 ms
[2022-05-19 06:44:28] [INFO ] Decomposing Gal with order
[2022-05-19 06:44:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:44:29] [INFO ] Removed a total of 5756 redundant transitions.
[2022-05-19 06:44:29] [INFO ] Flatten gal took : 702 ms
[2022-05-19 06:44:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 72 ms.
[2022-05-19 06:44:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality2681055471606763261.gal : 33 ms
[2022-05-19 06:44:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality18047621057978156434.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/LTLCardinality2681055471606763261.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18047621057978156434.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...289
Read 2 LTL properties
Checking formula 0 : !((X(F(G("(gNotifyEventJobQueuedE.NotifyEventJobQueuedE_0<=gmo3.mo3_0)")))))
Formula 0 simplified : !XFG"(gNotifyEventJobQueuedE.NotifyEventJobQueuedE_0<=gmo3.mo3_0)"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.025: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.044: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.044: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.044: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.044: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.244: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.244: LTL layer: formula: X(<>([]((LTLAPp0==true))))
pins2lts-mc-linux64( 0/ 8), 0.244: "X(<>([]((LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.245: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.284: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.305: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.337: buchi has 2 states
pins2lts-mc-linux64( 7/ 8), 0.328: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.338: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.339: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.398: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.396: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.587: There are 1038 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.587: State length is 465, there are 1039 groups
pins2lts-mc-linux64( 0/ 8), 0.587: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.587: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.587: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.587: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.651: [Blue] ~18 levels ~960 states ~3848 transitions
pins2lts-mc-linux64( 6/ 8), 0.912: [Blue] ~18 levels ~1920 states ~7936 transitions
pins2lts-mc-linux64( 6/ 8), 1.503: [Blue] ~31 levels ~3840 states ~14232 transitions
pins2lts-mc-linux64( 7/ 8), 2.092: [Blue] ~31 levels ~7680 states ~21408 transitions
pins2lts-mc-linux64( 7/ 8), 3.445: [Blue] ~31 levels ~15360 states ~41976 transitions
pins2lts-mc-linux64( 4/ 8), 6.544: [Blue] ~31 levels ~30720 states ~77120 transitions
pins2lts-mc-linux64( 5/ 8), 12.191: [Blue] ~31 levels ~61440 states ~151344 transitions
pins2lts-mc-linux64( 5/ 8), 21.085: [Blue] ~31 levels ~122880 states ~297456 transitions
pins2lts-mc-linux64( 4/ 8), 38.343: [Blue] ~31 levels ~245760 states ~631840 transitions
pins2lts-mc-linux64( 4/ 8), 63.574: [Blue] ~31 levels ~491520 states ~1268792 transitions
pins2lts-mc-linux64( 4/ 8), 100.340: [Blue] ~31 levels ~983040 states ~2570832 transitions
pins2lts-mc-linux64( 6/ 8), 144.760: [Blue] ~31 levels ~1966080 states ~5187456 transitions
pins2lts-mc-linux64( 4/ 8), 205.705: [Blue] ~31 levels ~3932160 states ~10923904 transitions
pins2lts-mc-linux64( 3/ 8), 324.786: [Blue] ~31 levels ~7864320 states ~20823616 transitions
pins2lts-mc-linux64( 3/ 8), 536.543: [Blue] ~31 levels ~15728640 states ~42193800 transitions
pins2lts-mc-linux64( 7/ 8), 995.008: [Blue] ~31 levels ~31457280 states ~88392752 transitions
pins2lts-mc-linux64( 3/ 8), 1508.439: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1508.486:
pins2lts-mc-linux64( 0/ 8), 1508.486: Explored 47532602 states 134590715 transitions, fanout: 2.832
pins2lts-mc-linux64( 0/ 8), 1508.486: Total exploration time 1507.870 sec (1507.810 sec minimum, 1507.841 sec on average)
pins2lts-mc-linux64( 0/ 8), 1508.486: States per second: 31523, Transitions per second: 89259
pins2lts-mc-linux64( 0/ 8), 1508.486:
pins2lts-mc-linux64( 0/ 8), 1508.486: State space has 47534322 states, 13725719 are accepting
pins2lts-mc-linux64( 0/ 8), 1508.486: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1508.486: blue states: 47532602 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1508.486: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1508.486: all-red states: 21368106 (44.95%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1508.486:
pins2lts-mc-linux64( 0/ 8), 1508.486: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1508.486:
pins2lts-mc-linux64( 0/ 8), 1508.486: Queue width: 8B, total height: 248, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1508.486: Tree memory: 618.7MB, 13.6 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1508.486: Tree fill ratio (roots/leafs): 35.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1508.486: Stored 1057 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1508.486: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1508.486: Est. total memory use: 618.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17394896738127706805;'/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))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17394896738127706805;'/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))))' '--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 07:06:09] [INFO ] Flatten gal took : 544 ms
[2022-05-19 07:06:09] [INFO ] Input system was already deterministic with 1035 transitions.
[2022-05-19 07:06:10] [INFO ] Transformed 464 places.
[2022-05-19 07:06:10] [INFO ] Transformed 1035 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 07:06:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality7074194608831635112.gal : 10 ms
[2022-05-19 07:06:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality16199243982140940431.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/LTLCardinality7074194608831635112.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16199243982140940431.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 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(G("(NotifyEventJobQueuedE_0<=mo3_0)")))))
Formula 0 simplified : !XFG"(NotifyEventJobQueuedE_0<=mo3_0)"

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-S10J20"
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-S10J20, 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-165277017200771"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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