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.r024-tall-165251918700556.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 CANConstruction-PT-090, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918700556
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 11K Apr 29 12:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 12:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 29 12:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 12:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 12M May 10 09:33 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 CANConstruction-PT-090-LTLFireability-00
FORMULA_NAME CANConstruction-PT-090-LTLFireability-01
FORMULA_NAME CANConstruction-PT-090-LTLFireability-02
FORMULA_NAME CANConstruction-PT-090-LTLFireability-03
FORMULA_NAME CANConstruction-PT-090-LTLFireability-04
FORMULA_NAME CANConstruction-PT-090-LTLFireability-05
FORMULA_NAME CANConstruction-PT-090-LTLFireability-06
FORMULA_NAME CANConstruction-PT-090-LTLFireability-07
FORMULA_NAME CANConstruction-PT-090-LTLFireability-08
FORMULA_NAME CANConstruction-PT-090-LTLFireability-09
FORMULA_NAME CANConstruction-PT-090-LTLFireability-10
FORMULA_NAME CANConstruction-PT-090-LTLFireability-11
FORMULA_NAME CANConstruction-PT-090-LTLFireability-12
FORMULA_NAME CANConstruction-PT-090-LTLFireability-13
FORMULA_NAME CANConstruction-PT-090-LTLFireability-14
FORMULA_NAME CANConstruction-PT-090-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652660128735

Running Version 202205111006
[2022-05-16 00:15:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-16 00:15:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:15:30] [INFO ] Load time of PNML (sax parser for PT used): 723 ms
[2022-05-16 00:15:30] [INFO ] Transformed 17282 places.
[2022-05-16 00:15:30] [INFO ] Transformed 33120 transitions.
[2022-05-16 00:15:30] [INFO ] Parsed PT model containing 17282 places and 33120 transitions in 940 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-090-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 17282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Discarding 7906 places :
Symmetric choice reduction at 0 with 7906 rule applications. Total rules 7906 place count 9376 transition count 17308
Iterating global reduction 0 with 7906 rules applied. Total rules applied 15812 place count 9376 transition count 17308
Applied a total of 15812 rules in 6700 ms. Remains 9376 /17282 variables (removed 7906) and now considering 17308/33120 (removed 15812) transitions.
// Phase 1: matrix 17308 rows 9376 cols
[2022-05-16 00:15:38] [INFO ] Computed 181 place invariants in 273 ms
[2022-05-16 00:15:39] [INFO ] Implicit Places using invariants in 1309 ms returned []
Implicit Place search using SMT only with invariants took 1346 ms to find 0 implicit places.
// Phase 1: matrix 17308 rows 9376 cols
[2022-05-16 00:15:39] [INFO ] Computed 181 place invariants in 134 ms
[2022-05-16 00:15:40] [INFO ] Dead Transitions using invariants and state equation in 983 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9376/17282 places, 17308/33120 transitions.
Finished structural reductions, in 1 iterations. Remains : 9376/17282 places, 17308/33120 transitions.
Support contains 41 out of 9376 places after structural reductions.
[2022-05-16 00:15:41] [INFO ] Flatten gal took : 730 ms
[2022-05-16 00:15:41] [INFO ] Flatten gal took : 542 ms
[2022-05-16 00:15:42] [INFO ] Input system was already deterministic with 17308 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 864 ms. (steps per millisecond=11 ) properties (out of 27) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 17308 rows 9376 cols
[2022-05-16 00:15:44] [INFO ] Computed 181 place invariants in 117 ms
[2022-05-16 00:15:47] [INFO ] [Real]Absence check using 91 positive place invariants in 222 ms returned sat
[2022-05-16 00:15:47] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 128 ms returned sat
[2022-05-16 00:16:07] [INFO ] After 18497ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13 real:2
[2022-05-16 00:16:07] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2022-05-16 00:16:09] [INFO ] After 1226ms SMT Verify possible using 16110 Read/Feed constraints in real domain returned unsat :0 sat :12 real:2
[2022-05-16 00:16:09] [INFO ] After 1228ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :12 real:2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-16 00:16:09] [INFO ] After 25038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :12 real:2
[2022-05-16 00:16:11] [INFO ] [Nat]Absence check using 91 positive place invariants in 205 ms returned sat
[2022-05-16 00:16:12] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 106 ms returned sat
[2022-05-16 00:16:31] [INFO ] After 17496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-16 00:16:34] [INFO ] After 2705ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2022-05-16 00:16:34] [INFO ] After 2707ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-16 00:16:34] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 15 Parikh solutions to 12 different solutions.
Parikh walk visited 3 properties in 643 ms.
Support contains 16 out of 9376 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 9376/9376 places, 17308/17308 transitions.
Drop transitions removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 9376 transition count 16681
Reduce places removed 627 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 628 rules applied. Total rules applied 1255 place count 8749 transition count 16680
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1256 place count 8748 transition count 16680
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1256 place count 8748 transition count 16679
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1258 place count 8747 transition count 16679
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1260 place count 8745 transition count 16675
Iterating global reduction 3 with 2 rules applied. Total rules applied 1262 place count 8745 transition count 16675
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 5 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1440 place count 8656 transition count 16586
Free-agglomeration rule applied 156 times.
Iterating global reduction 3 with 156 rules applied. Total rules applied 1596 place count 8656 transition count 16430
Reduce places removed 156 places and 0 transitions.
Iterating post reduction 3 with 156 rules applied. Total rules applied 1752 place count 8500 transition count 16430
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1753 place count 8500 transition count 16429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1754 place count 8499 transition count 16429
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 5 with 23 rules applied. Total rules applied 1777 place count 8499 transition count 16429
Applied a total of 1777 rules in 16453 ms. Remains 8499 /9376 variables (removed 877) and now considering 16429/17308 (removed 879) transitions.
Finished structural reductions, in 1 iterations. Remains : 8499/9376 places, 16429/17308 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 652 ms. (steps per millisecond=15 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 16429 rows 8499 cols
[2022-05-16 00:16:52] [INFO ] Computed 181 place invariants in 142 ms
[2022-05-16 00:16:54] [INFO ] [Real]Absence check using 91 positive place invariants in 170 ms returned sat
[2022-05-16 00:16:54] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 102 ms returned sat
[2022-05-16 00:17:07] [INFO ] After 12713ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8
[2022-05-16 00:17:08] [INFO ] State equation strengthened by 16210 read => feed constraints.
[2022-05-16 00:17:14] [INFO ] After 6344ms SMT Verify possible using 16210 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-16 00:17:14] [INFO ] After 21981ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-16 00:17:16] [INFO ] [Nat]Absence check using 91 positive place invariants in 176 ms returned sat
[2022-05-16 00:17:16] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 104 ms returned sat
[2022-05-16 00:17:31] [INFO ] After 14787ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-16 00:17:38] [INFO ] After 6626ms SMT Verify possible using 16210 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-16 00:17:39] [INFO ] After 7660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-16 00:17:39] [INFO ] After 25124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 3 properties in 66 ms.
Support contains 7 out of 8499 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8499/8499 places, 16429/16429 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 8493 transition count 16423
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 8493 transition count 16422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 8492 transition count 16422
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 8491 transition count 16420
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 8491 transition count 16420
Applied a total of 16 rules in 10760 ms. Remains 8491 /8499 variables (removed 8) and now considering 16420/16429 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 8491/8499 places, 16420/16429 transitions.
Computed a total of 361 stabilizing places and 450 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||X((X(p1)&&p2))))'
Support contains 5 out of 9376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9376/9376 places, 17308/17308 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 9363 transition count 17282
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 9363 transition count 17282
Applied a total of 26 rules in 6313 ms. Remains 9363 /9376 variables (removed 13) and now considering 17282/17308 (removed 26) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2022-05-16 00:17:57] [INFO ] Computed 181 place invariants in 137 ms
[2022-05-16 00:17:58] [INFO ] Implicit Places using invariants in 1073 ms returned []
Implicit Place search using SMT only with invariants took 1075 ms to find 0 implicit places.
// Phase 1: matrix 17282 rows 9363 cols
[2022-05-16 00:17:58] [INFO ] Computed 181 place invariants in 110 ms
[2022-05-16 00:17:59] [INFO ] Dead Transitions using invariants and state equation in 938 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9376 places, 17282/17308 transitions.
Finished structural reductions, in 1 iterations. Remains : 9363/9376 places, 17282/17308 transitions.
Stuttering acceptance computed with spot in 350 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s6 1) (GEQ s991 1)), p0:(AND (GEQ s529 1) (GEQ s1238 1)), p2:(LT s2151 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-090-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-00 finished in 9015 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&((F(p1)||p2) U p3)))'
Support contains 5 out of 9376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9376/9376 places, 17308/17308 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 9364 transition count 17284
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 9364 transition count 17284
Applied a total of 24 rules in 6400 ms. Remains 9364 /9376 variables (removed 12) and now considering 17284/17308 (removed 24) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2022-05-16 00:18:06] [INFO ] Computed 181 place invariants in 123 ms
[2022-05-16 00:18:07] [INFO ] Implicit Places using invariants in 1063 ms returned []
Implicit Place search using SMT only with invariants took 1067 ms to find 0 implicit places.
// Phase 1: matrix 17284 rows 9364 cols
[2022-05-16 00:18:07] [INFO ] Computed 181 place invariants in 124 ms
[2022-05-16 00:18:08] [INFO ] Dead Transitions using invariants and state equation in 1008 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9364/9376 places, 17284/17308 transitions.
Finished structural reductions, in 1 iterations. Remains : 9364/9376 places, 17284/17308 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p3) (NOT p0)), (NOT p0), (NOT p1), (NOT p3), true]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(GEQ s2459 1), p2:(LT s5151 1), p1:(OR (AND (GEQ s6 1) (GEQ s2955 1)) (GEQ s5151 1)), p0:(AND (LT s2459 1) (OR (LT s6 1) (LT s725 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1680 steps with 1 reset in 54 ms.
FORMULA CANConstruction-PT-090-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-03 finished in 8786 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((F(p0)||p1)))))'
Support contains 3 out of 9376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9376/9376 places, 17308/17308 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9376 transition count 16680
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 8748 transition count 16680
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 8748 transition count 16679
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 8747 transition count 16679
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1271 place count 8734 transition count 16653
Iterating global reduction 2 with 13 rules applied. Total rules applied 1284 place count 8734 transition count 16653
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1462 place count 8645 transition count 16564
Applied a total of 1462 rules in 9426 ms. Remains 8645 /9376 variables (removed 731) and now considering 16564/17308 (removed 744) transitions.
// Phase 1: matrix 16564 rows 8645 cols
[2022-05-16 00:18:18] [INFO ] Computed 181 place invariants in 109 ms
[2022-05-16 00:18:18] [INFO ] Implicit Places using invariants in 876 ms returned []
Implicit Place search using SMT only with invariants took 878 ms to find 0 implicit places.
// Phase 1: matrix 16564 rows 8645 cols
[2022-05-16 00:18:18] [INFO ] Computed 181 place invariants in 103 ms
[2022-05-16 00:18:19] [INFO ] Dead Transitions using invariants and state equation in 877 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8645/9376 places, 16564/17308 transitions.
Finished structural reductions, in 1 iterations. Remains : 8645/9376 places, 16564/17308 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s161 1) (GEQ s419 1)), p1:(GEQ s2310 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 795 steps with 0 reset in 21 ms.
FORMULA CANConstruction-PT-090-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-04 finished in 11337 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 9376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9376/9376 places, 17308/17308 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 9376 transition count 16679
Reduce places removed 629 places and 0 transitions.
Iterating post reduction 1 with 629 rules applied. Total rules applied 1258 place count 8747 transition count 16679
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1272 place count 8733 transition count 16651
Iterating global reduction 2 with 14 rules applied. Total rules applied 1286 place count 8733 transition count 16651
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 16 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1466 place count 8643 transition count 16561
Applied a total of 1466 rules in 8153 ms. Remains 8643 /9376 variables (removed 733) and now considering 16561/17308 (removed 747) transitions.
// Phase 1: matrix 16561 rows 8643 cols
[2022-05-16 00:18:28] [INFO ] Computed 181 place invariants in 115 ms
[2022-05-16 00:18:28] [INFO ] Implicit Places using invariants in 871 ms returned []
Implicit Place search using SMT only with invariants took 880 ms to find 0 implicit places.
// Phase 1: matrix 16561 rows 8643 cols
[2022-05-16 00:18:28] [INFO ] Computed 181 place invariants in 101 ms
[2022-05-16 00:18:29] [INFO ] Dead Transitions using invariants and state equation in 858 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8643/9376 places, 16561/17308 transitions.
Finished structural reductions, in 1 iterations. Remains : 8643/9376 places, 16561/17308 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s130 1) (GEQ s4481 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1140 steps with 1 reset in 31 ms.
FORMULA CANConstruction-PT-090-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-05 finished in 10002 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G((F(p1)&&p0))))))'
Support contains 3 out of 9376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9376/9376 places, 17308/17308 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9376 transition count 16680
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 8748 transition count 16680
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 8748 transition count 16679
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 8747 transition count 16679
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1271 place count 8734 transition count 16653
Iterating global reduction 2 with 13 rules applied. Total rules applied 1284 place count 8734 transition count 16653
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1462 place count 8645 transition count 16564
Applied a total of 1462 rules in 8453 ms. Remains 8645 /9376 variables (removed 731) and now considering 16564/17308 (removed 744) transitions.
// Phase 1: matrix 16564 rows 8645 cols
[2022-05-16 00:18:38] [INFO ] Computed 181 place invariants in 106 ms
[2022-05-16 00:18:39] [INFO ] Implicit Places using invariants in 925 ms returned []
Implicit Place search using SMT only with invariants took 926 ms to find 0 implicit places.
// Phase 1: matrix 16564 rows 8645 cols
[2022-05-16 00:18:39] [INFO ] Computed 181 place invariants in 117 ms
[2022-05-16 00:18:40] [INFO ] Dead Transitions using invariants and state equation in 919 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8645/9376 places, 16564/17308 transitions.
Finished structural reductions, in 1 iterations. Remains : 8645/9376 places, 16564/17308 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s412 1) (GEQ s432 1)), p1:(GEQ s2464 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 815 steps with 0 reset in 26 ms.
FORMULA CANConstruction-PT-090-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-06 finished in 10452 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(!p0 U G(p1))))'
Support contains 3 out of 9376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9376/9376 places, 17308/17308 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 9363 transition count 17282
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 9363 transition count 17282
Applied a total of 26 rules in 6310 ms. Remains 9363 /9376 variables (removed 13) and now considering 17282/17308 (removed 26) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2022-05-16 00:18:46] [INFO ] Computed 181 place invariants in 140 ms
[2022-05-16 00:18:47] [INFO ] Implicit Places using invariants in 990 ms returned []
Implicit Place search using SMT only with invariants took 992 ms to find 0 implicit places.
// Phase 1: matrix 17282 rows 9363 cols
[2022-05-16 00:18:47] [INFO ] Computed 181 place invariants in 113 ms
[2022-05-16 00:18:48] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9376 places, 17282/17308 transitions.
Finished structural reductions, in 1 iterations. Remains : 9363/9376 places, 17282/17308 transitions.
Stuttering acceptance computed with spot in 346 ms :[(NOT p1), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p1:(GEQ s6998 1), p0:(AND (GEQ s90 1) (GEQ s4384 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1516 steps with 0 reset in 28 ms.
FORMULA CANConstruction-PT-090-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-07 finished in 8688 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 9376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9376/9376 places, 17308/17308 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9376 transition count 16680
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 8748 transition count 16680
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 8748 transition count 16679
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 8747 transition count 16679
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1272 place count 8733 transition count 16651
Iterating global reduction 2 with 14 rules applied. Total rules applied 1286 place count 8733 transition count 16651
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1464 place count 8644 transition count 16562
Applied a total of 1464 rules in 8370 ms. Remains 8644 /9376 variables (removed 732) and now considering 16562/17308 (removed 746) transitions.
// Phase 1: matrix 16562 rows 8644 cols
[2022-05-16 00:18:57] [INFO ] Computed 181 place invariants in 126 ms
[2022-05-16 00:18:58] [INFO ] Implicit Places using invariants in 910 ms returned []
Implicit Place search using SMT only with invariants took 914 ms to find 0 implicit places.
// Phase 1: matrix 16562 rows 8644 cols
[2022-05-16 00:18:58] [INFO ] Computed 181 place invariants in 115 ms
[2022-05-16 00:18:59] [INFO ] Dead Transitions using invariants and state equation in 908 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8644/9376 places, 16562/17308 transitions.
Finished structural reductions, in 1 iterations. Remains : 8644/9376 places, 16562/17308 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s503 1) (LT s509 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 124 reset in 2521 ms.
Stack based approach found an accepted trace after 10299 steps with 12 reset with depth 730 and stack size 728 in 263 ms.
FORMULA CANConstruction-PT-090-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-08 finished in 13059 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p1)))'
Support contains 3 out of 9376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9376/9376 places, 17308/17308 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 9363 transition count 17282
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 9363 transition count 17282
Applied a total of 26 rules in 5900 ms. Remains 9363 /9376 variables (removed 13) and now considering 17282/17308 (removed 26) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2022-05-16 00:19:08] [INFO ] Computed 181 place invariants in 135 ms
[2022-05-16 00:19:08] [INFO ] Implicit Places using invariants in 950 ms returned []
Implicit Place search using SMT only with invariants took 952 ms to find 0 implicit places.
// Phase 1: matrix 17282 rows 9363 cols
[2022-05-16 00:19:09] [INFO ] Computed 181 place invariants in 108 ms
[2022-05-16 00:19:09] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9376 places, 17282/17308 transitions.
Finished structural reductions, in 1 iterations. Remains : 9363/9376 places, 17282/17308 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s137 1) (GEQ s356 1)), p0:(GEQ s3355 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-090-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-09 finished in 7999 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Support contains 1 out of 9376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9376/9376 places, 17308/17308 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9376 transition count 16678
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8746 transition count 16678
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1273 place count 8733 transition count 16652
Iterating global reduction 2 with 13 rules applied. Total rules applied 1286 place count 8733 transition count 16652
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1466 place count 8643 transition count 16562
Applied a total of 1466 rules in 8342 ms. Remains 8643 /9376 variables (removed 733) and now considering 16562/17308 (removed 746) transitions.
// Phase 1: matrix 16562 rows 8643 cols
[2022-05-16 00:19:18] [INFO ] Computed 181 place invariants in 106 ms
[2022-05-16 00:19:19] [INFO ] Implicit Places using invariants in 880 ms returned []
Implicit Place search using SMT only with invariants took 881 ms to find 0 implicit places.
// Phase 1: matrix 16562 rows 8643 cols
[2022-05-16 00:19:19] [INFO ] Computed 181 place invariants in 103 ms
[2022-05-16 00:19:20] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8643/9376 places, 16562/17308 transitions.
Finished structural reductions, in 1 iterations. Remains : 8643/9376 places, 16562/17308 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s4069 1)], 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 826 steps with 0 reset in 19 ms.
FORMULA CANConstruction-PT-090-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-10 finished in 10194 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U (G(F(!p0))||(F(!p0)&&F(G(!p1))))))'
Support contains 4 out of 9376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9376/9376 places, 17308/17308 transitions.
Drop transitions removed 626 transitions
Trivial Post-agglo rules discarded 626 transitions
Performed 626 trivial Post agglomeration. Transition count delta: 626
Iterating post reduction 0 with 626 rules applied. Total rules applied 626 place count 9376 transition count 16682
Reduce places removed 626 places and 0 transitions.
Iterating post reduction 1 with 626 rules applied. Total rules applied 1252 place count 8750 transition count 16682
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1252 place count 8750 transition count 16680
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1256 place count 8748 transition count 16680
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1270 place count 8734 transition count 16652
Iterating global reduction 2 with 14 rules applied. Total rules applied 1284 place count 8734 transition count 16652
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 4 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 1460 place count 8646 transition count 16564
Applied a total of 1460 rules in 8175 ms. Remains 8646 /9376 variables (removed 730) and now considering 16564/17308 (removed 744) transitions.
// Phase 1: matrix 16564 rows 8646 cols
[2022-05-16 00:19:28] [INFO ] Computed 181 place invariants in 107 ms
[2022-05-16 00:19:29] [INFO ] Implicit Places using invariants in 892 ms returned []
Implicit Place search using SMT only with invariants took 893 ms to find 0 implicit places.
// Phase 1: matrix 16564 rows 8646 cols
[2022-05-16 00:19:29] [INFO ] Computed 181 place invariants in 109 ms
[2022-05-16 00:19:30] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8646/9376 places, 16564/17308 transitions.
Finished structural reductions, in 1 iterations. Remains : 8646/9376 places, 16564/17308 transitions.
Stuttering acceptance computed with spot in 148 ms :[p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s276 1) (GEQ s336 1)), p1:(AND (GEQ s160 1) (GEQ s488 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 124 reset in 2211 ms.
Product exploration explored 100000 steps with 124 reset in 2202 ms.
Computed a total of 269 stabilizing places and 270 stable transitions
Computed a total of 269 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 397 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16564 rows 8646 cols
[2022-05-16 00:19:35] [INFO ] Computed 181 place invariants in 104 ms
[2022-05-16 00:19:36] [INFO ] [Real]Absence check using 91 positive place invariants in 200 ms returned sat
[2022-05-16 00:19:36] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 107 ms returned sat
[2022-05-16 00:19:47] [INFO ] After 10036ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 00:19:47] [INFO ] State equation strengthened by 16198 read => feed constraints.
[2022-05-16 00:19:49] [INFO ] After 1950ms SMT Verify possible using 16198 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:19:49] [INFO ] After 13369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:19:50] [INFO ] [Nat]Absence check using 91 positive place invariants in 177 ms returned sat
[2022-05-16 00:19:50] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 108 ms returned sat
[2022-05-16 00:20:00] [INFO ] After 10358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 00:20:02] [INFO ] After 1747ms SMT Verify possible using 16198 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 00:20:03] [INFO ] After 2529ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 530 ms.
[2022-05-16 00:20:03] [INFO ] After 14650ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 308 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 101 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 4 out of 8646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8646/8646 places, 16564/16564 transitions.
Applied a total of 0 rules in 2821 ms. Remains 8646 /8646 variables (removed 0) and now considering 16564/16564 (removed 0) transitions.
// Phase 1: matrix 16564 rows 8646 cols
[2022-05-16 00:20:07] [INFO ] Computed 181 place invariants in 108 ms
[2022-05-16 00:20:08] [INFO ] Implicit Places using invariants in 884 ms returned []
Implicit Place search using SMT only with invariants took 885 ms to find 0 implicit places.
// Phase 1: matrix 16564 rows 8646 cols
[2022-05-16 00:20:08] [INFO ] Computed 181 place invariants in 112 ms
[2022-05-16 00:20:08] [INFO ] Dead Transitions using invariants and state equation in 891 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8646/8646 places, 16564/16564 transitions.
Computed a total of 269 stabilizing places and 270 stable transitions
Computed a total of 269 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16564 rows 8646 cols
[2022-05-16 00:20:09] [INFO ] Computed 181 place invariants in 114 ms
[2022-05-16 00:20:10] [INFO ] [Real]Absence check using 91 positive place invariants in 198 ms returned sat
[2022-05-16 00:20:10] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 120 ms returned sat
[2022-05-16 00:20:21] [INFO ] After 10899ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 00:20:22] [INFO ] State equation strengthened by 16198 read => feed constraints.
[2022-05-16 00:20:24] [INFO ] After 1961ms SMT Verify possible using 16198 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:20:24] [INFO ] After 14336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:20:25] [INFO ] [Nat]Absence check using 91 positive place invariants in 182 ms returned sat
[2022-05-16 00:20:25] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 108 ms returned sat
[2022-05-16 00:20:37] [INFO ] After 12253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 00:20:39] [INFO ] After 1927ms SMT Verify possible using 16198 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 00:20:40] [INFO ] After 2712ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 494 ms.
[2022-05-16 00:20:40] [INFO ] After 16661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 257 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 127 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 123 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 102 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 125 reset in 2256 ms.
Product exploration explored 100000 steps with 125 reset in 2456 ms.
Built C files in :
/tmp/ltsmin16247384321326496611
[2022-05-16 00:20:46] [INFO ] Too many transitions (16564) to apply POR reductions. Disabling POR matrices.
[2022-05-16 00:20:46] [INFO ] Built C files in 191ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16247384321326496611
Running compilation step : cd /tmp/ltsmin16247384321326496611;'/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/ltsmin16247384321326496611;'/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/ltsmin16247384321326496611;'/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 4 out of 8646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8646/8646 places, 16564/16564 transitions.
Applied a total of 0 rules in 2965 ms. Remains 8646 /8646 variables (removed 0) and now considering 16564/16564 (removed 0) transitions.
// Phase 1: matrix 16564 rows 8646 cols
[2022-05-16 00:20:52] [INFO ] Computed 181 place invariants in 110 ms
[2022-05-16 00:20:53] [INFO ] Implicit Places using invariants in 955 ms returned []
Implicit Place search using SMT only with invariants took 963 ms to find 0 implicit places.
// Phase 1: matrix 16564 rows 8646 cols
[2022-05-16 00:20:53] [INFO ] Computed 181 place invariants in 106 ms
[2022-05-16 00:20:54] [INFO ] Dead Transitions using invariants and state equation in 984 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8646/8646 places, 16564/16564 transitions.
Built C files in :
/tmp/ltsmin3951519034466466138
[2022-05-16 00:20:54] [INFO ] Too many transitions (16564) to apply POR reductions. Disabling POR matrices.
[2022-05-16 00:20:54] [INFO ] Built C files in 140ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3951519034466466138
Running compilation step : cd /tmp/ltsmin3951519034466466138;'/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/ltsmin3951519034466466138;'/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/ltsmin3951519034466466138;'/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-16 00:20:58] [INFO ] Flatten gal took : 461 ms
[2022-05-16 00:20:59] [INFO ] Flatten gal took : 447 ms
[2022-05-16 00:20:59] [INFO ] Time to serialize gal into /tmp/LTL16630771156821744771.gal : 177 ms
[2022-05-16 00:20:59] [INFO ] Time to serialize properties into /tmp/LTL8712177326822894414.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/LTL16630771156821744771.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8712177326822894414.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/LTL1663077...267
Read 1 LTL properties
Checking formula 0 : !(((F(!("((Node45Request>=1)&&(Node55IsInserted>=1))")))U((G(F(!("((Node45Request>=1)&&(Node55IsInserted>=1))"))))||((F(!("((Node45Req...253
Formula 0 simplified : !(F!"((Node45Request>=1)&&(Node55IsInserted>=1))" U (GF!"((Node45Request>=1)&&(Node55IsInserted>=1))" | (F!"((Node45Request>=1)&&(No...229
Detected timeout of ITS tools.
[2022-05-16 00:21:15] [INFO ] Flatten gal took : 501 ms
[2022-05-16 00:21:15] [INFO ] Applying decomposition
[2022-05-16 00:21:15] [INFO ] Flatten gal took : 415 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/graph8698508320061490324.txt' '-o' '/tmp/graph8698508320061490324.bin' '-w' '/tmp/graph8698508320061490324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8698508320061490324.bin' '-l' '-1' '-v' '-w' '/tmp/graph8698508320061490324.weights' '-q' '0' '-e' '0.001'
[2022-05-16 00:21:16] [INFO ] Decomposing Gal with order
[2022-05-16 00:21:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 00:21:20] [INFO ] Removed a total of 16007 redundant transitions.
[2022-05-16 00:21:20] [INFO ] Flatten gal took : 3210 ms
[2022-05-16 00:21:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 16020 labels/synchronizations in 2958 ms.
[2022-05-16 00:21:24] [INFO ] Time to serialize gal into /tmp/LTL12034907507295588873.gal : 98 ms
[2022-05-16 00:21:24] [INFO ] Time to serialize properties into /tmp/LTL10784166715761477907.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/LTL12034907507295588873.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10784166715761477907.ltl' '-c' '-stutter-deadlock'

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/LTL1203490...247
Read 1 LTL properties
Checking formula 0 : !(((F(!("((u46.Node45Request>=1)&&(u18.Node55IsInserted>=1))")))U((G(F(!("((u46.Node45Request>=1)&&(u18.Node55IsInserted>=1))"))))||((...289
Formula 0 simplified : !(F!"((u46.Node45Request>=1)&&(u18.Node55IsInserted>=1))" U (GF!"((u46.Node45Request>=1)&&(u18.Node55IsInserted>=1))" | (F!"((u46.No...265
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3620393244824697785
[2022-05-16 00:21:39] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3620393244824697785
Running compilation step : cd /tmp/ltsmin3620393244824697785;'/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/ltsmin3620393244824697785;'/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/ltsmin3620393244824697785;'/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)
Treatment of property CANConstruction-PT-090-LTLFireability-11 finished in 142271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(p1) U p2)))'
Support contains 4 out of 9376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9376/9376 places, 17308/17308 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 9376 transition count 16679
Reduce places removed 629 places and 0 transitions.
Iterating post reduction 1 with 629 rules applied. Total rules applied 1258 place count 8747 transition count 16679
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1270 place count 8735 transition count 16655
Iterating global reduction 2 with 12 rules applied. Total rules applied 1282 place count 8735 transition count 16655
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1462 place count 8645 transition count 16565
Applied a total of 1462 rules in 9481 ms. Remains 8645 /9376 variables (removed 731) and now considering 16565/17308 (removed 743) transitions.
// Phase 1: matrix 16565 rows 8645 cols
[2022-05-16 00:21:52] [INFO ] Computed 181 place invariants in 113 ms
[2022-05-16 00:21:52] [INFO ] Implicit Places using invariants in 922 ms returned []
Implicit Place search using SMT only with invariants took 923 ms to find 0 implicit places.
// Phase 1: matrix 16565 rows 8645 cols
[2022-05-16 00:21:53] [INFO ] Computed 181 place invariants in 113 ms
[2022-05-16 00:21:53] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8645/9376 places, 16565/17308 transitions.
Finished structural reductions, in 1 iterations. Remains : 8645/9376 places, 16565/17308 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s4284 1), p1:(GEQ s6218 1), p0:(AND (GEQ s334 1) (GEQ s4337 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 858 steps with 0 reset in 19 ms.
FORMULA CANConstruction-PT-090-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-13 finished in 11375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))&&G(p1))))'
Support contains 4 out of 9376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9376/9376 places, 17308/17308 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 9364 transition count 17284
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 9364 transition count 17284
Applied a total of 24 rules in 7375 ms. Remains 9364 /9376 variables (removed 12) and now considering 17284/17308 (removed 24) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2022-05-16 00:22:01] [INFO ] Computed 181 place invariants in 118 ms
[2022-05-16 00:22:02] [INFO ] Implicit Places using invariants in 865 ms returned []
Implicit Place search using SMT only with invariants took 866 ms to find 0 implicit places.
// Phase 1: matrix 17284 rows 9364 cols
[2022-05-16 00:22:02] [INFO ] Computed 181 place invariants in 123 ms
[2022-05-16 00:22:02] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9364/9376 places, 17284/17308 transitions.
Finished structural reductions, in 1 iterations. Remains : 9364/9376 places, 17284/17308 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (LT s3949 1) (LT s8288 1)), p0:(AND (GEQ s426 1) (GEQ s7524 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1642 steps with 0 reset in 28 ms.
FORMULA CANConstruction-PT-090-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-14 finished in 9301 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Support contains 4 out of 9376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9376/9376 places, 17308/17308 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 9364 transition count 17284
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 9364 transition count 17284
Applied a total of 24 rules in 6628 ms. Remains 9364 /9376 variables (removed 12) and now considering 17284/17308 (removed 24) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2022-05-16 00:22:09] [INFO ] Computed 181 place invariants in 109 ms
[2022-05-16 00:22:10] [INFO ] Implicit Places using invariants in 839 ms returned []
Implicit Place search using SMT only with invariants took 840 ms to find 0 implicit places.
// Phase 1: matrix 17284 rows 9364 cols
[2022-05-16 00:22:10] [INFO ] Computed 181 place invariants in 123 ms
[2022-05-16 00:22:11] [INFO ] Dead Transitions using invariants and state equation in 866 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9364/9376 places, 17284/17308 transitions.
Finished structural reductions, in 1 iterations. Remains : 9364/9376 places, 17284/17308 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s6305 1), p0:(OR (LT s8634 1) (LT s222 1) (LT s224 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 62 reset in 1719 ms.
Product exploration explored 100000 steps with 61 reset in 1760 ms.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p1)), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 320 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 17284 rows 9364 cols
[2022-05-16 00:22:16] [INFO ] Computed 181 place invariants in 112 ms
[2022-05-16 00:22:17] [INFO ] [Real]Absence check using 91 positive place invariants in 225 ms returned sat
[2022-05-16 00:22:17] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 109 ms returned sat
[2022-05-16 00:22:28] [INFO ] After 12381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:22:29] [INFO ] [Nat]Absence check using 91 positive place invariants in 215 ms returned sat
[2022-05-16 00:22:29] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 112 ms returned sat
[2022-05-16 00:22:41] [INFO ] After 11758ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 00:22:41] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2022-05-16 00:22:44] [INFO ] After 2479ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 00:22:45] [INFO ] After 3348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 593 ms.
[2022-05-16 00:22:45] [INFO ] After 17239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 9364 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 9364/9364 places, 17284/17284 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9364 transition count 16656
Reduce places removed 628 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 629 rules applied. Total rules applied 1257 place count 8736 transition count 16655
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1258 place count 8735 transition count 16655
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1258 place count 8735 transition count 16654
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1260 place count 8734 transition count 16654
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1261 place count 8733 transition count 16652
Iterating global reduction 3 with 1 rules applied. Total rules applied 1262 place count 8733 transition count 16652
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1440 place count 8644 transition count 16563
Free-agglomeration rule applied 177 times.
Iterating global reduction 3 with 177 rules applied. Total rules applied 1617 place count 8644 transition count 16386
Reduce places removed 177 places and 0 transitions.
Iterating post reduction 3 with 177 rules applied. Total rules applied 1794 place count 8467 transition count 16386
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1796 place count 8467 transition count 16386
Applied a total of 1796 rules in 14308 ms. Remains 8467 /9364 variables (removed 897) and now considering 16386/17284 (removed 898) transitions.
Finished structural reductions, in 1 iterations. Remains : 8467/9364 places, 16386/17284 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 98851 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98851 steps, saw 90869 distinct states, run finished after 3004 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16386 rows 8467 cols
[2022-05-16 00:23:03] [INFO ] Computed 181 place invariants in 112 ms
[2022-05-16 00:23:04] [INFO ] [Real]Absence check using 91 positive place invariants in 151 ms returned sat
[2022-05-16 00:23:04] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 87 ms returned sat
[2022-05-16 00:23:14] [INFO ] After 9774ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 00:23:14] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2022-05-16 00:23:16] [INFO ] After 1685ms SMT Verify possible using 16200 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:23:16] [INFO ] After 12844ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:23:17] [INFO ] [Nat]Absence check using 91 positive place invariants in 151 ms returned sat
[2022-05-16 00:23:17] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 88 ms returned sat
[2022-05-16 00:23:27] [INFO ] After 9997ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 00:23:29] [INFO ] After 1800ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 00:23:30] [INFO ] After 2643ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 637 ms.
[2022-05-16 00:23:30] [INFO ] After 14379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p1)), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND p0 p1)), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 383 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 9364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9364/9364 places, 17284/17284 transitions.
Applied a total of 0 rules in 3089 ms. Remains 9364 /9364 variables (removed 0) and now considering 17284/17284 (removed 0) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2022-05-16 00:23:34] [INFO ] Computed 181 place invariants in 114 ms
[2022-05-16 00:23:35] [INFO ] Implicit Places using invariants in 864 ms returned []
Implicit Place search using SMT only with invariants took 866 ms to find 0 implicit places.
// Phase 1: matrix 17284 rows 9364 cols
[2022-05-16 00:23:35] [INFO ] Computed 181 place invariants in 118 ms
[2022-05-16 00:23:36] [INFO ] Dead Transitions using invariants and state equation in 870 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9364/9364 places, 17284/17284 transitions.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 297 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 81852 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81852 steps, saw 80633 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 17284 rows 9364 cols
[2022-05-16 00:23:40] [INFO ] Computed 181 place invariants in 121 ms
[2022-05-16 00:23:41] [INFO ] [Real]Absence check using 91 positive place invariants in 234 ms returned sat
[2022-05-16 00:23:42] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 125 ms returned sat
[2022-05-16 00:23:59] [INFO ] After 17686ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2022-05-16 00:24:00] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2022-05-16 00:24:02] [INFO ] After 2148ms SMT Verify possible using 16110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 00:24:02] [INFO ] After 21759ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 00:24:03] [INFO ] [Nat]Absence check using 91 positive place invariants in 248 ms returned sat
[2022-05-16 00:24:03] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 138 ms returned sat
[2022-05-16 00:24:22] [INFO ] After 18260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 00:24:27] [INFO ] After 4592ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-16 00:24:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:24:27] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 3 properties in 22 ms.
Support contains 3 out of 9364 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 9364/9364 places, 17284/17284 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9364 transition count 16656
Reduce places removed 628 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 629 rules applied. Total rules applied 1257 place count 8736 transition count 16655
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1258 place count 8735 transition count 16655
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1258 place count 8735 transition count 16654
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1260 place count 8734 transition count 16654
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1261 place count 8733 transition count 16652
Iterating global reduction 3 with 1 rules applied. Total rules applied 1262 place count 8733 transition count 16652
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1440 place count 8644 transition count 16563
Free-agglomeration rule applied 177 times.
Iterating global reduction 3 with 177 rules applied. Total rules applied 1617 place count 8644 transition count 16386
Reduce places removed 177 places and 0 transitions.
Iterating post reduction 3 with 177 rules applied. Total rules applied 1794 place count 8467 transition count 16386
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1796 place count 8467 transition count 16386
Applied a total of 1796 rules in 13609 ms. Remains 8467 /9364 variables (removed 897) and now considering 16386/17284 (removed 898) transitions.
Finished structural reductions, in 1 iterations. Remains : 8467/9364 places, 16386/17284 transitions.
Finished random walk after 1062 steps, including 1 resets, run visited all 1 properties in 35 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND p0 p1)), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 473 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 62 reset in 1768 ms.
Product exploration explored 100000 steps with 61 reset in 1854 ms.
Built C files in :
/tmp/ltsmin7820786255721647514
[2022-05-16 00:24:45] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7820786255721647514
Running compilation step : cd /tmp/ltsmin7820786255721647514;'/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/ltsmin7820786255721647514;'/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/ltsmin7820786255721647514;'/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 4 out of 9364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9364/9364 places, 17284/17284 transitions.
Applied a total of 0 rules in 3171 ms. Remains 9364 /9364 variables (removed 0) and now considering 17284/17284 (removed 0) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2022-05-16 00:24:51] [INFO ] Computed 181 place invariants in 127 ms
[2022-05-16 00:24:52] [INFO ] Implicit Places using invariants in 980 ms returned []
Implicit Place search using SMT only with invariants took 982 ms to find 0 implicit places.
// Phase 1: matrix 17284 rows 9364 cols
[2022-05-16 00:24:52] [INFO ] Computed 181 place invariants in 110 ms
[2022-05-16 00:24:53] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9364/9364 places, 17284/17284 transitions.
Built C files in :
/tmp/ltsmin3448297268219257366
[2022-05-16 00:24:54] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3448297268219257366
Running compilation step : cd /tmp/ltsmin3448297268219257366;'/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/ltsmin3448297268219257366;'/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/ltsmin3448297268219257366;'/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-16 00:24:57] [INFO ] Flatten gal took : 502 ms
[2022-05-16 00:24:58] [INFO ] Flatten gal took : 488 ms
[2022-05-16 00:24:58] [INFO ] Time to serialize gal into /tmp/LTL15198105688165188764.gal : 82 ms
[2022-05-16 00:24:58] [INFO ] Time to serialize properties into /tmp/LTL4710284655178759139.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/LTL15198105688165188764.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4710284655178759139.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/LTL1519810...267
Read 1 LTL properties
Checking formula 0 : !((G((X("(((Node81GiveAnswer71<1)||(Node15WaitAnswer<1))||(Node15NOshare<1))"))||("(Node55GiveAnswer58>=1)"))))
Formula 0 simplified : !G("(Node55GiveAnswer58>=1)" | X"(((Node81GiveAnswer71<1)||(Node15WaitAnswer<1))||(Node15NOshare<1))")
Detected timeout of ITS tools.
[2022-05-16 00:25:13] [INFO ] Flatten gal took : 429 ms
[2022-05-16 00:25:13] [INFO ] Applying decomposition
[2022-05-16 00:25:14] [INFO ] Flatten gal took : 447 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/graph8919029360763970195.txt' '-o' '/tmp/graph8919029360763970195.bin' '-w' '/tmp/graph8919029360763970195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8919029360763970195.bin' '-l' '-1' '-v' '-w' '/tmp/graph8919029360763970195.weights' '-q' '0' '-e' '0.001'
[2022-05-16 00:25:15] [INFO ] Decomposing Gal with order
[2022-05-16 00:25:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 00:25:18] [INFO ] Removed a total of 16337 redundant transitions.
[2022-05-16 00:25:18] [INFO ] Flatten gal took : 2531 ms
[2022-05-16 00:25:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 31944 labels/synchronizations in 3186 ms.
[2022-05-16 00:25:22] [INFO ] Time to serialize gal into /tmp/LTL785744173709920149.gal : 208 ms
[2022-05-16 00:25:22] [INFO ] Time to serialize properties into /tmp/LTL6510560571356722140.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/LTL785744173709920149.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6510560571356722140.ltl' '-c' '-stutter-deadlock'

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/LTL7857441...244
Read 1 LTL properties
Checking formula 0 : !((G((X("(((i72.u359.Node81GiveAnswer71<1)||(i16.u61.Node15WaitAnswer<1))||(i16.u62.Node15NOshare<1))"))||("(i59.u236.Node55GiveAnswer...166
Formula 0 simplified : !G("(i59.u236.Node55GiveAnswer58>=1)" | X"(((i72.u359.Node81GiveAnswer71<1)||(i16.u61.Node15WaitAnswer<1))||(i16.u62.Node15NOshare<1...159
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2671476787044660194
[2022-05-16 00:25:37] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2671476787044660194
Running compilation step : cd /tmp/ltsmin2671476787044660194;'/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/ltsmin2671476787044660194;'/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/ltsmin2671476787044660194;'/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)
Treatment of property CANConstruction-PT-090-LTLFireability-15 finished in 217443 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U (G(F(!p0))||(F(!p0)&&F(G(!p1))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Found a SL insensitive property : CANConstruction-PT-090-LTLFireability-15
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 9376 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 9376/9376 places, 17308/17308 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9376 transition count 16680
Reduce places removed 628 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 629 rules applied. Total rules applied 1257 place count 8748 transition count 16679
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1258 place count 8747 transition count 16679
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1258 place count 8747 transition count 16678
Deduced a syphon composed of 1 places in 139 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1260 place count 8746 transition count 16678
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1272 place count 8734 transition count 16654
Iterating global reduction 3 with 12 rules applied. Total rules applied 1284 place count 8734 transition count 16654
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1462 place count 8645 transition count 16565
Applied a total of 1462 rules in 8786 ms. Remains 8645 /9376 variables (removed 731) and now considering 16565/17308 (removed 743) transitions.
// Phase 1: matrix 16565 rows 8645 cols
[2022-05-16 00:25:49] [INFO ] Computed 181 place invariants in 105 ms
[2022-05-16 00:25:50] [INFO ] Implicit Places using invariants in 803 ms returned []
Implicit Place search using SMT only with invariants took 803 ms to find 0 implicit places.
// Phase 1: matrix 16565 rows 8645 cols
[2022-05-16 00:25:50] [INFO ] Computed 181 place invariants in 107 ms
[2022-05-16 00:25:51] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 8645/9376 places, 16565/17308 transitions.
Finished structural reductions, in 1 iterations. Remains : 8645/9376 places, 16565/17308 transitions.
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s5586 1), p0:(OR (LT s7915 1) (LT s96 1) (LT s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 124 reset in 2588 ms.
Product exploration explored 100000 steps with 124 reset in 2606 ms.
Computed a total of 269 stabilizing places and 269 stable transitions
Computed a total of 269 stabilizing places and 269 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p1)), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 338 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 707 ms. (steps per millisecond=14 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 80742 steps, run timeout after 3003 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80742 steps, saw 79115 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 16565 rows 8645 cols
[2022-05-16 00:26:01] [INFO ] Computed 181 place invariants in 107 ms
[2022-05-16 00:26:02] [INFO ] [Real]Absence check using 91 positive place invariants in 170 ms returned sat
[2022-05-16 00:26:02] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 95 ms returned sat
[2022-05-16 00:26:26] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:26:28] [INFO ] [Nat]Absence check using 91 positive place invariants in 391 ms returned sat
[2022-05-16 00:26:28] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 226 ms returned sat
[2022-05-16 00:26:51] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 8645 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8645/8645 places, 16565/16565 transitions.
Free-agglomeration rule applied 175 times.
Iterating global reduction 0 with 175 rules applied. Total rules applied 175 place count 8645 transition count 16390
Reduce places removed 175 places and 0 transitions.
Iterating post reduction 0 with 175 rules applied. Total rules applied 350 place count 8470 transition count 16390
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 354 place count 8470 transition count 16390
Applied a total of 354 rules in 11638 ms. Remains 8470 /8645 variables (removed 175) and now considering 16390/16565 (removed 175) transitions.
Finished structural reductions, in 1 iterations. Remains : 8470/8645 places, 16390/16565 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 970 ms. (steps per millisecond=10 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16390 rows 8470 cols
[2022-05-16 00:27:04] [INFO ] Computed 181 place invariants in 246 ms
[2022-05-16 00:27:06] [INFO ] [Real]Absence check using 91 positive place invariants in 361 ms returned sat
[2022-05-16 00:27:06] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 220 ms returned sat
[2022-05-16 00:27:27] [INFO ] After 21214ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 00:27:27] [INFO ] State equation strengthened by 16201 read => feed constraints.
[2022-05-16 00:27:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:27:29] [INFO ] After 25024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 8470 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8470/8470 places, 16390/16390 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8469 transition count 16389
Applied a total of 2 rules in 5305 ms. Remains 8469 /8470 variables (removed 1) and now considering 16389/16390 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 8469/8470 places, 16389/16390 transitions.
Finished random walk after 4838 steps, including 7 resets, run visited all 1 properties in 121 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p1)), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND p0 p1)), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 389 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 54 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 8645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8645/8645 places, 16565/16565 transitions.
Applied a total of 0 rules in 2497 ms. Remains 8645 /8645 variables (removed 0) and now considering 16565/16565 (removed 0) transitions.
// Phase 1: matrix 16565 rows 8645 cols
[2022-05-16 00:27:37] [INFO ] Computed 181 place invariants in 98 ms
[2022-05-16 00:27:51] [INFO ] Implicit Places using invariants in 13450 ms returned []
Implicit Place search using SMT only with invariants took 13451 ms to find 0 implicit places.
// Phase 1: matrix 16565 rows 8645 cols
[2022-05-16 00:27:51] [INFO ] Computed 181 place invariants in 102 ms
[2022-05-16 00:27:51] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8645/8645 places, 16565/16565 transitions.
Computed a total of 269 stabilizing places and 269 stable transitions
Computed a total of 269 stabilizing places and 269 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 435 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16565 rows 8645 cols
[2022-05-16 00:27:53] [INFO ] Computed 181 place invariants in 108 ms
[2022-05-16 00:27:54] [INFO ] [Real]Absence check using 91 positive place invariants in 187 ms returned sat
[2022-05-16 00:27:54] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 111 ms returned sat
[2022-05-16 00:28:05] [INFO ] After 11046ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-16 00:28:05] [INFO ] State equation strengthened by 16199 read => feed constraints.
[2022-05-16 00:28:07] [INFO ] After 1791ms SMT Verify possible using 16199 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:28:07] [INFO ] After 14340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:28:08] [INFO ] [Nat]Absence check using 91 positive place invariants in 180 ms returned sat
[2022-05-16 00:28:08] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 105 ms returned sat
[2022-05-16 00:28:18] [INFO ] After 10052ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 00:28:21] [INFO ] After 2104ms SMT Verify possible using 16199 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 00:28:22] [INFO ] After 3554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1380 ms.
[2022-05-16 00:28:23] [INFO ] After 16338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 4 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND p0 p1)), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 390 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 125 reset in 3716 ms.
Product exploration explored 100000 steps with 122 reset in 5708 ms.
Built C files in :
/tmp/ltsmin11658320123745484428
[2022-05-16 00:28:34] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11658320123745484428
Running compilation step : cd /tmp/ltsmin11658320123745484428;'/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/ltsmin11658320123745484428;'/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/ltsmin11658320123745484428;'/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 4 out of 8645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8645/8645 places, 16565/16565 transitions.
Applied a total of 0 rules in 2509 ms. Remains 8645 /8645 variables (removed 0) and now considering 16565/16565 (removed 0) transitions.
// Phase 1: matrix 16565 rows 8645 cols
[2022-05-16 00:28:40] [INFO ] Computed 181 place invariants in 98 ms
[2022-05-16 00:28:41] [INFO ] Implicit Places using invariants in 843 ms returned []
Implicit Place search using SMT only with invariants took 845 ms to find 0 implicit places.
// Phase 1: matrix 16565 rows 8645 cols
[2022-05-16 00:28:41] [INFO ] Computed 181 place invariants in 100 ms
[2022-05-16 00:28:41] [INFO ] Dead Transitions using invariants and state equation in 847 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8645/8645 places, 16565/16565 transitions.
Built C files in :
/tmp/ltsmin17465074380329424414
[2022-05-16 00:28:42] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17465074380329424414
Running compilation step : cd /tmp/ltsmin17465074380329424414;'/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/ltsmin17465074380329424414;'/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/ltsmin17465074380329424414;'/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-16 00:28:45] [INFO ] Flatten gal took : 412 ms
[2022-05-16 00:28:46] [INFO ] Flatten gal took : 438 ms
[2022-05-16 00:28:46] [INFO ] Time to serialize gal into /tmp/LTL4854805629364781053.gal : 43 ms
[2022-05-16 00:28:46] [INFO ] Time to serialize properties into /tmp/LTL7283604417216478162.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/LTL4854805629364781053.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7283604417216478162.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/LTL4854805...266
Read 1 LTL properties
Checking formula 0 : !((G((X("(((Node81GiveAnswer71<1)||(Node15WaitAnswer<1))||(Node15NOshare<1))"))||("(Node55GiveAnswer58>=1)"))))
Formula 0 simplified : !G("(Node55GiveAnswer58>=1)" | X"(((Node81GiveAnswer71<1)||(Node15WaitAnswer<1))||(Node15NOshare<1))")
Detected timeout of ITS tools.
[2022-05-16 00:29:01] [INFO ] Flatten gal took : 410 ms
[2022-05-16 00:29:01] [INFO ] Applying decomposition
[2022-05-16 00:29:02] [INFO ] Flatten gal took : 713 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/graph13678866259556035891.txt' '-o' '/tmp/graph13678866259556035891.bin' '-w' '/tmp/graph13678866259556035891.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13678866259556035891.bin' '-l' '-1' '-v' '-w' '/tmp/graph13678866259556035891.weights' '-q' '0' '-e' '0.001'
[2022-05-16 00:29:04] [INFO ] Decomposing Gal with order
[2022-05-16 00:29:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 00:29:10] [INFO ] Removed a total of 16003 redundant transitions.
[2022-05-16 00:29:10] [INFO ] Flatten gal took : 5269 ms
[2022-05-16 00:29:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 16190 labels/synchronizations in 3803 ms.
[2022-05-16 00:29:15] [INFO ] Time to serialize gal into /tmp/LTL7841488797674590130.gal : 199 ms
[2022-05-16 00:29:15] [INFO ] Time to serialize properties into /tmp/LTL628243587786614977.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/LTL7841488797674590130.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL628243587786614977.ltl' '-c' '-stutter-deadlock'

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/LTL7841488...244
Read 1 LTL properties
Checking formula 0 : !((G((X("(((i90.u93.Node81GiveAnswer71<1)||(i0.u16.Node15WaitAnswer<1))||(u17.Node15NOshare<1))"))||("(i89.u92.Node55GiveAnswer58>=1)"...159
Formula 0 simplified : !G("(i89.u92.Node55GiveAnswer58>=1)" | X"(((i90.u93.Node81GiveAnswer71<1)||(i0.u16.Node15WaitAnswer<1))||(u17.Node15NOshare<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3300909186725519792
[2022-05-16 00:29:30] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3300909186725519792
Running compilation step : cd /tmp/ltsmin3300909186725519792;'/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/ltsmin3300909186725519792;'/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/ltsmin3300909186725519792;'/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)
Treatment of property CANConstruction-PT-090-LTLFireability-15 finished in 232599 ms.
[2022-05-16 00:29:33] [INFO ] Flatten gal took : 488 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7917085165065573961
[2022-05-16 00:29:34] [INFO ] Too many transitions (17308) to apply POR reductions. Disabling POR matrices.
[2022-05-16 00:29:34] [INFO ] Built C files in 174ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7917085165065573961
Running compilation step : cd /tmp/ltsmin7917085165065573961;'/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-16 00:29:34] [INFO ] Applying decomposition
[2022-05-16 00:29:35] [INFO ] Flatten gal took : 687 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/graph6579978614577992356.txt' '-o' '/tmp/graph6579978614577992356.bin' '-w' '/tmp/graph6579978614577992356.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6579978614577992356.bin' '-l' '-1' '-v' '-w' '/tmp/graph6579978614577992356.weights' '-q' '0' '-e' '0.001'
[2022-05-16 00:29:36] [INFO ] Decomposing Gal with order
[2022-05-16 00:29:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 00:29:39] [INFO ] Removed a total of 16337 redundant transitions.
[2022-05-16 00:29:40] [INFO ] Flatten gal took : 2916 ms
[2022-05-16 00:29:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 34778 labels/synchronizations in 4182 ms.
[2022-05-16 00:29:44] [INFO ] Time to serialize gal into /tmp/LTLFireability8943487838053523248.gal : 88 ms
[2022-05-16 00:29:44] [INFO ] Time to serialize properties into /tmp/LTLFireability2028546439169871448.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/LTLFireability8943487838053523248.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2028546439169871448.ltl' '-c' '-stutter-deadlock'

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/LTLFireabi...267
Read 2 LTL properties
Checking formula 0 : !(((F(!("((i46.u184.Node45Request>=1)&&(i89.u370.Node55IsInserted>=1))")))U((G(F(!("((i46.u184.Node45Request>=1)&&(i89.u370.Node55IsIn...325
Formula 0 simplified : !(F!"((i46.u184.Node45Request>=1)&&(i89.u370.Node55IsInserted>=1))" U (GF!"((i46.u184.Node45Request>=1)&&(i89.u370.Node55IsInserted>...301
Compilation finished in 202509 ms.
Running link step : cd /tmp/ltsmin7917085165065573961;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 364 ms.
Running LTSmin : cd /tmp/ltsmin7917085165065573961;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>(!(LTLAPp0==true)) U ([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&<>([](!(LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 00:54:30] [INFO ] Flatten gal took : 1821 ms
[2022-05-16 00:54:31] [INFO ] Time to serialize gal into /tmp/LTLFireability13893652654563979331.gal : 240 ms
[2022-05-16 00:54:31] [INFO ] Time to serialize properties into /tmp/LTLFireability4439621335020272557.ltl : 7 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/LTLFireability13893652654563979331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4439621335020272557.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/LTLFireabi...289
Read 2 LTL properties
Checking formula 0 : !(((F(!("((Node45Request>=1)&&(Node55IsInserted>=1))")))U((G(F(!("((Node45Request>=1)&&(Node55IsInserted>=1))"))))||((F(!("((Node45Req...253
Formula 0 simplified : !(F!"((Node45Request>=1)&&(Node55IsInserted>=1))" U (GF!"((Node45Request>=1)&&(Node55IsInserted>=1))" | (F!"((Node45Request>=1)&&(No...229
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin7917085165065573961;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>(!(LTLAPp0==true)) U ([](<>(!(LTLAPp0==true)))||(<>(!(LTLAPp0==true))&&<>([](!(LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7917085165065573961;'/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((LTLAPp2==true))||(LTLAPp3==true)))' '--buchi-type=spotba'

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="CANConstruction-PT-090"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-090, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918700556"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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