fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r102-smll-162075331400285
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for GPPP-PT-C1000N0000000100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16237.899 3600000.00 3836634.00 64959.70 FFFF?FFF?TTFTFFF normal

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.r102-smll-162075331400285.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPPP-PT-C1000N0000000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331400285
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 11:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 11:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 22 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 22 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K May 5 16:51 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 GPPP-PT-C1000N0000000100-00
FORMULA_NAME GPPP-PT-C1000N0000000100-01
FORMULA_NAME GPPP-PT-C1000N0000000100-02
FORMULA_NAME GPPP-PT-C1000N0000000100-03
FORMULA_NAME GPPP-PT-C1000N0000000100-04
FORMULA_NAME GPPP-PT-C1000N0000000100-05
FORMULA_NAME GPPP-PT-C1000N0000000100-06
FORMULA_NAME GPPP-PT-C1000N0000000100-07
FORMULA_NAME GPPP-PT-C1000N0000000100-08
FORMULA_NAME GPPP-PT-C1000N0000000100-09
FORMULA_NAME GPPP-PT-C1000N0000000100-10
FORMULA_NAME GPPP-PT-C1000N0000000100-11
FORMULA_NAME GPPP-PT-C1000N0000000100-12
FORMULA_NAME GPPP-PT-C1000N0000000100-13
FORMULA_NAME GPPP-PT-C1000N0000000100-14
FORMULA_NAME GPPP-PT-C1000N0000000100-15

=== Now, execution of the tool begins

BK_START 1621234985350

Running Version 0
[2021-05-17 07:03:07] [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-17 07:03:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 07:03:07] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-17 07:03:08] [INFO ] Transformed 33 places.
[2021-05-17 07:03:08] [INFO ] Transformed 22 transitions.
[2021-05-17 07:03:08] [INFO ] Parsed PT model containing 33 places and 22 transitions in 98 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Support contains 29 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 28 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:03:08] [INFO ] Invariants computation overflowed in 7 ms
[2021-05-17 07:03:08] [INFO ] Dead Transitions using invariants and state equation in 196 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:03:08] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 07:03:08] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 07:03:08] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 07:03:08] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 107 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:03:08] [INFO ] Invariants computation overflowed in 6 ms
[2021-05-17 07:03:08] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:03:08] [INFO ] Invariants computation overflowed in 4 ms
[2021-05-17 07:03:08] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
[2021-05-17 07:03:08] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 07:03:08] [INFO ] Flatten gal took : 39 ms
FORMULA GPPP-PT-C1000N0000000100-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 07:03:08] [INFO ] Flatten gal took : 8 ms
[2021-05-17 07:03:08] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100063 steps, including 34 resets, run finished after 145 ms. (steps per millisecond=690 ) properties (out of 17) seen :16
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:03:09] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:03:09] [INFO ] [Real]Absence check using state equation in 19 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((F(p1)||p0))||G(p2)))], workingDir=/home/mcc/execution]
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 31 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 31 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 30 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 27 transition count 18
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 2 with 2 rules applied. Total rules applied 11 place count 26 transition count 17
Applied a total of 11 rules in 18 ms. Remains 26 /32 variables (removed 6) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 07:03:09] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 07:03:09] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 07:03:09] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:09] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 07:03:09] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:09] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [0, 2, 16, 19]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 124 ms to find 4 implicit places.
[2021-05-17 07:03:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 22 cols
[2021-05-17 07:03:09] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:09] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 22/32 places, 17/22 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 15
Applied a total of 4 rules in 4 ms. Remains 20 /22 variables (removed 2) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 20 cols
[2021-05-17 07:03:09] [INFO ] Invariants computation overflowed in 9 ms
[2021-05-17 07:03:09] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-17 07:03:09] [INFO ] Invariants computation overflowed in 5 ms
[2021-05-17 07:03:09] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 20/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-00 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s3 1) (GEQ s16 2000)), p0:(OR (LT s1 2) (LT s10 1) (LT s15 1)), p1:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2812 steps with 45 reset in 42 ms.
FORMULA GPPP-PT-C1000N0000000100-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-00 finished in 737 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 31 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 31 transition count 20
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 30 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 27 transition count 18
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 2 with 2 rules applied. Total rules applied 11 place count 26 transition count 17
Applied a total of 11 rules in 10 ms. Remains 26 /32 variables (removed 6) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 07:03:09] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:10] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 07:03:10] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:10] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 07:03:10] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:03:10] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [0, 2, 16, 19]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 158 ms to find 4 implicit places.
[2021-05-17 07:03:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 22 cols
[2021-05-17 07:03:10] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:03:10] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 22/32 places, 17/22 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 15
Applied a total of 4 rules in 7 ms. Remains 20 /22 variables (removed 2) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 20 cols
[2021-05-17 07:03:10] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:03:10] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-17 07:03:10] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:10] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 20/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-01 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 2) (LT s10 1) (LT s15 1)), p1:(LT s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 47 reset in 290 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 1 ms.
FORMULA GPPP-PT-C1000N0000000100-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-01 finished in 763 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0)) U (F(p1)&&(p2 U !p3))))], workingDir=/home/mcc/execution]
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:03:10] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:03:10] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:03:10] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:10] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:03:10] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:10] [INFO ] Implicit Places using invariants and state equation in 80 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 119 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:03:10] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:10] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:03:10] [INFO ] Invariants computation overflowed in 5 ms
[2021-05-17 07:03:10] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p1) p3), (NOT p0), (NOT p1), p3, true, p3]
Running random walk in product with property : GPPP-PT-C1000N0000000100-02 automaton TGBA [mat=[[{ cond=(AND p3 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), acceptance={0} source=0 dest: 2}, { cond=(AND p3 p2), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p3 (NOT p2) p0), acceptance={0} source=3 dest: 0}, { cond=(AND p3 (NOT p2) p0), acceptance={0} source=3 dest: 1}, { cond=(AND p3 p2 p0), acceptance={0} source=3 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND p3 p2 (NOT p0)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p3 p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(OR (LT s2 2) (LT s13 1) (LT s25 1)), p2:(GEQ s17 1), p1:(AND (GEQ s7 1) (GEQ s8 1)), p0:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-02 finished in 521 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:03:11] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:03:11] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:03:11] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 07:03:11] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:03:11] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 07:03:11] [INFO ] Implicit Places using invariants and state equation in 69 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 94 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 07:03:11] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:11] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 07:03:11] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:11] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-03 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:(OR (LT s16 1) (LT s17 1) (AND (GEQ s13 1) (GEQ s25 3000)))], 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 34 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-03 finished in 280 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 25 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 transition count 15
Applied a total of 15 rules in 9 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 23 cols
[2021-05-17 07:03:11] [INFO ] Invariants computation overflowed in 8 ms
[2021-05-17 07:03:11] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2021-05-17 07:03:11] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:03:11] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2021-05-17 07:03:11] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 07:03:11] [INFO ] Implicit Places using invariants and state equation in 86 ms returned [2, 12]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 140 ms to find 2 implicit places.
[2021-05-17 07:03:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 21 cols
[2021-05-17 07:03:11] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:03:11] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 21/32 places, 15/22 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 19 transition count 13
Applied a total of 4 rules in 4 ms. Remains 19 /21 variables (removed 2) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 19 cols
[2021-05-17 07:03:11] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:03:11] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2021-05-17 07:03:11] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 07:03:11] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 19/32 places, 13/22 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-04 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:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 158 reset in 194 ms.
Product exploration explored 100000 steps with 164 reset in 195 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 135 reset in 99 ms.
Product exploration explored 100000 steps with 166 reset in 122 ms.
[2021-05-17 07:03:12] [INFO ] Flatten gal took : 4 ms
[2021-05-17 07:03:12] [INFO ] Flatten gal took : 3 ms
[2021-05-17 07:03:12] [INFO ] Time to serialize gal into /tmp/LTL537103548222508561.gal : 1 ms
[2021-05-17 07:03:12] [INFO ] Time to serialize properties into /tmp/LTL3972368203170644240.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/LTL537103548222508561.gal, -t, CGAL, -LTL, /tmp/LTL3972368203170644240.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/LTL537103548222508561.gal -t CGAL -LTL /tmp/LTL3972368203170644240.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(start<1)"))))
Formula 0 simplified : !GF"(start<1)"
Detected timeout of ITS tools.
[2021-05-17 07:03:27] [INFO ] Flatten gal took : 4 ms
[2021-05-17 07:03:27] [INFO ] Applying decomposition
[2021-05-17 07:03:27] [INFO ] Flatten gal took : 4 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/graph1714048104109575509.txt, -o, /tmp/graph1714048104109575509.bin, -w, /tmp/graph1714048104109575509.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/graph1714048104109575509.bin, -l, -1, -v, -w, /tmp/graph1714048104109575509.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:03:27] [INFO ] Decomposing Gal with order
[2021-05-17 07:03:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:03:27] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-17 07:03:27] [INFO ] Flatten gal took : 44 ms
[2021-05-17 07:03:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 07:03:27] [INFO ] Time to serialize gal into /tmp/LTL3438449992792486282.gal : 1 ms
[2021-05-17 07:03:27] [INFO ] Time to serialize properties into /tmp/LTL8637540626338037408.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/LTL3438449992792486282.gal, -t, CGAL, -LTL, /tmp/LTL8637540626338037408.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/LTL3438449992792486282.gal -t CGAL -LTL /tmp/LTL8637540626338037408.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("(i2.u2.start<1)"))))
Formula 0 simplified : !GF"(i2.u2.start<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7386494407281354036
[2021-05-17 07:03:42] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7386494407281354036
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/ltsmin7386494407281354036]
Compilation finished in 395 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7386494407281354036]
Link finished in 61 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, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7386494407281354036]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C1000N0000000100-04 finished in 46374 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X((!p0&&G(p1)))) U (F(G(!p3))&&p2)))], workingDir=/home/mcc/execution]
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:03:57] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:57] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:03:57] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:03:57] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:03:57] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:03:58] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 82 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:03:58] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:58] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:03:58] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:58] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) p3), (OR (NOT p1) p0), p3, (OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-07 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=p3, acceptance={0} source=2 dest: 2}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s5 2) (GEQ s2 2) (GEQ s13 1) (GEQ s25 1)), p3:(LT s10 1), p0:(AND (GEQ s6 1) (GEQ s26 2000)), p1:(OR (LT s1 1) (LT s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-07 finished in 395 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 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:03:58] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:03:58] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:03:58] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:03:58] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:03:58] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 07:03:58] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 106 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:03:58] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:03:58] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:03:58] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 07:03:58] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 156 ms :[p0, p0, p0, p0]
Running random walk in product with property : GPPP-PT-C1000N0000000100-08 automaton TGBA [mat=[[{ cond=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:(LT s10 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 8492 reset in 189 ms.
Product exploration explored 100000 steps with 8504 reset in 128 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 161 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 8434 reset in 105 ms.
Product exploration explored 100000 steps with 8457 reset in 121 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 176 ms :[p0, p0, p0, p0]
Support contains 1 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 30 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 22
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 29 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 21
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 29 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 28 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 28 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 28 transition count 20
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 12 ms. Remains 28 /30 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 28 cols
[2021-05-17 07:03:59] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:03:59] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
[2021-05-17 07:03:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2021-05-17 07:03:59] [INFO ] Invariants computation overflowed in 4 ms
[2021-05-17 07:03:59] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 20/22 transitions.
Product exploration explored 100000 steps with 8676 reset in 363 ms.
Product exploration explored 100000 steps with 8676 reset in 249 ms.
[2021-05-17 07:04:00] [INFO ] Flatten gal took : 4 ms
[2021-05-17 07:04:00] [INFO ] Flatten gal took : 10 ms
[2021-05-17 07:04:00] [INFO ] Time to serialize gal into /tmp/LTL4094095222555003562.gal : 2 ms
[2021-05-17 07:04:00] [INFO ] Time to serialize properties into /tmp/LTL5724363142386951183.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/LTL4094095222555003562.gal, -t, CGAL, -LTL, /tmp/LTL5724363142386951183.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/LTL4094095222555003562.gal -t CGAL -LTL /tmp/LTL5724363142386951183.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(GAP>=1)"))))))
Formula 0 simplified : !XXXF"(GAP>=1)"
Detected timeout of ITS tools.
[2021-05-17 07:04:15] [INFO ] Flatten gal took : 3 ms
[2021-05-17 07:04:15] [INFO ] Applying decomposition
[2021-05-17 07:04:15] [INFO ] Flatten gal took : 5 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/graph3244676015124536366.txt, -o, /tmp/graph3244676015124536366.bin, -w, /tmp/graph3244676015124536366.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/graph3244676015124536366.bin, -l, -1, -v, -w, /tmp/graph3244676015124536366.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:04:15] [INFO ] Decomposing Gal with order
[2021-05-17 07:04:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:04:15] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-17 07:04:15] [INFO ] Flatten gal took : 7 ms
[2021-05-17 07:04:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 07:04:15] [INFO ] Time to serialize gal into /tmp/LTL15935749617871192810.gal : 11 ms
[2021-05-17 07:04:15] [INFO ] Time to serialize properties into /tmp/LTL7424761574961505108.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/LTL15935749617871192810.gal, -t, CGAL, -LTL, /tmp/LTL7424761574961505108.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/LTL15935749617871192810.gal -t CGAL -LTL /tmp/LTL7424761574961505108.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(i1.u3.GAP>=1)"))))))
Formula 0 simplified : !XXXF"(i1.u3.GAP>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5772548263235766306
[2021-05-17 07:04:30] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5772548263235766306
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/ltsmin5772548263235766306]
Compilation finished in 208 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5772548263235766306]
Link finished in 31 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(X(X(<>((LTLAPp0==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5772548263235766306]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C1000N0000000100-08 finished in 47428 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(!p0)&&X(F(!p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:04:45] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 07:04:45] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:04:45] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:04:45] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:04:45] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 07:04:45] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 81 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:04:45] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:04:45] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:04:45] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 07:04:45] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 142 ms :[p0, (OR p1 p0), (OR p0 p1), (OR p1 p0), true]
Running random walk in product with property : GPPP-PT-C1000N0000000100-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s15 1), p1:(OR (LT s2 2) (LT s13 1) (LT s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-11 finished in 344 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1||G(p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 27 transition count 17
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 2 with 2 rules applied. Total rules applied 11 place count 26 transition count 16
Applied a total of 11 rules in 8 ms. Remains 26 /32 variables (removed 6) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 26 cols
[2021-05-17 07:04:46] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:04:46] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
// Phase 1: matrix 16 rows 26 cols
[2021-05-17 07:04:46] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:04:46] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 16 rows 26 cols
[2021-05-17 07:04:46] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:04:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 07:04:46] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [0, 2, 16, 19]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 82 ms to find 4 implicit places.
[2021-05-17 07:04:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-17 07:04:46] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:04:46] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 22/32 places, 16/22 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 14
Applied a total of 4 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 07:04:46] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:04:46] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 07:04:46] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:04:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 07:04:46] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 20/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 41 ms :[true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000000100-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (OR (LT s5 1) (LT s17 1)) (OR (LT s2 1) (LT s3 1))), p0:(OR (LT s5 1) (LT s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000100-12 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property GPPP-PT-C1000N0000000100-12 finished in 229 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(G(p0))) U G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:04:46] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:04:46] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:04:46] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:04:46] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 07:04:46] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:04:46] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 101 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:04:46] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:04:46] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 07:04:46] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:04:46] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 5}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s11 1)), p0:(OR (LT s6 1) (LT s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-13 finished in 489 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 31 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 31 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 30 transition count 20
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 2 with 2 rules applied. Total rules applied 6 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 28 transition count 18
Applied a total of 8 rules in 8 ms. Remains 28 /32 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 28 cols
[2021-05-17 07:04:46] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:04:46] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
// Phase 1: matrix 18 rows 28 cols
[2021-05-17 07:04:46] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:04:46] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 18 rows 28 cols
[2021-05-17 07:04:46] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:04:46] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [0, 2, 18, 21]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 102 ms to find 4 implicit places.
[2021-05-17 07:04:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2021-05-17 07:04:46] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:04:46] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 24/32 places, 18/22 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Applied a total of 4 rules in 3 ms. Remains 22 /24 variables (removed 2) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-17 07:04:46] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:04:46] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-17 07:04:46] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:04:47] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 22/32 places, 16/22 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-14 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=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s19 1)), p1:(AND (LT s14 1) (GEQ s4 2))], 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 2907 steps with 0 reset in 6 ms.
FORMULA GPPP-PT-C1000N0000000100-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-14 finished in 406 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 2 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 27 transition count 18
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 25 transition count 17
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 13 place count 24 transition count 16
Applied a total of 13 rules in 7 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2021-05-17 07:04:47] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:04:47] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2021-05-17 07:04:47] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:04:47] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2021-05-17 07:04:47] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 07:04:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 07:04:47] [INFO ] Implicit Places using invariants and state equation in 97 ms returned [0, 2, 12, 17]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 137 ms to find 4 implicit places.
[2021-05-17 07:04:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 20 cols
[2021-05-17 07:04:47] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:04:47] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 20/32 places, 16/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 15
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 2 with 2 rules applied. Total rules applied 4 place count 18 transition count 14
Applied a total of 4 rules in 3 ms. Remains 18 /20 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 18 cols
[2021-05-17 07:04:47] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:04:47] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-17 07:04:47] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 07:04:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 07:04:47] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-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:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-15 finished in 363 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-17 07:04:47] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin21928791870867600
[2021-05-17 07:04:47] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2021-05-17 07:04:47] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 07:04:47] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2021-05-17 07:04:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 07:04:47] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2021-05-17 07:04:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 07:04:47] [INFO ] Flatten gal took : 7 ms
[2021-05-17 07:04:47] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin21928791870867600
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/ltsmin21928791870867600]
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/graph8354504167767875362.txt, -o, /tmp/graph8354504167767875362.bin, -w, /tmp/graph8354504167767875362.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/graph8354504167767875362.bin, -l, -1, -v, -w, /tmp/graph8354504167767875362.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:04:47] [INFO ] Decomposing Gal with order
[2021-05-17 07:04:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:04:47] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-17 07:04:47] [INFO ] Flatten gal took : 9 ms
[2021-05-17 07:04:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 07:04:47] [INFO ] Time to serialize gal into /tmp/LTLFireability3187027854771636302.gal : 3 ms
[2021-05-17 07:04:47] [INFO ] Time to serialize properties into /tmp/LTLFireability12518977827120163317.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/LTLFireability3187027854771636302.gal, -t, CGAL, -LTL, /tmp/LTLFireability12518977827120163317.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/LTLFireability3187027854771636302.gal -t CGAL -LTL /tmp/LTLFireability12518977827120163317.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((G(F("(i2.u6.start<1)"))))
Formula 0 simplified : !GF"(i2.u6.start<1)"
Compilation finished in 421 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin21928791870867600]
Link finished in 45 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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin21928791870867600]
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( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 2/ 8), 0.004: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Initializing POR dependencies: labels 24, guards 22
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed 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( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.166: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.209: There are 26 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.209: State length is 33, there are 25 groups
pins2lts-mc-linux64( 0/ 8), 0.209: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.209: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.209: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.209: Visible groups: 2 / 25, labels: 1 / 26
pins2lts-mc-linux64( 0/ 8), 0.209: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.209: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.356: [Blue] ~120 levels ~960 states ~1992 transitions
pins2lts-mc-linux64( 7/ 8), 0.369: [Blue] ~240 levels ~1920 states ~3096 transitions
pins2lts-mc-linux64( 4/ 8), 0.372: [Blue] ~480 levels ~3840 states ~10392 transitions
pins2lts-mc-linux64( 5/ 8), 0.386: [Blue] ~960 levels ~7680 states ~19592 transitions
pins2lts-mc-linux64( 4/ 8), 0.394: [Blue] ~1920 levels ~15360 states ~26520 transitions
pins2lts-mc-linux64( 6/ 8), 0.427: [Blue] ~3312 levels ~30720 states ~41984 transitions
pins2lts-mc-linux64( 6/ 8), 0.479: [Blue] ~3312 levels ~61440 states ~78632 transitions
pins2lts-mc-linux64( 6/ 8), 0.583: [Blue] ~3312 levels ~122880 states ~152144 transitions
pins2lts-mc-linux64( 6/ 8), 0.834: [Blue] ~3312 levels ~245760 states ~299312 transitions
pins2lts-mc-linux64( 2/ 8), 1.208: [Blue] ~2818 levels ~491520 states ~596824 transitions
pins2lts-mc-linux64( 6/ 8), 1.819: [Blue] ~3312 levels ~983040 states ~1183136 transitions
pins2lts-mc-linux64( 6/ 8), 3.043: [Blue] ~3312 levels ~1966080 states ~2362048 transitions
pins2lts-mc-linux64( 6/ 8), 5.814: [Blue] ~3312 levels ~3932160 states ~4841392 transitions
pins2lts-mc-linux64( 2/ 8), 11.310: [Blue] ~2873 levels ~7864320 states ~9436352 transitions
pins2lts-mc-linux64( 6/ 8), 23.972: [Blue] ~3312 levels ~15728640 states ~21351160 transitions
pins2lts-mc-linux64( 2/ 8), 50.625: [Blue] ~3617 levels ~31457280 states ~43501120 transitions
pins2lts-mc-linux64( 4/ 8), 104.501: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 104.525:
pins2lts-mc-linux64( 0/ 8), 104.525: Explored 43167126 states 63029265 transitions, fanout: 1.460
pins2lts-mc-linux64( 0/ 8), 104.525: Total exploration time 104.310 sec (104.280 sec minimum, 104.292 sec on average)
pins2lts-mc-linux64( 0/ 8), 104.525: States per second: 413835, Transitions per second: 604250
pins2lts-mc-linux64( 0/ 8), 104.525:
pins2lts-mc-linux64( 0/ 8), 104.525: State space has 42687013 states, 1 are accepting
pins2lts-mc-linux64( 0/ 8), 104.525: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 104.525: blue states: 43167126 (101.12%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 104.526: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 104.526: all-red states: 1 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 104.526:
pins2lts-mc-linux64( 0/ 8), 104.526: Total memory used for local state coloring: 0.4MB
pins2lts-mc-linux64( 0/ 8), 104.526:
pins2lts-mc-linux64( 0/ 8), 104.526: Queue width: 8B, total height: 27793, memory: 0.21MB
pins2lts-mc-linux64( 0/ 8), 104.526: Tree memory: 581.7MB, 14.3 B/state, compr.: 10.7%
pins2lts-mc-linux64( 0/ 8), 104.526: Tree fill ratio (roots/leafs): 31.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 104.526: Stored 22 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 104.526: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 104.526: Est. total memory use: 581.9MB (~1024.2MB 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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin21928791870867600]
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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin21928791870867600]
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:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-17 07:25:20] [INFO ] Flatten gal took : 3 ms
[2021-05-17 07:25:20] [INFO ] Time to serialize gal into /tmp/LTLFireability2693954564842688387.gal : 2 ms
[2021-05-17 07:25:20] [INFO ] Time to serialize properties into /tmp/LTLFireability3233408196777476296.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/LTLFireability2693954564842688387.gal, -t, CGAL, -LTL, /tmp/LTLFireability3233408196777476296.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/LTLFireability2693954564842688387.gal -t CGAL -LTL /tmp/LTLFireability3233408196777476296.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((G(F("(start<1)"))))
Formula 0 simplified : !GF"(start<1)"
Detected timeout of ITS tools.
[2021-05-17 07:45:56] [INFO ] Flatten gal took : 342 ms
[2021-05-17 07:45:56] [INFO ] Input system was already deterministic with 22 transitions.
[2021-05-17 07:45:56] [INFO ] Transformed 32 places.
[2021-05-17 07:45:56] [INFO ] Transformed 22 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-17 07:45:57] [INFO ] Time to serialize gal into /tmp/LTLFireability9008753934837111577.gal : 8 ms
[2021-05-17 07:45:57] [INFO ] Time to serialize properties into /tmp/LTLFireability11860513406241833107.ltl : 5 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/LTLFireability9008753934837111577.gal, -t, CGAL, -LTL, /tmp/LTLFireability11860513406241833107.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/LTLFireability9008753934837111577.gal -t CGAL -LTL /tmp/LTLFireability11860513406241833107.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(start<1)"))))
Formula 0 simplified : !GF"(start<1)"
Reverse transition relation is NOT exact ! Due to transitions t8, t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :1/19/2/22
Computing Next relation with stutter on 4 deadlock states

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="GPPP-PT-C1000N0000000100"
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 GPPP-PT-C1000N0000000100, 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 r102-smll-162075331400285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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