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.r216-tall-162098205100429.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 ShieldIIPt-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205100429
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 12:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 17:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 167K May 5 16:52 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 ShieldIIPt-PT-010B-00
FORMULA_NAME ShieldIIPt-PT-010B-01
FORMULA_NAME ShieldIIPt-PT-010B-02
FORMULA_NAME ShieldIIPt-PT-010B-03
FORMULA_NAME ShieldIIPt-PT-010B-04
FORMULA_NAME ShieldIIPt-PT-010B-05
FORMULA_NAME ShieldIIPt-PT-010B-06
FORMULA_NAME ShieldIIPt-PT-010B-07
FORMULA_NAME ShieldIIPt-PT-010B-08
FORMULA_NAME ShieldIIPt-PT-010B-09
FORMULA_NAME ShieldIIPt-PT-010B-10
FORMULA_NAME ShieldIIPt-PT-010B-11
FORMULA_NAME ShieldIIPt-PT-010B-12
FORMULA_NAME ShieldIIPt-PT-010B-13
FORMULA_NAME ShieldIIPt-PT-010B-14
FORMULA_NAME ShieldIIPt-PT-010B-15

=== Now, execution of the tool begins

BK_START 1621100887195

Running Version 0
[2021-05-15 17:48:09] [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-15 17:48:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 17:48:09] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2021-05-15 17:48:09] [INFO ] Transformed 703 places.
[2021-05-15 17:48:09] [INFO ] Transformed 653 transitions.
[2021-05-15 17:48:09] [INFO ] Found NUPN structural information;
[2021-05-15 17:48:09] [INFO ] Parsed PT model containing 703 places and 653 transitions in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 17:48:09] [INFO ] Initial state test concluded for 3 properties.
FORMULA ShieldIIPt-PT-010B-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 703 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 703/703 places, 653/653 transitions.
Discarding 101 places :
Symmetric choice reduction at 0 with 101 rule applications. Total rules 101 place count 602 transition count 552
Iterating global reduction 0 with 101 rules applied. Total rules applied 202 place count 602 transition count 552
Applied a total of 202 rules in 110 ms. Remains 602 /703 variables (removed 101) and now considering 552/653 (removed 101) transitions.
// Phase 1: matrix 552 rows 602 cols
[2021-05-15 17:48:09] [INFO ] Computed 91 place invariants in 25 ms
[2021-05-15 17:48:09] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 552 rows 602 cols
[2021-05-15 17:48:09] [INFO ] Computed 91 place invariants in 10 ms
[2021-05-15 17:48:10] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
// Phase 1: matrix 552 rows 602 cols
[2021-05-15 17:48:10] [INFO ] Computed 91 place invariants in 17 ms
[2021-05-15 17:48:10] [INFO ] Dead Transitions using invariants and state equation in 330 ms returned []
Finished structural reductions, in 1 iterations. Remains : 602/703 places, 552/653 transitions.
[2021-05-15 17:48:10] [INFO ] Flatten gal took : 82 ms
FORMULA ShieldIIPt-PT-010B-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 17:48:10] [INFO ] Flatten gal took : 33 ms
[2021-05-15 17:48:10] [INFO ] Input system was already deterministic with 552 transitions.
Finished random walk after 11343 steps, including 0 resets, run visited all 28 properties in 89 ms. (steps per millisecond=127 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0) U (p0||X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 602 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 602/602 places, 552/552 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 593 transition count 543
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 593 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 592 transition count 542
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 592 transition count 542
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 591 transition count 541
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 591 transition count 541
Applied a total of 22 rules in 113 ms. Remains 591 /602 variables (removed 11) and now considering 541/552 (removed 11) transitions.
// Phase 1: matrix 541 rows 591 cols
[2021-05-15 17:48:11] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-15 17:48:11] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 541 rows 591 cols
[2021-05-15 17:48:11] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:48:11] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
// Phase 1: matrix 541 rows 591 cols
[2021-05-15 17:48:11] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-15 17:48:11] [INFO ] Dead Transitions using invariants and state equation in 249 ms returned []
Finished structural reductions, in 1 iterations. Remains : 591/602 places, 541/552 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-010B-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s460 1), p1:(EQ s421 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2637 reset in 369 ms.
Product exploration explored 100000 steps with 2627 reset in 256 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2617 reset in 213 ms.
Product exploration explored 100000 steps with 2607 reset in 244 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 591 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 591/591 places, 541/541 transitions.
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 591 transition count 541
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 52 Pre rules applied. Total rules applied 118 place count 591 transition count 604
Deduced a syphon composed of 170 places in 1 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 170 place count 591 transition count 604
Performed 187 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 357 places in 1 ms
Iterating global reduction 1 with 187 rules applied. Total rules applied 357 place count 591 transition count 604
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 358 place count 591 transition count 603
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 426 place count 523 transition count 535
Deduced a syphon composed of 289 places in 3 ms
Iterating global reduction 2 with 68 rules applied. Total rules applied 494 place count 523 transition count 535
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 290 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 495 place count 523 transition count 535
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 497 place count 521 transition count 533
Deduced a syphon composed of 288 places in 4 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 499 place count 521 transition count 533
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -157
Deduced a syphon composed of 317 places in 3 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 528 place count 521 transition count 690
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 557 place count 492 transition count 632
Deduced a syphon composed of 288 places in 3 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 586 place count 492 transition count 632
Deduced a syphon composed of 288 places in 0 ms
Applied a total of 586 rules in 212 ms. Remains 492 /591 variables (removed 99) and now considering 632/541 (removed -91) transitions.
[2021-05-15 17:48:13] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 632 rows 492 cols
[2021-05-15 17:48:14] [INFO ] Computed 91 place invariants in 4 ms
[2021-05-15 17:48:14] [INFO ] Dead Transitions using invariants and state equation in 262 ms returned []
Finished structural reductions, in 1 iterations. Remains : 492/591 places, 632/541 transitions.
Product exploration explored 100000 steps with 8092 reset in 812 ms.
Stack based approach found an accepted trace after 36 steps with 3 reset with depth 5 and stack size 3 in 1 ms.
FORMULA ShieldIIPt-PT-010B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-00 finished in 4020 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 602 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 602/602 places, 552/552 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 601 transition count 432
Reduce places removed 119 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 122 rules applied. Total rules applied 241 place count 482 transition count 429
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 244 place count 480 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 245 place count 479 transition count 428
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 245 place count 479 transition count 354
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 393 place count 405 transition count 354
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 401 place count 397 transition count 346
Iterating global reduction 4 with 8 rules applied. Total rules applied 409 place count 397 transition count 346
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 409 place count 397 transition count 338
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 425 place count 389 transition count 338
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Deduced a syphon composed of 165 places in 1 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 4 with 330 rules applied. Total rules applied 755 place count 224 transition count 173
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 813 place count 195 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 814 place count 194 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 816 place count 192 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 816 place count 192 transition count 190
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 818 place count 191 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 819 place count 190 transition count 189
Applied a total of 819 rules in 109 ms. Remains 190 /602 variables (removed 412) and now considering 189/552 (removed 363) transitions.
// Phase 1: matrix 189 rows 190 cols
[2021-05-15 17:48:15] [INFO ] Computed 89 place invariants in 1 ms
[2021-05-15 17:48:15] [INFO ] Implicit Places using invariants in 96 ms returned [179]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
[2021-05-15 17:48:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 189 rows 189 cols
[2021-05-15 17:48:15] [INFO ] Computed 88 place invariants in 2 ms
[2021-05-15 17:48:15] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Starting structural reductions, iteration 1 : 189/602 places, 189/552 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 188 transition count 188
Applied a total of 2 rules in 11 ms. Remains 188 /189 variables (removed 1) and now considering 188/189 (removed 1) transitions.
// Phase 1: matrix 188 rows 188 cols
[2021-05-15 17:48:15] [INFO ] Computed 88 place invariants in 1 ms
[2021-05-15 17:48:15] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 188 rows 188 cols
[2021-05-15 17:48:15] [INFO ] Computed 88 place invariants in 1 ms
[2021-05-15 17:48:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 17:48:15] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 188/602 places, 188/552 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-010B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s166 1), p1:(EQ s151 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-010B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-01 finished in 799 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((F(p0) U p1))&&(p2 U X(X(X(X(G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 602 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 602/602 places, 552/552 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 595 transition count 545
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 595 transition count 545
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 594 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 594 transition count 544
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 593 transition count 543
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 593 transition count 543
Applied a total of 18 rules in 118 ms. Remains 593 /602 variables (removed 9) and now considering 543/552 (removed 9) transitions.
// Phase 1: matrix 543 rows 593 cols
[2021-05-15 17:48:16] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:48:16] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 543 rows 593 cols
[2021-05-15 17:48:16] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:48:16] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
// Phase 1: matrix 543 rows 593 cols
[2021-05-15 17:48:16] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:48:16] [INFO ] Dead Transitions using invariants and state equation in 250 ms returned []
Finished structural reductions, in 1 iterations. Remains : 593/602 places, 543/552 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p2), (NOT p0), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : ShieldIIPt-PT-010B-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=p2, acceptance={} source=7 dest: 7}, { cond=(NOT p2), acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(EQ s403 1), p1:(EQ s587 1), p0:(EQ s408 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-010B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-02 finished in 1171 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0))||G((p1||X(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 602 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 602/602 places, 552/552 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 594 transition count 544
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 594 transition count 544
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 593 transition count 543
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 593 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 592 transition count 542
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 592 transition count 542
Applied a total of 20 rules in 42 ms. Remains 592 /602 variables (removed 10) and now considering 542/552 (removed 10) transitions.
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:48:17] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:48:17] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:48:17] [INFO ] Computed 91 place invariants in 9 ms
[2021-05-15 17:48:17] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:48:17] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:48:17] [INFO ] Dead Transitions using invariants and state equation in 269 ms returned []
Finished structural reductions, in 1 iterations. Remains : 592/602 places, 542/552 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-010B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s59 1), p0:(NEQ s418 1), p2:(NEQ s236 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 20 reset in 289 ms.
Product exploration explored 100000 steps with 24 reset in 427 ms.
Knowledge obtained : [p1, p0, p2]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 19 reset in 288 ms.
Product exploration explored 100000 steps with 16 reset in 360 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 592 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 592/592 places, 542/542 transitions.
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 592 transition count 542
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 53 Pre rules applied. Total rules applied 116 place count 592 transition count 606
Deduced a syphon composed of 169 places in 0 ms
Iterating global reduction 1 with 53 rules applied. Total rules applied 169 place count 592 transition count 606
Performed 188 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 357 places in 1 ms
Iterating global reduction 1 with 188 rules applied. Total rules applied 357 place count 592 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 358 place count 592 transition count 605
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 425 place count 525 transition count 538
Deduced a syphon composed of 290 places in 0 ms
Iterating global reduction 2 with 67 rules applied. Total rules applied 492 place count 525 transition count 538
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 291 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 493 place count 525 transition count 538
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 495 place count 523 transition count 536
Deduced a syphon composed of 289 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 497 place count 523 transition count 536
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -173
Deduced a syphon composed of 319 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 527 place count 523 transition count 709
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 558 place count 492 transition count 647
Deduced a syphon composed of 288 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 589 place count 492 transition count 647
Deduced a syphon composed of 288 places in 0 ms
Applied a total of 589 rules in 123 ms. Remains 492 /592 variables (removed 100) and now considering 647/542 (removed -105) transitions.
[2021-05-15 17:48:20] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 647 rows 492 cols
[2021-05-15 17:48:20] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:48:20] [INFO ] Dead Transitions using invariants and state equation in 252 ms returned []
Finished structural reductions, in 1 iterations. Remains : 492/592 places, 647/542 transitions.
Product exploration explored 100000 steps with 60 reset in 376 ms.
Product exploration explored 100000 steps with 78 reset in 459 ms.
[2021-05-15 17:48:21] [INFO ] Flatten gal took : 27 ms
[2021-05-15 17:48:21] [INFO ] Flatten gal took : 29 ms
[2021-05-15 17:48:21] [INFO ] Time to serialize gal into /tmp/LTL13969145336808409181.gal : 16 ms
[2021-05-15 17:48:21] [INFO ] Time to serialize properties into /tmp/LTL18196914261819810864.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/LTL13969145336808409181.gal, -t, CGAL, -LTL, /tmp/LTL18196914261819810864.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/LTL13969145336808409181.gal -t CGAL -LTL /tmp/LTL18196914261819810864.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(p493!=1)")))||(G(("(p65!=1)")||(X(F("(p277!=1)"))))))))
Formula 0 simplified : !X(GF"(p493!=1)" | G("(p65!=1)" | XF"(p277!=1)"))
Detected timeout of ITS tools.
[2021-05-15 17:48:36] [INFO ] Flatten gal took : 24 ms
[2021-05-15 17:48:36] [INFO ] Applying decomposition
[2021-05-15 17:48:36] [INFO ] Flatten gal took : 23 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/graph10428183623153701477.txt, -o, /tmp/graph10428183623153701477.bin, -w, /tmp/graph10428183623153701477.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/graph10428183623153701477.bin, -l, -1, -v, -w, /tmp/graph10428183623153701477.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 17:48:36] [INFO ] Decomposing Gal with order
[2021-05-15 17:48:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 17:48:36] [INFO ] Removed a total of 102 redundant transitions.
[2021-05-15 17:48:36] [INFO ] Flatten gal took : 73 ms
[2021-05-15 17:48:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-15 17:48:36] [INFO ] Time to serialize gal into /tmp/LTL15496100797839792405.gal : 19 ms
[2021-05-15 17:48:36] [INFO ] Time to serialize properties into /tmp/LTL755130847667098218.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/LTL15496100797839792405.gal, -t, CGAL, -LTL, /tmp/LTL755130847667098218.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/LTL15496100797839792405.gal -t CGAL -LTL /tmp/LTL755130847667098218.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(i11.i0.i3.u156.p493!=1)")))||(G(("(i2.i0.i3.u21.p65!=1)")||(X(F("(i1.u86.p277!=1)"))))))))
Formula 0 simplified : !X(GF"(i11.i0.i3.u156.p493!=1)" | G("(i2.i0.i3.u21.p65!=1)" | XF"(i1.u86.p277!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10519158718445018908
[2021-05-15 17:48:51] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10519158718445018908
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/ltsmin10519158718445018908]
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/ltsmin10519158718445018908] 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/ltsmin10519158718445018908] 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 ShieldIIPt-PT-010B-03 finished in 35743 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 602 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 602/602 places, 552/552 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 601 transition count 434
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 120 rules applied. Total rules applied 237 place count 484 transition count 431
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 240 place count 482 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 241 place count 481 transition count 430
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 76 Pre rules applied. Total rules applied 241 place count 481 transition count 354
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 393 place count 405 transition count 354
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 401 place count 397 transition count 346
Iterating global reduction 4 with 8 rules applied. Total rules applied 409 place count 397 transition count 346
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 409 place count 397 transition count 339
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 423 place count 390 transition count 339
Performed 166 Post agglomeration using F-continuation condition.Transition count delta: 166
Deduced a syphon composed of 166 places in 0 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 4 with 332 rules applied. Total rules applied 755 place count 224 transition count 173
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 811 place count 196 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 812 place count 195 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 813 place count 194 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 814 place count 193 transition count 189
Applied a total of 814 rules in 167 ms. Remains 193 /602 variables (removed 409) and now considering 189/552 (removed 363) transitions.
// Phase 1: matrix 189 rows 193 cols
[2021-05-15 17:48:52] [INFO ] Computed 90 place invariants in 0 ms
[2021-05-15 17:48:53] [INFO ] Implicit Places using invariants in 437 ms returned []
// Phase 1: matrix 189 rows 193 cols
[2021-05-15 17:48:53] [INFO ] Computed 90 place invariants in 0 ms
[2021-05-15 17:48:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-15 17:48:53] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2021-05-15 17:48:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 189 rows 193 cols
[2021-05-15 17:48:53] [INFO ] Computed 90 place invariants in 1 ms
[2021-05-15 17:48:53] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Finished structural reductions, in 1 iterations. Remains : 193/602 places, 189/552 transitions.
Stuttering acceptance computed with spot in 940 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-010B-05 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:(NEQ s172 1), p0:(NEQ s186 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 362 ms.
Product exploration explored 100000 steps with 0 reset in 449 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 321 ms.
Product exploration explored 100000 steps with 0 reset in 434 ms.
[2021-05-15 17:48:56] [INFO ] Flatten gal took : 9 ms
[2021-05-15 17:48:56] [INFO ] Flatten gal took : 9 ms
[2021-05-15 17:48:56] [INFO ] Time to serialize gal into /tmp/LTL9911105028922488444.gal : 2 ms
[2021-05-15 17:48:56] [INFO ] Time to serialize properties into /tmp/LTL13211045614790692229.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/LTL9911105028922488444.gal, -t, CGAL, -LTL, /tmp/LTL13211045614790692229.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/LTL9911105028922488444.gal -t CGAL -LTL /tmp/LTL13211045614790692229.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p668!=1)")||(G("(p617!=1)"))))))
Formula 0 simplified : !GF("(p668!=1)" | G"(p617!=1)")
Reverse transition relation is NOT exact ! Due to transitions t9.t54, t41, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/187/2/189
Computing Next relation with stutter on 2.73368e+11 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
61 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.627277,36424,1,0,319,139830,417,125,6671,77310,436
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-010B-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-010B-05 finished in 4321 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 602 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 602/602 places, 552/552 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 601 transition count 431
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 123 rules applied. Total rules applied 243 place count 481 transition count 428
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 245 place count 479 transition count 428
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 245 place count 479 transition count 353
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 395 place count 404 transition count 353
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 404 place count 395 transition count 344
Iterating global reduction 3 with 9 rules applied. Total rules applied 413 place count 395 transition count 344
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 413 place count 395 transition count 336
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 429 place count 387 transition count 336
Performed 163 Post agglomeration using F-continuation condition.Transition count delta: 163
Deduced a syphon composed of 163 places in 0 ms
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 3 with 326 rules applied. Total rules applied 755 place count 224 transition count 173
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 813 place count 195 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 814 place count 194 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 816 place count 192 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 816 place count 192 transition count 190
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 818 place count 191 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 819 place count 190 transition count 189
Applied a total of 819 rules in 110 ms. Remains 190 /602 variables (removed 412) and now considering 189/552 (removed 363) transitions.
// Phase 1: matrix 189 rows 190 cols
[2021-05-15 17:48:57] [INFO ] Computed 89 place invariants in 1 ms
[2021-05-15 17:48:57] [INFO ] Implicit Places using invariants in 165 ms returned [179]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 166 ms to find 1 implicit places.
[2021-05-15 17:48:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 189 rows 189 cols
[2021-05-15 17:48:57] [INFO ] Computed 88 place invariants in 1 ms
[2021-05-15 17:48:57] [INFO ] Dead Transitions using invariants and state equation in 433 ms returned []
Starting structural reductions, iteration 1 : 189/602 places, 189/552 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 188 transition count 188
Applied a total of 2 rules in 5 ms. Remains 188 /189 variables (removed 1) and now considering 188/189 (removed 1) transitions.
// Phase 1: matrix 188 rows 188 cols
[2021-05-15 17:48:57] [INFO ] Computed 88 place invariants in 1 ms
[2021-05-15 17:48:58] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 188 rows 188 cols
[2021-05-15 17:48:58] [INFO ] Computed 88 place invariants in 1 ms
[2021-05-15 17:48:58] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 188/602 places, 188/552 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010B-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s41 1) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-010B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-07 finished in 1201 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 602 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 602/602 places, 552/552 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 593 transition count 543
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 593 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 592 transition count 542
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 592 transition count 542
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 591 transition count 541
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 591 transition count 541
Applied a total of 22 rules in 37 ms. Remains 591 /602 variables (removed 11) and now considering 541/552 (removed 11) transitions.
// Phase 1: matrix 541 rows 591 cols
[2021-05-15 17:48:58] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:48:58] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 541 rows 591 cols
[2021-05-15 17:48:58] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:48:58] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
// Phase 1: matrix 541 rows 591 cols
[2021-05-15 17:48:58] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:48:59] [INFO ] Dead Transitions using invariants and state equation in 246 ms returned []
Finished structural reductions, in 1 iterations. Remains : 591/602 places, 541/552 transitions.
Stuttering acceptance computed with spot in 1693 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010B-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s282 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-010B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-08 finished in 2530 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(!p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 602 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 602/602 places, 552/552 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 601 transition count 432
Reduce places removed 119 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 122 rules applied. Total rules applied 241 place count 482 transition count 429
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 244 place count 480 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 245 place count 479 transition count 428
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 245 place count 479 transition count 353
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 395 place count 404 transition count 353
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 404 place count 395 transition count 344
Iterating global reduction 4 with 9 rules applied. Total rules applied 413 place count 395 transition count 344
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 413 place count 395 transition count 336
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 429 place count 387 transition count 336
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 4 with 330 rules applied. Total rules applied 759 place count 222 transition count 171
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 815 place count 194 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 816 place count 193 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 818 place count 191 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 818 place count 191 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 820 place count 190 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 821 place count 189 transition count 186
Applied a total of 821 rules in 44 ms. Remains 189 /602 variables (removed 413) and now considering 186/552 (removed 366) transitions.
// Phase 1: matrix 186 rows 189 cols
[2021-05-15 17:49:00] [INFO ] Computed 89 place invariants in 1 ms
[2021-05-15 17:49:00] [INFO ] Implicit Places using invariants in 99 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
[2021-05-15 17:49:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 186 rows 188 cols
[2021-05-15 17:49:00] [INFO ] Computed 88 place invariants in 0 ms
[2021-05-15 17:49:01] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Starting structural reductions, iteration 1 : 188/602 places, 186/552 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 187 transition count 185
Applied a total of 2 rules in 5 ms. Remains 187 /188 variables (removed 1) and now considering 185/186 (removed 1) transitions.
// Phase 1: matrix 185 rows 187 cols
[2021-05-15 17:49:01] [INFO ] Computed 88 place invariants in 4 ms
[2021-05-15 17:49:01] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 185 rows 187 cols
[2021-05-15 17:49:01] [INFO ] Computed 88 place invariants in 2 ms
[2021-05-15 17:49:01] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 187/602 places, 185/552 transitions.
Stuttering acceptance computed with spot in 25 ms :[p0]
Running random walk in product with property : ShieldIIPt-PT-010B-09 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s172 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-010B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-09 finished in 501 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(G(p0)) U (p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 602 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 602/602 places, 552/552 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 594 transition count 544
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 594 transition count 544
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 593 transition count 543
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 593 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 592 transition count 542
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 592 transition count 542
Applied a total of 20 rules in 43 ms. Remains 592 /602 variables (removed 10) and now considering 542/552 (removed 10) transitions.
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:49:01] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 17:49:01] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:49:01] [INFO ] Computed 91 place invariants in 3 ms
[2021-05-15 17:49:01] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:49:01] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 17:49:02] [INFO ] Dead Transitions using invariants and state equation in 296 ms returned []
Finished structural reductions, in 1 iterations. Remains : 592/602 places, 542/552 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010B-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s301 1), p1:(EQ s224 1), p0:(EQ s129 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 299 ms.
Product exploration explored 100000 steps with 0 reset in 410 ms.
Knowledge obtained : [(NOT p2), (NOT p1), p0]
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 327 ms.
Product exploration explored 100000 steps with 0 reset in 400 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0)]
Support contains 3 out of 592 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 592/592 places, 542/542 transitions.
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 592 transition count 542
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 51 Pre rules applied. Total rules applied 117 place count 592 transition count 602
Deduced a syphon composed of 168 places in 1 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 168 place count 592 transition count 602
Performed 189 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 357 places in 0 ms
Iterating global reduction 1 with 189 rules applied. Total rules applied 357 place count 592 transition count 602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 358 place count 592 transition count 601
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 427 place count 523 transition count 532
Deduced a syphon composed of 288 places in 0 ms
Iterating global reduction 2 with 69 rules applied. Total rules applied 496 place count 523 transition count 532
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 289 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 497 place count 523 transition count 532
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 499 place count 521 transition count 530
Deduced a syphon composed of 287 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 501 place count 521 transition count 530
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -160
Deduced a syphon composed of 316 places in 1 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 530 place count 521 transition count 690
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 559 place count 492 transition count 632
Deduced a syphon composed of 287 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 588 place count 492 transition count 632
Deduced a syphon composed of 287 places in 0 ms
Applied a total of 588 rules in 102 ms. Remains 492 /592 variables (removed 100) and now considering 632/542 (removed -90) transitions.
[2021-05-15 17:49:06] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 632 rows 492 cols
[2021-05-15 17:49:06] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:49:07] [INFO ] Dead Transitions using invariants and state equation in 423 ms returned []
Finished structural reductions, in 1 iterations. Remains : 492/592 places, 632/542 transitions.
Product exploration explored 100000 steps with 0 reset in 401 ms.
Product exploration explored 100000 steps with 0 reset in 473 ms.
[2021-05-15 17:49:08] [INFO ] Flatten gal took : 18 ms
[2021-05-15 17:49:08] [INFO ] Flatten gal took : 18 ms
[2021-05-15 17:49:08] [INFO ] Time to serialize gal into /tmp/LTL10915892255392185415.gal : 3 ms
[2021-05-15 17:49:08] [INFO ] Time to serialize properties into /tmp/LTL4093561491206326385.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/LTL10915892255392185415.gal, -t, CGAL, -LTL, /tmp/LTL4093561491206326385.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/LTL10915892255392185415.gal -t CGAL -LTL /tmp/LTL4093561491206326385.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("(p150==0)")))U(("(p260==1)")U("(p353==1)"))))))
Formula 0 simplified : !XX(FG"(p150==0)" U ("(p260==1)" U "(p353==1)"))
Detected timeout of ITS tools.
[2021-05-15 17:49:23] [INFO ] Flatten gal took : 39 ms
[2021-05-15 17:49:23] [INFO ] Applying decomposition
[2021-05-15 17:49:23] [INFO ] Flatten gal took : 31 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/graph8551198150500404430.txt, -o, /tmp/graph8551198150500404430.bin, -w, /tmp/graph8551198150500404430.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/graph8551198150500404430.bin, -l, -1, -v, -w, /tmp/graph8551198150500404430.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 17:49:23] [INFO ] Decomposing Gal with order
[2021-05-15 17:49:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 17:49:23] [INFO ] Removed a total of 98 redundant transitions.
[2021-05-15 17:49:23] [INFO ] Flatten gal took : 47 ms
[2021-05-15 17:49:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-15 17:49:23] [INFO ] Time to serialize gal into /tmp/LTL11640546233206495258.gal : 5 ms
[2021-05-15 17:49:23] [INFO ] Time to serialize properties into /tmp/LTL4520757146491152763.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/LTL11640546233206495258.gal, -t, CGAL, -LTL, /tmp/LTL4520757146491152763.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/LTL11640546233206495258.gal -t CGAL -LTL /tmp/LTL4520757146491152763.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("(i2.i1.i3.u46.p150==0)")))U(("(i6.u81.p260==1)")U("(i0.u111.p353==1)"))))))
Formula 0 simplified : !XX(FG"(i2.i1.i3.u46.p150==0)" U ("(i6.u81.p260==1)" U "(i0.u111.p353==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2617484783320048448
[2021-05-15 17:49:38] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2617484783320048448
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/ltsmin2617484783320048448]
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/ltsmin2617484783320048448] 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/ltsmin2617484783320048448] 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 ShieldIIPt-PT-010B-10 finished in 38140 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((X(p2)||p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 602 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 602/602 places, 552/552 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 594 transition count 544
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 594 transition count 544
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 593 transition count 543
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 593 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 592 transition count 542
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 592 transition count 542
Applied a total of 20 rules in 35 ms. Remains 592 /602 variables (removed 10) and now considering 542/552 (removed 10) transitions.
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:49:39] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:49:39] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:49:39] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 17:49:40] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
// Phase 1: matrix 542 rows 592 cols
[2021-05-15 17:49:40] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:49:40] [INFO ] Dead Transitions using invariants and state equation in 267 ms returned []
Finished structural reductions, in 1 iterations. Remains : 592/602 places, 542/552 transitions.
Stuttering acceptance computed with spot in 2278 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : ShieldIIPt-PT-010B-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s487 1), p1:(OR (EQ s356 0) (EQ s487 0)), p2:(AND (NEQ s356 1) (NEQ s53 1))], nbAcceptance=0, 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]]
Product exploration explored 100000 steps with 644 reset in 311 ms.
Stack based approach found an accepted trace after 1846 steps with 10 reset with depth 300 and stack size 300 in 6 ms.
FORMULA ShieldIIPt-PT-010B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-11 finished in 3454 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 602 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 602/602 places, 552/552 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 593 transition count 543
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 593 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 592 transition count 542
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 592 transition count 542
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 591 transition count 541
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 591 transition count 541
Applied a total of 22 rules in 38 ms. Remains 591 /602 variables (removed 11) and now considering 541/552 (removed 11) transitions.
// Phase 1: matrix 541 rows 591 cols
[2021-05-15 17:49:42] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:49:43] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 541 rows 591 cols
[2021-05-15 17:49:43] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:49:43] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
// Phase 1: matrix 541 rows 591 cols
[2021-05-15 17:49:43] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 17:49:43] [INFO ] Dead Transitions using invariants and state equation in 247 ms returned []
Finished structural reductions, in 1 iterations. Remains : 591/602 places, 541/552 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010B-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s566 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3494 reset in 242 ms.
Product exploration explored 100000 steps with 3458 reset in 251 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3506 reset in 254 ms.
Product exploration explored 100000 steps with 3419 reset in 247 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 591 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 591/591 places, 541/541 transitions.
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 591 transition count 541
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 51 Pre rules applied. Total rules applied 119 place count 591 transition count 604
Deduced a syphon composed of 170 places in 1 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 170 place count 591 transition count 604
Performed 188 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 358 places in 1 ms
Iterating global reduction 1 with 188 rules applied. Total rules applied 358 place count 591 transition count 604
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 359 place count 591 transition count 603
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 428 place count 522 transition count 534
Deduced a syphon composed of 289 places in 0 ms
Iterating global reduction 2 with 69 rules applied. Total rules applied 497 place count 522 transition count 534
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 290 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 498 place count 522 transition count 534
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 500 place count 520 transition count 532
Deduced a syphon composed of 288 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 502 place count 520 transition count 532
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -157
Deduced a syphon composed of 317 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 531 place count 520 transition count 689
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 560 place count 491 transition count 631
Deduced a syphon composed of 288 places in 1 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 589 place count 491 transition count 631
Deduced a syphon composed of 288 places in 0 ms
Applied a total of 589 rules in 67 ms. Remains 491 /591 variables (removed 100) and now considering 631/541 (removed -90) transitions.
[2021-05-15 17:49:45] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 631 rows 491 cols
[2021-05-15 17:49:45] [INFO ] Computed 91 place invariants in 7 ms
[2021-05-15 17:49:45] [INFO ] Dead Transitions using invariants and state equation in 620 ms returned []
Finished structural reductions, in 1 iterations. Remains : 491/591 places, 631/541 transitions.
Product exploration explored 100000 steps with 13144 reset in 932 ms.
Product exploration explored 100000 steps with 13111 reset in 938 ms.
[2021-05-15 17:49:47] [INFO ] Flatten gal took : 35 ms
[2021-05-15 17:49:47] [INFO ] Flatten gal took : 67 ms
[2021-05-15 17:49:47] [INFO ] Time to serialize gal into /tmp/LTL6105591246717836106.gal : 3 ms
[2021-05-15 17:49:47] [INFO ] Time to serialize properties into /tmp/LTL10157327997986472325.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/LTL6105591246717836106.gal, -t, CGAL, -LTL, /tmp/LTL10157327997986472325.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/LTL6105591246717836106.gal -t CGAL -LTL /tmp/LTL10157327997986472325.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(p670==1)"))))))
Formula 0 simplified : !XXXF"(p670==1)"
Detected timeout of ITS tools.
[2021-05-15 17:50:02] [INFO ] Flatten gal took : 30 ms
[2021-05-15 17:50:02] [INFO ] Applying decomposition
[2021-05-15 17:50:02] [INFO ] Flatten gal took : 14 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/graph3931753228799325916.txt, -o, /tmp/graph3931753228799325916.bin, -w, /tmp/graph3931753228799325916.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/graph3931753228799325916.bin, -l, -1, -v, -w, /tmp/graph3931753228799325916.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 17:50:03] [INFO ] Decomposing Gal with order
[2021-05-15 17:50:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 17:50:03] [INFO ] Removed a total of 103 redundant transitions.
[2021-05-15 17:50:03] [INFO ] Flatten gal took : 38 ms
[2021-05-15 17:50:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-15 17:50:03] [INFO ] Time to serialize gal into /tmp/LTL2003026099995035696.gal : 3 ms
[2021-05-15 17:50:11] [INFO ] Time to serialize properties into /tmp/LTL15911885406526614096.ltl : 8171 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/LTL2003026099995035696.gal, -t, CGAL, -LTL, /tmp/LTL15911885406526614096.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/LTL2003026099995035696.gal -t CGAL -LTL /tmp/LTL15911885406526614096.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(i17.i1.i2.u211.p670==1)"))))))
Formula 0 simplified : !XXXF"(i17.i1.i2.u211.p670==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10168437092316550396
[2021-05-15 17:50:26] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10168437092316550396
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/ltsmin10168437092316550396]
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/ltsmin10168437092316550396] 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/ltsmin10168437092316550396] 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 ShieldIIPt-PT-010B-12 finished in 44424 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 602 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 602/602 places, 552/552 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 593 transition count 543
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 593 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 592 transition count 542
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 592 transition count 542
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 591 transition count 541
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 591 transition count 541
Applied a total of 22 rules in 71 ms. Remains 591 /602 variables (removed 11) and now considering 541/552 (removed 11) transitions.
// Phase 1: matrix 541 rows 591 cols
[2021-05-15 17:50:27] [INFO ] Computed 91 place invariants in 2 ms
[2021-05-15 17:50:27] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 541 rows 591 cols
[2021-05-15 17:50:27] [INFO ] Computed 91 place invariants in 8 ms
[2021-05-15 17:50:28] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
// Phase 1: matrix 541 rows 591 cols
[2021-05-15 17:50:28] [INFO ] Computed 91 place invariants in 1 ms
[2021-05-15 17:50:28] [INFO ] Dead Transitions using invariants and state equation in 399 ms returned []
Finished structural reductions, in 1 iterations. Remains : 591/602 places, 541/552 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-010B-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(NEQ s178 1), p0:(NEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 147 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-010B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-13 finished in 1391 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U (p1 U (G(p2) U G(p3)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 602 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 602/602 places, 552/552 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 601 transition count 435
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 119 rules applied. Total rules applied 235 place count 485 transition count 432
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 239 place count 483 transition count 430
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 241 place count 481 transition count 430
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 241 place count 481 transition count 355
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 391 place count 406 transition count 355
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 399 place count 398 transition count 347
Iterating global reduction 4 with 8 rules applied. Total rules applied 407 place count 398 transition count 347
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 407 place count 398 transition count 339
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 423 place count 390 transition count 339
Performed 164 Post agglomeration using F-continuation condition.Transition count delta: 164
Deduced a syphon composed of 164 places in 0 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 4 with 328 rules applied. Total rules applied 751 place count 226 transition count 175
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 809 place count 197 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 810 place count 196 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 812 place count 194 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 813 place count 193 transition count 192
Applied a total of 813 rules in 41 ms. Remains 193 /602 variables (removed 409) and now considering 192/552 (removed 360) transitions.
// Phase 1: matrix 192 rows 193 cols
[2021-05-15 17:50:28] [INFO ] Computed 89 place invariants in 0 ms
[2021-05-15 17:50:29] [INFO ] Implicit Places using invariants in 201 ms returned []
// Phase 1: matrix 192 rows 193 cols
[2021-05-15 17:50:29] [INFO ] Computed 89 place invariants in 1 ms
[2021-05-15 17:50:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 17:50:29] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2021-05-15 17:50:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 192 rows 193 cols
[2021-05-15 17:50:29] [INFO ] Computed 89 place invariants in 0 ms
[2021-05-15 17:50:29] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Finished structural reductions, in 1 iterations. Remains : 193/602 places, 192/552 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p3), (NOT p0), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p3 (NOT p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Running random walk in product with property : ShieldIIPt-PT-010B-14 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p3 p2 p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0))), acceptance={} source=4 dest: 1}, { cond=(OR (AND p3 p2 (NOT p0)) (AND p3 p1 (NOT p0))), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s151 1), p2:(OR (NEQ s176 1) (NEQ s191 1)), p1:(AND (EQ s181 1) (EQ s183 1)), p0:(OR (EQ s160 0) (EQ s162 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-010B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-14 finished in 675 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 602 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 602/602 places, 552/552 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 601 transition count 430
Reduce places removed 121 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 124 rules applied. Total rules applied 245 place count 480 transition count 427
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 247 place count 478 transition count 427
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 247 place count 478 transition count 352
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 397 place count 403 transition count 352
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 406 place count 394 transition count 343
Iterating global reduction 3 with 9 rules applied. Total rules applied 415 place count 394 transition count 343
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 415 place count 394 transition count 335
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 431 place count 386 transition count 335
Performed 161 Post agglomeration using F-continuation condition.Transition count delta: 161
Deduced a syphon composed of 161 places in 0 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 3 with 322 rules applied. Total rules applied 753 place count 225 transition count 174
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 811 place count 196 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 812 place count 195 transition count 192
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 814 place count 193 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 814 place count 193 transition count 191
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 816 place count 192 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 817 place count 191 transition count 190
Applied a total of 817 rules in 39 ms. Remains 191 /602 variables (removed 411) and now considering 190/552 (removed 362) transitions.
// Phase 1: matrix 190 rows 191 cols
[2021-05-15 17:50:29] [INFO ] Computed 89 place invariants in 0 ms
[2021-05-15 17:50:29] [INFO ] Implicit Places using invariants in 91 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
[2021-05-15 17:50:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 190 rows 190 cols
[2021-05-15 17:50:29] [INFO ] Computed 88 place invariants in 1 ms
[2021-05-15 17:50:29] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Starting structural reductions, iteration 1 : 190/602 places, 190/552 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 189 transition count 189
Applied a total of 2 rules in 5 ms. Remains 189 /190 variables (removed 1) and now considering 189/190 (removed 1) transitions.
// Phase 1: matrix 189 rows 189 cols
[2021-05-15 17:50:29] [INFO ] Computed 88 place invariants in 0 ms
[2021-05-15 17:50:29] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 189 rows 189 cols
[2021-05-15 17:50:29] [INFO ] Computed 88 place invariants in 0 ms
[2021-05-15 17:50:29] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 189/602 places, 189/552 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s176 0) (NEQ s22 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-010B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010B-15 finished in 549 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3187993380966958348
[2021-05-15 17:50:29] [INFO ] Computing symmetric may disable matrix : 552 transitions.
[2021-05-15 17:50:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 17:50:29] [INFO ] Computing symmetric may enable matrix : 552 transitions.
[2021-05-15 17:50:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 17:50:29] [INFO ] Applying decomposition
[2021-05-15 17:50:30] [INFO ] Flatten gal took : 15 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/graph6252720648775575075.txt, -o, /tmp/graph6252720648775575075.bin, -w, /tmp/graph6252720648775575075.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/graph6252720648775575075.bin, -l, -1, -v, -w, /tmp/graph6252720648775575075.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 17:50:30] [INFO ] Decomposing Gal with order
[2021-05-15 17:50:30] [INFO ] Computing Do-Not-Accords matrix : 552 transitions.
[2021-05-15 17:50:30] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 17:50:30] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3187993380966958348
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/ltsmin3187993380966958348]
[2021-05-15 17:50:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 17:50:30] [INFO ] Removed a total of 93 redundant transitions.
[2021-05-15 17:50:30] [INFO ] Flatten gal took : 44 ms
[2021-05-15 17:50:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-15 17:50:30] [INFO ] Time to serialize gal into /tmp/LTLFireability1679565609907911179.gal : 5 ms
[2021-05-15 17:50:30] [INFO ] Time to serialize properties into /tmp/LTLFireability11864518194214782022.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/LTLFireability1679565609907911179.gal, -t, CGAL, -LTL, /tmp/LTLFireability11864518194214782022.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/LTLFireability1679565609907911179.gal -t CGAL -LTL /tmp/LTLFireability11864518194214782022.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((X((G(F("(i10.u157.p493!=1)")))||(G(("(i0.i0.i3.u22.p65!=1)")||(X(F("(i4.i0.i3.u85.p277!=1)"))))))))
Formula 0 simplified : !X(GF"(i10.u157.p493!=1)" | G("(i0.i0.i3.u22.p65!=1)" | XF"(i4.i0.i3.u85.p277!=1)"))
Compilation finished in 3335 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3187993380966958348]
Link finished in 58 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([](<>((LTLAPp0==true)))||[](((LTLAPp1==true)||X(<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3187993380966958348]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([](<>((LTLAPp0==true)))||[](((LTLAPp1==true)||X(<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3187993380966958348]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X((<>([]((LTLAPp3==true))) U ((LTLAPp4==true) U (LTLAPp5==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3187993380966958348]
LTSmin run took 545 ms.
FORMULA ShieldIIPt-PT-010B-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X(<>((LTLAPp6==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3187993380966958348]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X(<>((LTLAPp6==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3187993380966958348]
Retrying LTSmin with larger timeout 2056 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([](<>((LTLAPp0==true)))||[](((LTLAPp1==true)||X(<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3187993380966958348]
Detected timeout of ITS tools.
[2021-05-15 18:11:16] [INFO ] Applying decomposition
[2021-05-15 18:11:16] [INFO ] Flatten gal took : 43 ms
[2021-05-15 18:11:16] [INFO ] Decomposing Gal with order
[2021-05-15 18:11:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 18:11:16] [INFO ] Removed a total of 27 redundant transitions.
[2021-05-15 18:11:16] [INFO ] Flatten gal took : 91 ms
[2021-05-15 18:11:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-15 18:11:16] [INFO ] Time to serialize gal into /tmp/LTLFireability3055335407781207651.gal : 20 ms
[2021-05-15 18:11:19] [INFO ] Time to serialize properties into /tmp/LTLFireability10335732474117252506.ltl : 3060 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/LTLFireability3055335407781207651.gal, -t, CGAL, -LTL, /tmp/LTLFireability10335732474117252506.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/LTLFireability3055335407781207651.gal -t CGAL -LTL /tmp/LTLFireability10335732474117252506.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X((G(F("(i0.i0.i0.i1.u129.p493!=1)")))||(G(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u26.p65!=1)")||(X(F("(i0.i0.i0.i0.i0.i0.i1.i0.u77.p277!=1)"))))))))
Formula 0 simplified : !X(GF"(i0.i0.i0.i1.u129.p493!=1)" | G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u26.p65!=1)" | XF"(i0.i0.i0.i0.i0.i0.i1.i0.u77.p277!=1)"))
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t560, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u27.t508, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u27.t515, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u26.t520, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u26.t527, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u25.t532, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u25.t538, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u24.t542, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u24.t549, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.t552, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.u23.t553, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.t554, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u22.t555, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.t556, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u18.t559, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u214.t558, i0.i0.i0.i0.i0.i0.i0.i0.i1.u44.t454, i0.i0.i0.i0.i0.i0.i0.i0.i1.u44.t460, i0.i0.i0.i0.i0.i0.i0.i0.i1.u44.t461, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u43.t465, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u43.t472, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u42.t477, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u42.t483, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u41.t487, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u41.t494, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.t497, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.u40.t498, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.t499, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u39.t500, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.t501, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u35.t504, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u240.t503, i0.i0.i0.i0.i0.i0.i0.i1.u61.t398, i0.i0.i0.i0.i0.i0.i0.i1.u61.t405, i0.i0.i0.i0.i0.i0.i0.i1.i0.u60.t410, i0.i0.i0.i0.i0.i0.i0.i1.i0.u60.t417, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u59.t422, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u59.t428, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u58.t432, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u58.t439, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.t442, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.u57.t443, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.t444, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u56.t445, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.t446, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u52.t449, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u259.t448, i0.i0.i0.i0.i0.i0.i1.u78.t343, i0.i0.i0.i0.i0.i0.i1.u78.t350, i0.i0.i0.i0.i0.i0.i1.i0.u77.t355, i0.i0.i0.i0.i0.i0.i1.i0.u77.t362, i0.i0.i0.i0.i0.i0.i1.i0.i0.u76.t367, i0.i0.i0.i0.i0.i0.i1.i0.i0.u76.t373, i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u75.t377, i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u75.t384, i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.t387, i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.u74.t388, i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.t389, i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u73.t390, i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.t391, i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u69.t394, i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u183.t393, i0.i0.i0.i0.i0.i1.u95.t288, i0.i0.i0.i0.i0.i1.u95.t295, i0.i0.i0.i0.i0.i1.i0.u94.t300, i0.i0.i0.i0.i0.i1.i0.u94.t307, i0.i0.i0.i0.i0.i1.i0.i0.u93.t312, i0.i0.i0.i0.i0.i1.i0.i0.u93.t318, i0.i0.i0.i0.i0.i1.i0.i0.i0.u92.t322, i0.i0.i0.i0.i0.i1.i0.i0.i0.u92.t329, i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.t332, i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.u91.t333, i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.t334, i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u90.t335, i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.t336, i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u86.t339, i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u197.t338, i0.i0.i0.i0.i1.u112.t233, i0.i0.i0.i0.i1.u112.t239, i0.i0.i0.i0.i1.u112.t240, i0.i0.i0.i0.i1.u112.t241, i0.i0.i0.i0.i1.i0.u111.t245, i0.i0.i0.i0.i1.i0.u111.t251, i0.i0.i0.i0.i1.i0.u111.t252, i0.i0.i0.i0.i1.i0.u111.t253, i0.i0.i0.i0.i1.i0.i0.u110.t257, i0.i0.i0.i0.i1.i0.i0.u110.t263, i0.i0.i0.i0.i1.i0.i0.i0.u109.t267, i0.i0.i0.i0.i1.i0.i0.i0.u109.t274, i0.i0.i0.i0.i1.i0.i0.i0.i0.t277, i0.i0.i0.i0.i1.i0.i0.i0.i0.u108.t278, i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.t279, i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u107.t280, i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.t281, i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u103.t284, i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u205.t283, i0.i0.i0.i1.u129.t178, i0.i0.i0.i1.u129.t180, i0.i0.i0.i1.u129.t185, i0.i0.i0.i1.u129.t187, i0.i0.i0.i1.i0.u128.t190, i0.i0.i0.i1.i0.u128.t192, i0.i0.i0.i1.i0.u128.t197, i0.i0.i0.i1.i0.u128.t199, i0.i0.i0.i1.i0.i0.u127.t202, i0.i0.i0.i1.i0.i0.u127.t208, i0.i0.i0.i1.i0.i0.i0.u126.t212, i0.i0.i0.i1.i0.i0.i0.u126.t219, i0.i0.i0.i1.i0.i0.i0.i0.t222, i0.i0.i0.i1.i0.i0.i0.i0.u125.t223, i0.i0.i0.i1.i0.i0.i0.i0.i0.t224, i0.i0.i0.i1.i0.i0.i0.i0.i0.u124.t225, i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.t226, i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u120.t229, i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u241.t228, i0.i0.i1.u146.t123, i0.i0.i1.u146.t130, i0.i0.i1.i0.u145.t135, i0.i0.i1.i0.u145.t142, i0.i0.i1.i0.i0.u144.t148, i0.i0.i1.i0.i0.u144.t154, i0.i0.i1.i0.i0.i0.u143.t157, i0.i0.i1.i0.i0.i0.u143.t164, i0.i0.i1.i0.i0.i0.i0.t167, i0.i0.i1.i0.i0.i0.i0.u142.t168, i0.i0.i1.i0.i0.i0.i0.i0.t169, i0.i0.i1.i0.i0.i0.i0.i0.u141.t170, i0.i0.i1.i0.i0.i0.i0.i0.i0.t171, i0.i0.i1.i0.i0.i0.i0.i0.i0.u137.t174, i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u267.t173, i0.i1.u163.t68, i0.i1.u163.t75, i0.i1.i0.u162.t80, i0.i1.i0.u162.t87, i0.i1.i0.i0.u161.t92, i0.i1.i0.i0.u161.t98, i0.i1.i0.i0.i0.u160.t102, i0.i1.i0.i0.i0.u160.t104, i0.i1.i0.i0.i0.u160.t109, i0.i1.i0.i0.i0.u160.t111, i0.i1.i0.i0.i0.i0.t112, i0.i1.i0.i0.i0.i0.u159.t113, i0.i1.i0.i0.i0.i0.i0.t114, i0.i1.i0.i0.i0.i0.i0.u158.t115, i0.i1.i0.i0.i0.i0.i0.i0.t116, i0.i1.i0.i0.i0.i0.i0.i0.u154.t119, i0.i1.i0.i0.i0.i0.i0.i0.i1.u253.t118, i1.u180.t13, i1.u180.t19, i1.u180.t20, i1.i0.u179.t25, i1.i0.u179.t32, i1.i0.i0.u178.t37, i1.i0.i0.u178.t43, i1.i0.i0.i0.u177.t48, i1.i0.i0.i0.u177.t55, i1.i0.i0.i0.i0.t57, i1.i0.i0.i0.i0.u176.t58, i1.i0.i0.i0.i0.i0.t59, i1.i0.i0.i0.i0.i0.u175.t60, i1.i0.i0.i0.i0.i0.i0.t61, i1.i0.i0.i0.i0.i0.i0.u171.t64, i1.i0.i0.i0.i0.i0.i0.i1.u182.t63, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/389/163/552
Computing Next relation with stutter on 2.73368e+11 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: LTL layer: formula: X(([](<>((LTLAPp0==true)))||[](((LTLAPp1==true)||X(<>((LTLAPp2==true)))))))
pins2lts-mc-linux64( 2/ 8), 0.010: "X(([](<>((LTLAPp0==true)))||[](((LTLAPp1==true)||X(<>((LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.012: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.053: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.153: DFS-FIFO for weak LTL, using special progress label 560
pins2lts-mc-linux64( 0/ 8), 0.153: There are 561 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.153: State length is 603, there are 559 groups
pins2lts-mc-linux64( 0/ 8), 0.153: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.153: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.153: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.153: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.328: ~1 levels ~960 states ~5112 transitions
pins2lts-mc-linux64( 6/ 8), 0.351: ~1 levels ~1920 states ~12272 transitions
pins2lts-mc-linux64( 6/ 8), 0.381: ~1 levels ~3840 states ~24576 transitions
pins2lts-mc-linux64( 4/ 8), 0.456: ~1 levels ~7680 states ~60544 transitions
pins2lts-mc-linux64( 4/ 8), 0.553: ~1 levels ~15360 states ~123648 transitions
pins2lts-mc-linux64( 4/ 8), 0.991: ~1 levels ~30720 states ~265080 transitions
pins2lts-mc-linux64( 4/ 8), 1.824: ~1 levels ~61440 states ~564576 transitions
pins2lts-mc-linux64( 4/ 8), 3.334: ~1 levels ~122880 states ~1151176 transitions
pins2lts-mc-linux64( 4/ 8), 6.803: ~1 levels ~245760 states ~2495272 transitions
pins2lts-mc-linux64( 3/ 8), 13.571: ~1 levels ~491520 states ~4788832 transitions
pins2lts-mc-linux64( 3/ 8), 27.307: ~1 levels ~983040 states ~9999424 transitions
pins2lts-mc-linux64( 0/ 8), 56.329: ~1 levels ~1966080 states ~22131024 transitions
pins2lts-mc-linux64( 3/ 8), 117.748: ~1 levels ~3932160 states ~43593528 transitions
pins2lts-mc-linux64( 3/ 8), 240.739: ~1 levels ~7864320 states ~90193592 transitions
pins2lts-mc-linux64( 3/ 8), 501.756: ~1 levels ~15728640 states ~188584064 transitions
pins2lts-mc-linux64( 3/ 8), 1028.078: ~1 levels ~31457280 states ~392243584 transitions
pins2lts-mc-linux64( 6/ 8), 1960.875: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1960.911:
pins2lts-mc-linux64( 0/ 8), 1960.911: mean standard work distribution: 1.2% (states) 2.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 1960.911:
pins2lts-mc-linux64( 0/ 8), 1960.911: Explored 56908977 states 784431742 transitions, fanout: 13.784
pins2lts-mc-linux64( 0/ 8), 1960.911: Total exploration time 1960.750 sec (1960.700 sec minimum, 1960.719 sec on average)
pins2lts-mc-linux64( 0/ 8), 1960.911: States per second: 29024, Transitions per second: 400067
pins2lts-mc-linux64( 0/ 8), 1960.911:
pins2lts-mc-linux64( 0/ 8), 1960.911: Progress states detected: 134217192
pins2lts-mc-linux64( 0/ 8), 1960.911: Redundant explorations: -57.5994
pins2lts-mc-linux64( 0/ 8), 1960.912:
pins2lts-mc-linux64( 0/ 8), 1960.912: Queue width: 8B, total height: 128161617, memory: 977.80MB
pins2lts-mc-linux64( 0/ 8), 1960.912: Tree memory: 1171.9MB, 9.2 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 1960.912: Tree fill ratio (roots/leafs): 99.0%/57.0%
pins2lts-mc-linux64( 0/ 8), 1960.912: Stored 559 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1960.912: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1960.912: Est. total memory use: 2149.7MB (~2001.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([](<>((LTLAPp0==true)))||[](((LTLAPp1==true)||X(<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3187993380966958348]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([](<>((LTLAPp0==true)))||[](((LTLAPp1==true)||X(<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3187993380966958348]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-15 18:32:06] [INFO ] Flatten gal took : 15 ms
[2021-05-15 18:32:06] [INFO ] Input system was already deterministic with 552 transitions.
[2021-05-15 18:32:06] [INFO ] Transformed 602 places.
[2021-05-15 18:32:06] [INFO ] Transformed 552 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
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-15 18:32:06] [INFO ] Time to serialize gal into /tmp/LTLFireability5919854002967799527.gal : 1 ms
[2021-05-15 18:32:06] [INFO ] Time to serialize properties into /tmp/LTLFireability10998869405224720653.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/LTLFireability5919854002967799527.gal, -t, CGAL, -LTL, /tmp/LTLFireability10998869405224720653.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/LTLFireability5919854002967799527.gal -t CGAL -LTL /tmp/LTLFireability10998869405224720653.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 : !((X((G(F("(p493!=1)")))||(G(("(p65!=1)")||(X(F("(p277!=1)"))))))))
Formula 0 simplified : !X(GF"(p493!=1)" | G("(p65!=1)" | XF"(p277!=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="ShieldIIPt-PT-010B"
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 ShieldIIPt-PT-010B, 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 r216-tall-162098205100429"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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