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-162075331300252.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-C0100N0000001000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331300252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 202K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K 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.9K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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.6K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 22 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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-C0100N0000001000-00
FORMULA_NAME GPPP-PT-C0100N0000001000-01
FORMULA_NAME GPPP-PT-C0100N0000001000-02
FORMULA_NAME GPPP-PT-C0100N0000001000-03
FORMULA_NAME GPPP-PT-C0100N0000001000-04
FORMULA_NAME GPPP-PT-C0100N0000001000-05
FORMULA_NAME GPPP-PT-C0100N0000001000-06
FORMULA_NAME GPPP-PT-C0100N0000001000-07
FORMULA_NAME GPPP-PT-C0100N0000001000-08
FORMULA_NAME GPPP-PT-C0100N0000001000-09
FORMULA_NAME GPPP-PT-C0100N0000001000-10
FORMULA_NAME GPPP-PT-C0100N0000001000-11
FORMULA_NAME GPPP-PT-C0100N0000001000-12
FORMULA_NAME GPPP-PT-C0100N0000001000-13
FORMULA_NAME GPPP-PT-C0100N0000001000-14
FORMULA_NAME GPPP-PT-C0100N0000001000-15

=== Now, execution of the tool begins

BK_START 1621224412677

Running Version 0
[2021-05-17 04:06:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 04:06:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 04:06:55] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-17 04:06:55] [INFO ] Transformed 33 places.
[2021-05-17 04:06:55] [INFO ] Transformed 22 transitions.
[2021-05-17 04:06:55] [INFO ] Parsed PT model containing 33 places and 22 transitions in 94 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 04:06:55] [INFO ] Initial state test concluded for 1 properties.
FORMULA GPPP-PT-C0100N0000001000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000001000-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000001000-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 14 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 04:06:55] [INFO ] Computed 12 place invariants in 12 ms
[2021-05-17 04:06:55] [INFO ] Dead Transitions using invariants and state equation in 188 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:06:55] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-17 04:06:55] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:06:55] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-17 04:06:55] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:06:55] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 04:06:55] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 22/22 transitions.
[2021-05-17 04:06:56] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 04:06:56] [INFO ] Flatten gal took : 33 ms
FORMULA GPPP-PT-C0100N0000001000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000001000-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000001000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 04:06:56] [INFO ] Flatten gal took : 9 ms
[2021-05-17 04:06:56] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100321 steps, including 34 resets, run finished after 198 ms. (steps per millisecond=506 ) properties (out of 24) seen :18
Running SMT prover for 6 properties.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:06:56] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 04:06:56] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-17 04:06:56] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 04:06:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:06:56] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-17 04:06:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 04:06:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 04:06:58] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2172 ms returned sat
[2021-05-17 04:06:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 04:06:59] [INFO ] [Nat]Absence check using state equation in 901 ms returned unsat
[2021-05-17 04:06:59] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 04:06:59] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 04:06:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:06:59] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2021-05-17 04:06:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 04:06:59] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 04:06:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:06:59] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2021-05-17 04:06:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 04:06:59] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2021-05-17 04:06:59] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-17 04:06:59] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2021-05-17 04:06:59] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 04:06:59] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 10 simplifications.
[2021-05-17 04:06:59] [INFO ] Initial state test concluded for 2 properties.
FORMULA GPPP-PT-C0100N0000001000-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000001000-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000001000-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 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 32 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 31 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 31 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 30 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 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Applied a total of 10 rules in 18 ms. Remains 27 /33 variables (removed 6) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 27 cols
[2021-05-17 04:06:59] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 04:06:59] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 17 rows 27 cols
[2021-05-17 04:06:59] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-17 04:07:00] [INFO ] Implicit Places using invariants in 69 ms returned [1, 2, 3, 15]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 76 ms to find 4 implicit places.
[2021-05-17 04:07:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-17 04:07:00] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 04:07:00] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 23/33 places, 17/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 23 transition count 16
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 22 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 21 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 21 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 20 transition count 14
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 3 with 2 rules applied. Total rules applied 8 place count 19 transition count 13
Applied a total of 8 rules in 12 ms. Remains 19 /23 variables (removed 4) and now considering 13/17 (removed 4) transitions.
// Phase 1: matrix 13 rows 19 cols
[2021-05-17 04:07:00] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-17 04:07:00] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2021-05-17 04:07:00] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 04:07:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 04:07:00] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 135 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 18/33 places, 13/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 18 /18 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2021-05-17 04:07:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 13 rows 18 cols
[2021-05-17 04:07:00] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 04:07:00] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 3 iterations. Remains : 18/33 places, 13/22 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s15 s1) (LEQ s9 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0100N0000001000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-00 finished in 697 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 5 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 1 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 04:07:00] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 04:07:00] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:07:00] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-17 04:07:00] [INFO ] Implicit Places using invariants in 62 ms returned [1, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 65 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:07:00] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-17 04:07:00] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:07:00] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:07:00] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-02 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:(AND (GT s11 s17) (GT 2 s13) (LEQ s2 s25))], 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 GPPP-PT-C0100N0000001000-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-02 finished in 328 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 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 32 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 31 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 31 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 30 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 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 23 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 04:07:00] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 04:07:00] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 04:07:00] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 04:07:01] [INFO ] Implicit Places using invariants in 53 ms returned [1, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 55 ms to find 4 implicit places.
[2021-05-17 04:07:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-17 04:07:01] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-17 04:07:01] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 20/33 places, 15/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 18 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 18 transition count 12
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 17 transition count 12
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 10 place count 15 transition count 10
Applied a total of 10 rules in 7 ms. Remains 15 /20 variables (removed 5) and now considering 10/15 (removed 5) transitions.
// Phase 1: matrix 10 rows 15 cols
[2021-05-17 04:07:01] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 04:07:01] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 10 rows 15 cols
[2021-05-17 04:07:01] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 04:07:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 04:07:01] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 87 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 14/33 places, 10/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2021-05-17 04:07:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 14 cols
[2021-05-17 04:07:01] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 04:07:01] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 3 iterations. Remains : 14/33 places, 10/22 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 120 reset in 398 ms.
Product exploration explored 100000 steps with 120 reset in 217 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 120 reset in 131 ms.
Product exploration explored 100000 steps with 120 reset in 335 ms.
[2021-05-17 04:07:02] [INFO ] Flatten gal took : 7 ms
[2021-05-17 04:07:02] [INFO ] Flatten gal took : 3 ms
[2021-05-17 04:07:02] [INFO ] Time to serialize gal into /tmp/LTL8561889019109091598.gal : 1 ms
[2021-05-17 04:07:02] [INFO ] Time to serialize properties into /tmp/LTL5714920402854614113.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/LTL8561889019109091598.gal, -t, CGAL, -LTL, /tmp/LTL5714920402854614113.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/LTL8561889019109091598.gal -t CGAL -LTL /tmp/LTL5714920402854614113.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(b2>=2)"))))
Formula 0 simplified : !FG"(b2>=2)"
Detected timeout of ITS tools.
[2021-05-17 04:07:17] [INFO ] Flatten gal took : 5 ms
[2021-05-17 04:07:17] [INFO ] Applying decomposition
[2021-05-17 04:07:17] [INFO ] Flatten gal took : 3 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/graph15210125541575089159.txt, -o, /tmp/graph15210125541575089159.bin, -w, /tmp/graph15210125541575089159.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/graph15210125541575089159.bin, -l, -1, -v, -w, /tmp/graph15210125541575089159.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 04:07:17] [INFO ] Decomposing Gal with order
[2021-05-17 04:07:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 04:07:17] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-17 04:07:17] [INFO ] Flatten gal took : 62 ms
[2021-05-17 04:07:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2021-05-17 04:07:17] [INFO ] Time to serialize gal into /tmp/LTL7129496822735477113.gal : 4 ms
[2021-05-17 04:07:17] [INFO ] Time to serialize properties into /tmp/LTL9959181219772538339.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/LTL7129496822735477113.gal, -t, CGAL, -LTL, /tmp/LTL9959181219772538339.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/LTL7129496822735477113.gal -t CGAL -LTL /tmp/LTL9959181219772538339.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("(i0.u2.b2>=2)"))))
Formula 0 simplified : !FG"(i0.u2.b2>=2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9254349898716096500
[2021-05-17 04:07:32] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9254349898716096500
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/ltsmin9254349898716096500]
Compilation finished in 305 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9254349898716096500]
Link finished in 50 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/ltsmin9254349898716096500]
LTSmin run took 295 ms.
FORMULA GPPP-PT-C0100N0000001000-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0100N0000001000-04 finished in 32515 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0||X(p1))) U p2))], workingDir=/home/mcc/execution]
Support contains 5 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 1 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 04:07:33] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-17 04:07:33] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:07:33] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 04:07:33] [INFO ] Implicit Places using invariants in 40 ms returned [1, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 41 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:07:33] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-17 04:07:33] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:07:33] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:07:33] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-05 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(OR (LEQ 1 s2) (LEQ s27 s5)), p0:(LEQ s13 s6), p1:(LEQ 1 s2)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 12049 reset in 384 ms.
Stack based approach found an accepted trace after 77 steps with 8 reset with depth 9 and stack size 9 in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-05 finished in 669 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 1 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 32 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 31 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 31 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 30 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 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 8 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 04:07:34] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 04:07:34] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 04:07:34] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 04:07:34] [INFO ] Implicit Places using invariants in 38 ms returned [1, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 39 ms to find 4 implicit places.
[2021-05-17 04:07:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-17 04:07:34] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-17 04:07:34] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 20/33 places, 15/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 18 transition count 13
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 17 transition count 12
Applied a total of 6 rules in 3 ms. Remains 17 /20 variables (removed 3) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 17 cols
[2021-05-17 04:07:34] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 04:07:34] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2021-05-17 04:07:34] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 04:07:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 04:07:34] [INFO ] Implicit Places using invariants and state equation in 27 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 45 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 16/33 places, 12/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2021-05-17 04:07:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2021-05-17 04:07:34] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 04:07:34] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 3 iterations. Remains : 16/33 places, 12/22 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-07 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GT 2 s5) (LEQ 2 s12)), p1:(GT 1 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 15 steps with 2 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-07 finished in 288 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0&&X(p1))) U ((X((p0&&X(p1)))&&p2)||X(G((p0&&X(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 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 1 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 04:07:34] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 04:07:34] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:07:34] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 04:07:34] [INFO ] Implicit Places using invariants in 34 ms returned [1, 2, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 35 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:07:34] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 04:07:34] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 30/33 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 04:07:34] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 04:07:34] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ 3 s24), p2:(AND (GT 1 s6) (LEQ s13 s1)), p1:(GT 1 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 249 ms.
Product exploration explored 100000 steps with 33333 reset in 180 ms.
Knowledge obtained : [p0, p2, p1]
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33333 reset in 94 ms.
Product exploration explored 100000 steps with 33333 reset in 109 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Support contains 4 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.
Graph (trivial) has 7 edges and 30 vertex of which 2 / 30 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: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 29 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 4 place count 29 transition count 21
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 29 transition count 21
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 26 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 26 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 26 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 25 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 25 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 25 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 17 rules in 7 ms. Remains 25 /30 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 25 cols
[2021-05-17 04:07:36] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:07:36] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
[2021-05-17 04:07:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-17 04:07:36] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 04:07:36] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/30 places, 17/22 transitions.
Product exploration explored 100000 steps with 33333 reset in 318 ms.
Product exploration explored 100000 steps with 33333 reset in 298 ms.
[2021-05-17 04:07:36] [INFO ] Flatten gal took : 4 ms
[2021-05-17 04:07:36] [INFO ] Flatten gal took : 3 ms
[2021-05-17 04:07:36] [INFO ] Time to serialize gal into /tmp/LTL11718175725217658632.gal : 1 ms
[2021-05-17 04:07:36] [INFO ] Time to serialize properties into /tmp/LTL18123179653163244860.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/LTL11718175725217658632.gal, -t, CGAL, -LTL, /tmp/LTL18123179653163244860.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/LTL11718175725217658632.gal -t CGAL -LTL /tmp/LTL18123179653163244860.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(("(b1>=3)")&&(X("(Ru5P<1)"))))U((X(G(("(b1>=3)")&&(X("(Ru5P<1)")))))||(("((Ru5P<1)&&(G6P<=NADH))")&&(X(("(b1>=3)")&&(X("(Ru5P<1)"))))))))
Formula 0 simplified : !(X("(b1>=3)" & X"(Ru5P<1)") U (XG("(b1>=3)" & X"(Ru5P<1)") | ("((Ru5P<1)&&(G6P<=NADH))" & X("(b1>=3)" & X"(Ru5P<1)"))))
Detected timeout of ITS tools.
[2021-05-17 04:07:51] [INFO ] Flatten gal took : 4 ms
[2021-05-17 04:07:51] [INFO ] Applying decomposition
[2021-05-17 04:07:51] [INFO ] Flatten gal took : 3 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/graph17076632033506687246.txt, -o, /tmp/graph17076632033506687246.bin, -w, /tmp/graph17076632033506687246.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/graph17076632033506687246.bin, -l, -1, -v, -w, /tmp/graph17076632033506687246.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 04:07:51] [INFO ] Decomposing Gal with order
[2021-05-17 04:07:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 04:07:51] [INFO ] Removed a total of 3 redundant transitions.
[2021-05-17 04:07:51] [INFO ] Flatten gal took : 7 ms
[2021-05-17 04:07:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 04:07:51] [INFO ] Time to serialize gal into /tmp/LTL3498770887373724460.gal : 2 ms
[2021-05-17 04:07:51] [INFO ] Time to serialize properties into /tmp/LTL7215589229754065308.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/LTL3498770887373724460.gal, -t, CGAL, -LTL, /tmp/LTL7215589229754065308.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/LTL3498770887373724460.gal -t CGAL -LTL /tmp/LTL7215589229754065308.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(("(gi1.gi0.gi1.gu8.b1>=3)")&&(X("(gi1.gi0.gi1.gu9.Ru5P<1)"))))U((X(G(("(gi1.gi0.gi1.gu8.b1>=3)")&&(X("(gi1.gi0.gi1.gu9.Ru5P<1)")))))||(("((gi1.gi0.gi1.gu9.Ru5P<1)&&(gu0.G6P<=gu0.NADH))")&&(X(("(gi1.gi0.gi1.gu8.b1>=3)")&&(X("(gi1.gi0.gi1.gu9.Ru5P<1)"))))))))
Formula 0 simplified : !(X("(gi1.gi0.gi1.gu8.b1>=3)" & X"(gi1.gi0.gi1.gu9.Ru5P<1)") U (XG("(gi1.gi0.gi1.gu8.b1>=3)" & X"(gi1.gi0.gi1.gu9.Ru5P<1)") | ("((gi1.gi0.gi1.gu9.Ru5P<1)&&(gu0.G6P<=gu0.NADH))" & X("(gi1.gi0.gi1.gu8.b1>=3)" & X"(gi1.gi0.gi1.gu9.Ru5P<1)"))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16778290133027526241
[2021-05-17 04:08:07] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16778290133027526241
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/ltsmin16778290133027526241]
Compilation finished in 220 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16778290133027526241]
Link finished in 34 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)&&X((LTLAPp1==true)))) U (X([](((LTLAPp0==true)&&X((LTLAPp1==true)))))||(X(((LTLAPp0==true)&&X((LTLAPp1==true))))&&(LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin16778290133027526241]
LTSmin run took 259 ms.
FORMULA GPPP-PT-C0100N0000001000-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0100N0000001000-12 finished in 33209 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(F((p0 U (p1||G(p0)))))||(p2&&X(p3))))))], workingDir=/home/mcc/execution]
Support contains 4 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 2 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 04:08:07] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-17 04:08:07] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:08:07] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 04:08:07] [INFO ] Implicit Places using invariants in 56 ms returned [1, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:08:07] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:08:07] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:08:07] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 04:08:07] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (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 p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(GT 2 s18), p1:(AND (GT 2 s6) (OR (GT s8 s18) (GT 1 s4))), p0:(OR (GT s8 s18) (GT 1 s4)), p3:(GT 2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 888 reset in 303 ms.
Stack based approach found an accepted trace after 305 steps with 12 reset with depth 132 and stack size 125 in 1 ms.
FORMULA GPPP-PT-C0100N0000001000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-15 finished in 717 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621224489291

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/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-C0100N0000001000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0100N0000001000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r102-smll-162075331300252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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