Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156900717.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S32C02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156900717
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 31M
-rw-r--r-- 1 mcc users 39K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 26K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 12 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 12 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 12 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 12 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 5.3K May 11 19:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 19:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 11 16:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 11 16:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 30M May 12 08:13 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 MultiCrashLeafsetExtension-PT-S32C02-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-15

=== Now, execution of the tool begins

BK_START 1621379094204

Running Version 0
[2021-05-18 23:04:59] [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]
[2021-05-18 23:04:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 23:05:00] [INFO ] Load time of PNML (sax parser for PT used): 768 ms
[2021-05-18 23:05:00] [INFO ] Transformed 13544 places.
[2021-05-18 23:05:00] [INFO ] Transformed 21807 transitions.
[2021-05-18 23:05:00] [INFO ] Parsed PT model containing 13544 places and 21807 transitions in 916 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2021-05-18 23:05:00] [INFO ] Initial state test concluded for 5 properties.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C02-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 13544 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 13544/13544 places, 21807/21807 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 13504 transition count 21807
Discarding 2104 places :
Symmetric choice reduction at 1 with 2104 rule applications. Total rules 2144 place count 11400 transition count 19703
Iterating global reduction 1 with 2104 rules applied. Total rules applied 4248 place count 11400 transition count 19703
Discarding 1972 places :
Symmetric choice reduction at 1 with 1972 rule applications. Total rules 6220 place count 9428 transition count 17731
Iterating global reduction 1 with 1972 rules applied. Total rules applied 8192 place count 9428 transition count 17731
Discarding 976 places :
Symmetric choice reduction at 1 with 976 rule applications. Total rules 9168 place count 8452 transition count 15779
Iterating global reduction 1 with 976 rules applied. Total rules applied 10144 place count 8452 transition count 15779
Applied a total of 10144 rules in 10768 ms. Remains 8452 /13544 variables (removed 5092) and now considering 15779/21807 (removed 6028) transitions.
[2021-05-18 23:05:11] [INFO ] Flow matrix only has 14723 transitions (discarded 1056 similar events)
// Phase 1: matrix 14723 rows 8452 cols
[2021-05-18 23:05:12] [INFO ] Computed 1293 place invariants in 1092 ms
[2021-05-18 23:05:13] [INFO ] Implicit Places using invariants in 2026 ms returned []
Implicit Place search using SMT only with invariants took 2050 ms to find 0 implicit places.
[2021-05-18 23:05:13] [INFO ] Flow matrix only has 14723 transitions (discarded 1056 similar events)
// Phase 1: matrix 14723 rows 8452 cols
[2021-05-18 23:05:14] [INFO ] Computed 1293 place invariants in 849 ms
[2021-05-18 23:05:14] [INFO ] Dead Transitions using invariants and state equation in 1680 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8452/13544 places, 15779/21807 transitions.
[2021-05-18 23:05:15] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-18 23:05:16] [INFO ] Flatten gal took : 779 ms
FORMULA MultiCrashLeafsetExtension-PT-S32C02-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 23:05:16] [INFO ] Flatten gal took : 566 ms
[2021-05-18 23:05:17] [INFO ] Input system was already deterministic with 15779 transitions.
Incomplete random walk after 100000 steps, including 4721 resets, run finished after 2186 ms. (steps per millisecond=45 ) properties (out of 31) seen :17
Running SMT prover for 14 properties.
[2021-05-18 23:05:19] [INFO ] Flow matrix only has 14723 transitions (discarded 1056 similar events)
// Phase 1: matrix 14723 rows 8452 cols
[2021-05-18 23:05:20] [INFO ] Computed 1293 place invariants in 832 ms
[2021-05-18 23:05:23] [INFO ] [Real]Absence check using 65 positive place invariants in 161 ms returned sat
[2021-05-18 23:05:23] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 447 ms returned sat
[2021-05-18 23:05:25] [INFO ] SMT Verify possible in real domain returnedunsat :3 sat :0 real:11
[2021-05-18 23:05:27] [INFO ] [Nat]Absence check using 65 positive place invariants in 153 ms returned sat
[2021-05-18 23:05:27] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 448 ms returned sat
[2021-05-18 23:05:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 23:05:47] [INFO ] [Nat]Absence check using state equation in 18315 ms returned unsat :0 sat :14
[2021-05-18 23:05:47] [INFO ] State equation strengthened by 6099 read => feed constraints.
[2021-05-18 23:05:47] [INFO ] [Nat]Added 6099 Read/Feed constraints in 298 ms returned sat
[2021-05-18 23:06:09] [INFO ] SMT Verify possible in nat domain returned unsat :9 sat :3
Successfully simplified 12 atomic propositions for a total of 12 simplifications.
[2021-05-18 23:06:09] [INFO ] Initial state test concluded for 2 properties.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C02-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C02-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((G(p2)||p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 8452 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8452/8452 places, 15779/15779 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 8440 transition count 15761
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 8440 transition count 15761
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 8434 transition count 15752
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 8434 transition count 15752
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 8431 transition count 15746
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 8431 transition count 15746
Applied a total of 42 rules in 7879 ms. Remains 8431 /8452 variables (removed 21) and now considering 15746/15779 (removed 33) transitions.
[2021-05-18 23:06:17] [INFO ] Flow matrix only has 14690 transitions (discarded 1056 similar events)
// Phase 1: matrix 14690 rows 8431 cols
[2021-05-18 23:06:17] [INFO ] Computed 1293 place invariants in 785 ms
[2021-05-18 23:06:18] [INFO ] Implicit Places using invariants in 1606 ms returned []
Implicit Place search using SMT only with invariants took 1607 ms to find 0 implicit places.
[2021-05-18 23:06:18] [INFO ] Flow matrix only has 14690 transitions (discarded 1056 similar events)
// Phase 1: matrix 14690 rows 8431 cols
[2021-05-18 23:06:19] [INFO ] Computed 1293 place invariants in 807 ms
[2021-05-18 23:06:20] [INFO ] Dead Transitions using invariants and state equation in 1626 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8431/8452 places, 15746/15779 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1076 1) (GEQ s7216 1)), p1:(OR (LT s5464 1) (LT s5703 1)), p2:(LT s4498 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-00 finished in 11445 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 8452 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8452/8452 places, 15779/15779 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 8452 transition count 15775
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 8448 transition count 15775
Performed 134 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 134 Pre rules applied. Total rules applied 8 place count 8448 transition count 15641
Deduced a syphon composed of 134 places in 12 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 276 place count 8314 transition count 15641
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 284 place count 8306 transition count 15629
Iterating global reduction 2 with 8 rules applied. Total rules applied 292 place count 8306 transition count 15629
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 292 place count 8306 transition count 15627
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 296 place count 8304 transition count 15627
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 300 place count 8300 transition count 15619
Iterating global reduction 2 with 4 rules applied. Total rules applied 304 place count 8300 transition count 15619
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 16 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 374 place count 8265 transition count 15584
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 378 place count 8261 transition count 15580
Iterating global reduction 2 with 4 rules applied. Total rules applied 382 place count 8261 transition count 15580
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 382 place count 8261 transition count 15578
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 386 place count 8259 transition count 15578
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 390 place count 8255 transition count 15570
Iterating global reduction 2 with 4 rules applied. Total rules applied 394 place count 8255 transition count 15570
Applied a total of 394 rules in 11557 ms. Remains 8255 /8452 variables (removed 197) and now considering 15570/15779 (removed 209) transitions.
[2021-05-18 23:06:32] [INFO ] Flow matrix only has 14514 transitions (discarded 1056 similar events)
// Phase 1: matrix 14514 rows 8255 cols
[2021-05-18 23:06:32] [INFO ] Computed 1293 place invariants in 818 ms
[2021-05-18 23:06:33] [INFO ] Implicit Places using invariants in 1619 ms returned []
Implicit Place search using SMT only with invariants took 1619 ms to find 0 implicit places.
[2021-05-18 23:06:33] [INFO ] Flow matrix only has 14514 transitions (discarded 1056 similar events)
// Phase 1: matrix 14514 rows 8255 cols
[2021-05-18 23:06:34] [INFO ] Computed 1293 place invariants in 860 ms
[2021-05-18 23:06:35] [INFO ] Dead Transitions using invariants and state equation in 1660 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8255/8452 places, 15570/15779 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s6429 1) (GEQ s8254 1)), p0:(AND (GEQ s5333 1) (GEQ s8184 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 14 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-01 finished in 14943 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)||G((F(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 8452 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8452/8452 places, 15779/15779 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 8438 transition count 15759
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 8438 transition count 15759
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 8430 transition count 15747
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 8430 transition count 15747
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 8426 transition count 15739
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 8426 transition count 15739
Applied a total of 52 rules in 6043 ms. Remains 8426 /8452 variables (removed 26) and now considering 15739/15779 (removed 40) transitions.
[2021-05-18 23:06:41] [INFO ] Flow matrix only has 14683 transitions (discarded 1056 similar events)
// Phase 1: matrix 14683 rows 8426 cols
[2021-05-18 23:06:42] [INFO ] Computed 1293 place invariants in 783 ms
[2021-05-18 23:06:43] [INFO ] Implicit Places using invariants in 1653 ms returned []
Implicit Place search using SMT only with invariants took 1656 ms to find 0 implicit places.
[2021-05-18 23:06:43] [INFO ] Flow matrix only has 14683 transitions (discarded 1056 similar events)
// Phase 1: matrix 14683 rows 8426 cols
[2021-05-18 23:06:43] [INFO ] Computed 1293 place invariants in 786 ms
[2021-05-18 23:06:44] [INFO ] Dead Transitions using invariants and state equation in 1622 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8426/8452 places, 15739/15779 transitions.
Stuttering acceptance computed with spot in 4404 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-04 automaton TGBA [mat=[[{ 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 p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s4272 1) (GEQ s5122 1) (GEQ s5123 1)), p0:(OR (AND (GEQ s3592 1) (GEQ s4695 1)) (AND (GEQ s925 1) (GEQ s4572 1))), p2:(AND (GEQ s2 1) (GEQ s4272 1) (GEQ s5122 1) (GEQ s5123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-04 finished in 13787 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (p1||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 8452 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8452/8452 places, 15779/15779 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 8440 transition count 15761
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 8440 transition count 15761
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 8434 transition count 15752
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 8434 transition count 15752
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 8431 transition count 15746
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 8431 transition count 15746
Applied a total of 42 rules in 6116 ms. Remains 8431 /8452 variables (removed 21) and now considering 15746/15779 (removed 33) transitions.
[2021-05-18 23:06:55] [INFO ] Flow matrix only has 14690 transitions (discarded 1056 similar events)
// Phase 1: matrix 14690 rows 8431 cols
[2021-05-18 23:06:56] [INFO ] Computed 1293 place invariants in 825 ms
[2021-05-18 23:06:56] [INFO ] Implicit Places using invariants in 1604 ms returned []
Implicit Place search using SMT only with invariants took 1605 ms to find 0 implicit places.
[2021-05-18 23:06:56] [INFO ] Flow matrix only has 14690 transitions (discarded 1056 similar events)
// Phase 1: matrix 14690 rows 8431 cols
[2021-05-18 23:06:57] [INFO ] Computed 1293 place invariants in 826 ms
[2021-05-18 23:06:58] [INFO ] Dead Transitions using invariants and state equation in 1638 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8431/8452 places, 15746/15779 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LT s5386 1), p0:(OR (LT s4558 1) (LT s4566 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 7170 ms.
Product exploration explored 100000 steps with 50000 reset in 7014 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 55 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 6994 ms.
Product exploration explored 100000 steps with 50000 reset in 7002 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 57 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 8431 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 8431/8431 places, 15746/15746 transitions.
Performed 134 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 134 Pre rules applied. Total rules applied 0 place count 8431 transition count 15747
Deduced a syphon composed of 134 places in 12 ms
Iterating global reduction 0 with 134 rules applied. Total rules applied 134 place count 8431 transition count 15747
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 168 places in 14 ms
Iterating global reduction 0 with 34 rules applied. Total rules applied 168 place count 8431 transition count 15747
Deduced a syphon composed of 168 places in 11 ms
Applied a total of 168 rules in 6605 ms. Remains 8431 /8431 variables (removed 0) and now considering 15747/15746 (removed -1) transitions.
[2021-05-18 23:07:33] [INFO ] Flow matrix only has 14691 transitions (discarded 1056 similar events)
// Phase 1: matrix 14691 rows 8431 cols
[2021-05-18 23:07:34] [INFO ] Computed 1293 place invariants in 910 ms
[2021-05-18 23:07:35] [INFO ] Dead Transitions using invariants and state equation in 1729 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8431/8431 places, 15747/15746 transitions.
Product exploration timeout after 18210 steps with 9105 reset in 10002 ms.
Product exploration timeout after 18310 steps with 9155 reset in 10006 ms.
[2021-05-18 23:07:56] [INFO ] Flatten gal took : 520 ms
[2021-05-18 23:07:57] [INFO ] Flatten gal took : 565 ms
[2021-05-18 23:07:57] [INFO ] Time to serialize gal into /tmp/LTL4106263352466125895.gal : 169 ms
[2021-05-18 23:07:57] [INFO ] Time to serialize properties into /tmp/LTL6504563079486295871.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4106263352466125895.gal, -t, CGAL, -LTL, /tmp/LTL6504563079486295871.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4106263352466125895.gal -t CGAL -LTL /tmp/LTL6504563079486295871.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((Node20HasAskedItsLeafSetToRx0ToReplaceNode30<1)||(LeafSetOfRx0IsSentToNode20<1))")U(("(Node25HasTheLeafSetOfRx1ToReplaceNode19<1)")||(G("((Node20HasAskedItsLeafSetToRx0ToReplaceNode30<1)||(LeafSetOfRx0IsSentToNode20<1))"))))))
Formula 0 simplified : !X("((Node20HasAskedItsLeafSetToRx0ToReplaceNode30<1)||(LeafSetOfRx0IsSentToNode20<1))" U ("(Node25HasTheLeafSetOfRx1ToReplaceNode19<1)" | G"((Node20HasAskedItsLeafSetToRx0ToReplaceNode30<1)||(LeafSetOfRx0IsSentToNode20<1))"))
Detected timeout of ITS tools.
[2021-05-18 23:08:13] [INFO ] Flatten gal took : 509 ms
[2021-05-18 23:08:13] [INFO ] Applying decomposition
[2021-05-18 23:08:13] [INFO ] Flatten gal took : 515 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10907644428661360513.txt, -o, /tmp/graph10907644428661360513.bin, -w, /tmp/graph10907644428661360513.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10907644428661360513.bin, -l, -1, -v, -w, /tmp/graph10907644428661360513.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 23:08:14] [INFO ] Decomposing Gal with order
[2021-05-18 23:08:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 23:08:19] [INFO ] Removed a total of 12733 redundant transitions.
[2021-05-18 23:08:19] [INFO ] Flatten gal took : 3286 ms
[2021-05-18 23:08:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 6583 labels/synchronizations in 1349 ms.
[2021-05-18 23:08:21] [INFO ] Time to serialize gal into /tmp/LTL17112256675756993935.gal : 105 ms
[2021-05-18 23:08:21] [INFO ] Time to serialize properties into /tmp/LTL13237754938163765418.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17112256675756993935.gal, -t, CGAL, -LTL, /tmp/LTL13237754938163765418.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17112256675756993935.gal -t CGAL -LTL /tmp/LTL13237754938163765418.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((i5.u24.Node20HasAskedItsLeafSetToRx0ToReplaceNode30<1)||(i5.u354.LeafSetOfRx0IsSentToNode20<1))")U(("(i6.u728.Node25HasTheLeafSetOfRx1ToReplaceNode19<1)")||(G("((i5.u24.Node20HasAskedItsLeafSetToRx0ToReplaceNode30<1)||(i5.u354.LeafSetOfRx0IsSentToNode20<1))"))))))
Formula 0 simplified : !X("((i5.u24.Node20HasAskedItsLeafSetToRx0ToReplaceNode30<1)||(i5.u354.LeafSetOfRx0IsSentToNode20<1))" U ("(i6.u728.Node25HasTheLeafSetOfRx1ToReplaceNode19<1)" | G"((i5.u24.Node20HasAskedItsLeafSetToRx0ToReplaceNode30<1)||(i5.u354.LeafSetOfRx0IsSentToNode20<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9633650690525595977
[2021-05-18 23:08:36] [INFO ] Built C files in 173ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9633650690525595977
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9633650690525595977]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9633650690525595977] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9633650690525595977] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-06 finished in 108750 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 8452 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8452/8452 places, 15779/15779 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 8452 transition count 15775
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 8448 transition count 15775
Performed 134 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 134 Pre rules applied. Total rules applied 8 place count 8448 transition count 15641
Deduced a syphon composed of 134 places in 13 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 276 place count 8314 transition count 15641
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 286 place count 8304 transition count 15625
Iterating global reduction 2 with 10 rules applied. Total rules applied 296 place count 8304 transition count 15625
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 296 place count 8304 transition count 15623
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 300 place count 8302 transition count 15623
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 304 place count 8298 transition count 15615
Iterating global reduction 2 with 4 rules applied. Total rules applied 308 place count 8298 transition count 15615
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 14 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 378 place count 8263 transition count 15580
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 382 place count 8259 transition count 15576
Iterating global reduction 2 with 4 rules applied. Total rules applied 386 place count 8259 transition count 15576
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 386 place count 8259 transition count 15574
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 390 place count 8257 transition count 15574
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 394 place count 8253 transition count 15566
Iterating global reduction 2 with 4 rules applied. Total rules applied 398 place count 8253 transition count 15566
Applied a total of 398 rules in 17150 ms. Remains 8253 /8452 variables (removed 199) and now considering 15566/15779 (removed 213) transitions.
[2021-05-18 23:08:55] [INFO ] Flow matrix only has 14510 transitions (discarded 1056 similar events)
// Phase 1: matrix 14510 rows 8253 cols
[2021-05-18 23:08:55] [INFO ] Computed 1293 place invariants in 808 ms
[2021-05-18 23:08:56] [INFO ] Implicit Places using invariants in 1625 ms returned []
Implicit Place search using SMT only with invariants took 1627 ms to find 0 implicit places.
[2021-05-18 23:08:56] [INFO ] Flow matrix only has 14510 transitions (discarded 1056 similar events)
// Phase 1: matrix 14510 rows 8253 cols
[2021-05-18 23:08:57] [INFO ] Computed 1293 place invariants in 879 ms
[2021-05-18 23:08:58] [INFO ] Dead Transitions using invariants and state equation in 1689 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8253/8452 places, 15566/15779 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3852 1) (GEQ s5867 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 14 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-07 finished in 20533 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 8452 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8452/8452 places, 15779/15779 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 8440 transition count 15763
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 8440 transition count 15763
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 8432 transition count 15751
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 8432 transition count 15751
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 8428 transition count 15743
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 8428 transition count 15743
Applied a total of 48 rules in 10079 ms. Remains 8428 /8452 variables (removed 24) and now considering 15743/15779 (removed 36) transitions.
[2021-05-18 23:09:08] [INFO ] Flow matrix only has 14687 transitions (discarded 1056 similar events)
// Phase 1: matrix 14687 rows 8428 cols
[2021-05-18 23:09:09] [INFO ] Computed 1293 place invariants in 820 ms
[2021-05-18 23:09:10] [INFO ] Implicit Places using invariants in 1636 ms returned []
Implicit Place search using SMT only with invariants took 1637 ms to find 0 implicit places.
[2021-05-18 23:09:10] [INFO ] Flow matrix only has 14687 transitions (discarded 1056 similar events)
// Phase 1: matrix 14687 rows 8428 cols
[2021-05-18 23:09:11] [INFO ] Computed 1293 place invariants in 812 ms
[2021-05-18 23:09:11] [INFO ] Dead Transitions using invariants and state equation in 1542 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8428/8452 places, 15743/15779 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s3096 1) (GEQ s8318 1) (OR (LT s4072 1) (LT s8423 1))), p0:(AND (OR (LT s4367 1) (LT s5142 1)) (OR (LT s3096 1) (LT s8318 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1685 steps with 416 reset in 86 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-08 finished in 13492 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 8452 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8452/8452 places, 15779/15779 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 8452 transition count 15775
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 8448 transition count 15775
Performed 134 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 134 Pre rules applied. Total rules applied 8 place count 8448 transition count 15641
Deduced a syphon composed of 134 places in 12 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 276 place count 8314 transition count 15641
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 286 place count 8304 transition count 15625
Iterating global reduction 2 with 10 rules applied. Total rules applied 296 place count 8304 transition count 15625
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 296 place count 8304 transition count 15623
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 300 place count 8302 transition count 15623
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 304 place count 8298 transition count 15615
Iterating global reduction 2 with 4 rules applied. Total rules applied 308 place count 8298 transition count 15615
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 13 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 376 place count 8264 transition count 15581
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 380 place count 8260 transition count 15577
Iterating global reduction 2 with 4 rules applied. Total rules applied 384 place count 8260 transition count 15577
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 384 place count 8260 transition count 15575
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 388 place count 8258 transition count 15575
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 392 place count 8254 transition count 15567
Iterating global reduction 2 with 4 rules applied. Total rules applied 396 place count 8254 transition count 15567
Applied a total of 396 rules in 16623 ms. Remains 8254 /8452 variables (removed 198) and now considering 15567/15779 (removed 212) transitions.
[2021-05-18 23:09:28] [INFO ] Flow matrix only has 14511 transitions (discarded 1056 similar events)
// Phase 1: matrix 14511 rows 8254 cols
[2021-05-18 23:09:29] [INFO ] Computed 1293 place invariants in 832 ms
[2021-05-18 23:09:30] [INFO ] Implicit Places using invariants in 1641 ms returned []
Implicit Place search using SMT only with invariants took 1642 ms to find 0 implicit places.
[2021-05-18 23:09:30] [INFO ] Flow matrix only has 14511 transitions (discarded 1056 similar events)
// Phase 1: matrix 14511 rows 8254 cols
[2021-05-18 23:09:31] [INFO ] Computed 1293 place invariants in 800 ms
[2021-05-18 23:09:31] [INFO ] Dead Transitions using invariants and state equation in 1605 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8254/8452 places, 15567/15779 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4882 1) (GEQ s7555 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 16 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-10 finished in 19955 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||(!p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 8452 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8452/8452 places, 15779/15779 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 8439 transition count 15761
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 8439 transition count 15761
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 8431 transition count 15749
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 8431 transition count 15749
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 8427 transition count 15741
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 8427 transition count 15741
Applied a total of 50 rules in 9966 ms. Remains 8427 /8452 variables (removed 25) and now considering 15741/15779 (removed 38) transitions.
[2021-05-18 23:09:41] [INFO ] Flow matrix only has 14685 transitions (discarded 1056 similar events)
// Phase 1: matrix 14685 rows 8427 cols
[2021-05-18 23:09:42] [INFO ] Computed 1293 place invariants in 776 ms
[2021-05-18 23:09:43] [INFO ] Implicit Places using invariants in 1510 ms returned []
Implicit Place search using SMT only with invariants took 1510 ms to find 0 implicit places.
[2021-05-18 23:09:43] [INFO ] Flow matrix only has 14685 transitions (discarded 1056 similar events)
// Phase 1: matrix 14685 rows 8427 cols
[2021-05-18 23:09:44] [INFO ] Computed 1293 place invariants in 803 ms
[2021-05-18 23:09:45] [INFO ] Dead Transitions using invariants and state equation in 1621 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8427/8452 places, 15741/15779 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3453 1) (GEQ s8317 1)), p1:(OR (LT s1924 1) (LT s6014 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 49278 reset in 7045 ms.
Product exploration explored 100000 steps with 49252 reset in 7240 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 49242 reset in 7012 ms.
Product exploration explored 100000 steps with 49273 reset in 7117 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 8427 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 8427/8427 places, 15741/15741 transitions.
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 136 Pre rules applied. Total rules applied 0 place count 8427 transition count 15741
Deduced a syphon composed of 136 places in 12 ms
Iterating global reduction 0 with 136 rules applied. Total rules applied 136 place count 8427 transition count 15741
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 169 places in 13 ms
Iterating global reduction 0 with 33 rules applied. Total rules applied 169 place count 8427 transition count 15741
Deduced a syphon composed of 169 places in 12 ms
Applied a total of 169 rules in 6343 ms. Remains 8427 /8427 variables (removed 0) and now considering 15741/15741 (removed 0) transitions.
[2021-05-18 23:10:20] [INFO ] Flow matrix only has 14685 transitions (discarded 1056 similar events)
// Phase 1: matrix 14685 rows 8427 cols
[2021-05-18 23:10:21] [INFO ] Computed 1293 place invariants in 861 ms
[2021-05-18 23:10:21] [INFO ] Dead Transitions using invariants and state equation in 1626 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8427/8427 places, 15741/15741 transitions.
Product exploration timeout after 17750 steps with 8729 reset in 10004 ms.
Product exploration timeout after 17690 steps with 8716 reset in 10003 ms.
[2021-05-18 23:10:42] [INFO ] Flatten gal took : 493 ms
[2021-05-18 23:10:43] [INFO ] Flatten gal took : 556 ms
[2021-05-18 23:10:43] [INFO ] Time to serialize gal into /tmp/LTL8000723892428240176.gal : 47 ms
[2021-05-18 23:10:43] [INFO ] Time to serialize properties into /tmp/LTL9218644362083826577.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8000723892428240176.gal, -t, CGAL, -LTL, /tmp/LTL9218644362083826577.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8000723892428240176.gal -t CGAL -LTL /tmp/LTL9218644362083826577.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("((Node10ManageTheCrashOfNode0>=1)&&(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))")||((X("((Node3DontAnswerToAnyNode<1)||(Node28IsActive<1))"))&&("((Node10ManageTheCrashOfNode0<1)||(Lx0IsAtTheLeftExtremityOfTheLeafSet<1))")))))
Formula 0 simplified : !F("((Node10ManageTheCrashOfNode0>=1)&&(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))" | ("((Node10ManageTheCrashOfNode0<1)||(Lx0IsAtTheLeftExtremityOfTheLeafSet<1))" & X"((Node3DontAnswerToAnyNode<1)||(Node28IsActive<1))"))
Detected timeout of ITS tools.
[2021-05-18 23:10:58] [INFO ] Flatten gal took : 493 ms
[2021-05-18 23:10:58] [INFO ] Applying decomposition
[2021-05-18 23:10:59] [INFO ] Flatten gal took : 516 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14377329378938542270.txt, -o, /tmp/graph14377329378938542270.bin, -w, /tmp/graph14377329378938542270.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14377329378938542270.bin, -l, -1, -v, -w, /tmp/graph14377329378938542270.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 23:11:00] [INFO ] Decomposing Gal with order
[2021-05-18 23:11:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 23:11:04] [INFO ] Removed a total of 12902 redundant transitions.
[2021-05-18 23:11:04] [INFO ] Flatten gal took : 2759 ms
[2021-05-18 23:11:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 7620 labels/synchronizations in 1177 ms.
[2021-05-18 23:11:06] [INFO ] Time to serialize gal into /tmp/LTL10060828424994396258.gal : 85 ms
[2021-05-18 23:11:06] [INFO ] Time to serialize properties into /tmp/LTL13007865743791132636.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10060828424994396258.gal, -t, CGAL, -LTL, /tmp/LTL13007865743791132636.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10060828424994396258.gal -t CGAL -LTL /tmp/LTL13007865743791132636.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(("((i2.u302.Node10ManageTheCrashOfNode0>=1)&&(i2.u3.Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))")||((X("((i29.u0.Node3DontAnswerToAnyNode<1)||(i29.u0.Node28IsActive<1))"))&&("((i2.u302.Node10ManageTheCrashOfNode0<1)||(i2.u3.Lx0IsAtTheLeftExtremityOfTheLeafSet<1))")))))
Formula 0 simplified : !F("((i2.u302.Node10ManageTheCrashOfNode0>=1)&&(i2.u3.Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))" | ("((i2.u302.Node10ManageTheCrashOfNode0<1)||(i2.u3.Lx0IsAtTheLeftExtremityOfTheLeafSet<1))" & X"((i29.u0.Node3DontAnswerToAnyNode<1)||(i29.u0.Node28IsActive<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10840412130342181659
[2021-05-18 23:11:21] [INFO ] Built C files in 156ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10840412130342181659
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10840412130342181659]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10840412130342181659] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10840412130342181659] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-11 finished in 110718 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14846552560897188837
[2021-05-18 23:11:22] [INFO ] Too many transitions (15779) to apply POR reductions. Disabling POR matrices.
[2021-05-18 23:11:23] [INFO ] Built C files in 222ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14846552560897188837
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14846552560897188837]
[2021-05-18 23:11:23] [INFO ] Applying decomposition
[2021-05-18 23:11:23] [INFO ] Flatten gal took : 732 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2435513604359154804.txt, -o, /tmp/graph2435513604359154804.bin, -w, /tmp/graph2435513604359154804.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2435513604359154804.bin, -l, -1, -v, -w, /tmp/graph2435513604359154804.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 23:11:25] [INFO ] Decomposing Gal with order
[2021-05-18 23:11:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 23:11:29] [INFO ] Removed a total of 13003 redundant transitions.
[2021-05-18 23:11:30] [INFO ] Flatten gal took : 3375 ms
[2021-05-18 23:11:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 8280 labels/synchronizations in 1378 ms.
[2021-05-18 23:11:32] [INFO ] Time to serialize gal into /tmp/LTLFireability16529577006038561924.gal : 103 ms
[2021-05-18 23:11:32] [INFO ] Time to serialize properties into /tmp/LTLFireability2293930888308332427.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability16529577006038561924.gal, -t, CGAL, -LTL, /tmp/LTLFireability2293930888308332427.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability16529577006038561924.gal -t CGAL -LTL /tmp/LTLFireability2293930888308332427.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !(((G(!("((((i20.u0.Node28ManageTheCrashOfNode0>=1)&&(i1.u3.Lx1IsAtTheLeftExtremityOfTheLeafSet>=1))&&(i3.u31.Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1))&&(i3.u379.LeafSetOfRx0IsSentToNode20>=1))")))&&(X((!("((i3.u31.Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1)&&(i3.u379.LeafSetOfRx0IsSentToNode20>=1))"))U(("(i4.u795.Node25HasTheLeafSetOfRx1ToReplaceNode19<1)")||(G(!("((i3.u31.Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1)&&(i3.u379.LeafSetOfRx0IsSentToNode20>=1))"))))))))
Formula 0 simplified : !(G!"((((i20.u0.Node28ManageTheCrashOfNode0>=1)&&(i1.u3.Lx1IsAtTheLeftExtremityOfTheLeafSet>=1))&&(i3.u31.Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1))&&(i3.u379.LeafSetOfRx0IsSentToNode20>=1))" & X(!"((i3.u31.Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1)&&(i3.u379.LeafSetOfRx0IsSentToNode20>=1))" U ("(i4.u795.Node25HasTheLeafSetOfRx1ToReplaceNode19<1)" | G!"((i3.u31.Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1)&&(i3.u379.LeafSetOfRx0IsSentToNode20>=1))")))
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14846552560897188837] killed by timeout after 30 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14846552560897188837] killed by timeout after 30 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
ITS-tools command line returned an error code 137
[2021-05-18 23:21:53] [INFO ] Flatten gal took : 2697 ms
[2021-05-18 23:21:53] [INFO ] Time to serialize gal into /tmp/LTLFireability286216345526767221.gal : 495 ms
[2021-05-18 23:21:53] [INFO ] Time to serialize properties into /tmp/LTLFireability16799532222988406716.ltl : 13 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability286216345526767221.gal, -t, CGAL, -LTL, /tmp/LTLFireability16799532222988406716.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability286216345526767221.gal -t CGAL -LTL /tmp/LTLFireability16799532222988406716.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !(((G(!("((((Node28ManageTheCrashOfNode0>=1)&&(Lx1IsAtTheLeftExtremityOfTheLeafSet>=1))&&(Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1))&&(LeafSetOfRx0IsSentToNode20>=1))")))&&(X((!("((Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1)&&(LeafSetOfRx0IsSentToNode20>=1))"))U(("(Node25HasTheLeafSetOfRx1ToReplaceNode19<1)")||(G(!("((Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1)&&(LeafSetOfRx0IsSentToNode20>=1))"))))))))
Formula 0 simplified : !(G!"((((Node28ManageTheCrashOfNode0>=1)&&(Lx1IsAtTheLeftExtremityOfTheLeafSet>=1))&&(Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1))&&(LeafSetOfRx0IsSentToNode20>=1))" & X(!"((Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1)&&(LeafSetOfRx0IsSentToNode20>=1))" U ("(Node25HasTheLeafSetOfRx1ToReplaceNode19<1)" | G!"((Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1)&&(LeafSetOfRx0IsSentToNode20>=1))")))
Detected timeout of ITS tools.
[2021-05-18 23:44:09] [INFO ] Flatten gal took : 1800 ms
[2021-05-18 23:44:18] [INFO ] Input system was already deterministic with 15779 transitions.
[2021-05-18 23:44:18] [INFO ] Transformed 8452 places.
[2021-05-18 23:44:18] [INFO ] Transformed 15779 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-18 23:44:51] [INFO ] Time to serialize gal into /tmp/LTLFireability16923842233743344566.gal : 48 ms
[2021-05-18 23:44:51] [INFO ] Time to serialize properties into /tmp/LTLFireability7436546561252557074.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability16923842233743344566.gal, -t, CGAL, -LTL, /tmp/LTLFireability7436546561252557074.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability16923842233743344566.gal -t CGAL -LTL /tmp/LTLFireability7436546561252557074.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G(!("((((Node28ManageTheCrashOfNode0>=1)&&(Lx1IsAtTheLeftExtremityOfTheLeafSet>=1))&&(Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1))&&(LeafSetOfRx0IsSentToNode20>=1))")))&&(X((!("((Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1)&&(LeafSetOfRx0IsSentToNode20>=1))"))U(("(Node25HasTheLeafSetOfRx1ToReplaceNode19<1)")||(G(!("((Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1)&&(LeafSetOfRx0IsSentToNode20>=1))"))))))))
Formula 0 simplified : !(G!"((((Node28ManageTheCrashOfNode0>=1)&&(Lx1IsAtTheLeftExtremityOfTheLeafSet>=1))&&(Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1))&&(LeafSetOfRx0IsSentToNode20>=1))" & X(!"((Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1)&&(LeafSetOfRx0IsSentToNode20>=1))" U ("(Node25HasTheLeafSetOfRx1ToReplaceNode19<1)" | G!"((Node20HasAskedItsLeafSetToRx0ToReplaceNode30>=1)&&(LeafSetOfRx0IsSentToNode20>=1))")))

BK_TIME_CONFINEMENT_REACHED

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="MultiCrashLeafsetExtension-PT-S32C02"
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 MultiCrashLeafsetExtension-PT-S32C02, 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 r292-tall-162124156900717"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C02.tgz
mv MultiCrashLeafsetExtension-PT-S32C02 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 ;