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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 133K 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 85K 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:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 4.2K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 22 19:56 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-C0001N0000010000-00
FORMULA_NAME GPPP-PT-C0001N0000010000-01
FORMULA_NAME GPPP-PT-C0001N0000010000-02
FORMULA_NAME GPPP-PT-C0001N0000010000-03
FORMULA_NAME GPPP-PT-C0001N0000010000-04
FORMULA_NAME GPPP-PT-C0001N0000010000-05
FORMULA_NAME GPPP-PT-C0001N0000010000-06
FORMULA_NAME GPPP-PT-C0001N0000010000-07
FORMULA_NAME GPPP-PT-C0001N0000010000-08
FORMULA_NAME GPPP-PT-C0001N0000010000-09
FORMULA_NAME GPPP-PT-C0001N0000010000-10
FORMULA_NAME GPPP-PT-C0001N0000010000-11
FORMULA_NAME GPPP-PT-C0001N0000010000-12
FORMULA_NAME GPPP-PT-C0001N0000010000-13
FORMULA_NAME GPPP-PT-C0001N0000010000-14
FORMULA_NAME GPPP-PT-C0001N0000010000-15

=== Now, execution of the tool begins

BK_START 1621203263743

Running Version 0
[2021-05-16 22:14:26] [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-16 22:14:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 22:14:27] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2021-05-16 22:14:27] [INFO ] Transformed 33 places.
[2021-05-16 22:14:27] [INFO ] Transformed 22 transitions.
[2021-05-16 22:14:27] [INFO ] Parsed PT model containing 33 places and 22 transitions in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 22:14:27] [INFO ] Initial state test concluded for 3 properties.
FORMULA GPPP-PT-C0001N0000010000-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000010000-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000010000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000010000-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 18 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 22:14:27] [INFO ] Computed 13 place invariants in 13 ms
[2021-05-16 22:14:27] [INFO ] Dead Transitions using invariants and state equation in 199 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 22:14:27] [INFO ] Computed 13 place invariants in 3 ms
[2021-05-16 22:14:27] [INFO ] Implicit Places using invariants in 59 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 63 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 22:14:27] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 22:14:27] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 22:14:27] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 22:14:27] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
[2021-05-16 22:14:28] [INFO ] Flatten gal took : 29 ms
[2021-05-16 22:14:28] [INFO ] Flatten gal took : 10 ms
[2021-05-16 22:14:28] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=383 ) properties (out of 26) seen :21
Running SMT prover for 5 properties.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 22:14:28] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-16 22:14:28] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 22:14:28] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-16 22:14:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 22:14:28] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-16 22:14:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 22:14:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 22:14:28] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-16 22:14:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 22:14:28] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-16 22:14:28] [INFO ] Computed and/alt/rep : 21/40/21 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-16 22:14:28] [INFO ] Added : 19 causal constraints over 4 iterations in 48 ms. Result :sat
[2021-05-16 22:14:28] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 22:14:28] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 12 ms returned sat
[2021-05-16 22:14:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 22:14:28] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-16 22:14:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 22:14:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 22:14:28] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-16 22:14:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 22:14:28] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2021-05-16 22:14:28] [INFO ] Computed and/alt/rep : 21/40/21 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-16 22:14:28] [INFO ] Added : 21 causal constraints over 5 iterations in 47 ms. Result :sat
[2021-05-16 22:14:29] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-16 22:14:29] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-16 22:14:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 22:14:29] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-16 22:14:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 22:14:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 22:14:29] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-16 22:14:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 22:14:29] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2021-05-16 22:14:29] [INFO ] Computed and/alt/rep : 21/40/21 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-16 22:14:29] [INFO ] Added : 20 causal constraints over 4 iterations in 52 ms. Result :sat
[2021-05-16 22:14:29] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 22:14:29] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 4 ms returned unsat
[2021-05-16 22:14:29] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-16 22:14:29] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2021-05-16 22:14:29] [INFO ] Initial state test concluded for 1 properties.
FORMULA GPPP-PT-C0001N0000010000-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000010000-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(p1)&&p0) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 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-16 22:14:29] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 22:14:29] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 22:14:29] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 22:14:29] [INFO ] Implicit Places using invariants in 57 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:14:29] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-16 22:14:29] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 28/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:14:29] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-16 22:14:29] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 436 ms :[(NOT p2), true, (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000010000-02 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 1}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p2:(AND (LEQ s1 s24) (LEQ s12 s6)), p0:(AND (LEQ s12 s6) (GT s1 s24)), p1:(LEQ s1 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0001N0000010000-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000010000-02 finished in 759 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 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 4 edges and 30 vertex of which 2 / 30 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 29 transition count 19
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 27 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 26 transition count 18
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 3 with 5 rules applied. Total rules applied 12 place count 23 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 3 with 2 rules applied. Total rules applied 14 place count 22 transition count 15
Applied a total of 14 rules in 26 ms. Remains 22 /30 variables (removed 8) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 22 cols
[2021-05-16 22:14:30] [INFO ] Computed 9 place invariants in 5 ms
[2021-05-16 22:14:30] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
// Phase 1: matrix 15 rows 22 cols
[2021-05-16 22:14:30] [INFO ] Computed 9 place invariants in 10 ms
[2021-05-16 22:14:30] [INFO ] Implicit Places using invariants in 42 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
[2021-05-16 22:14:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-16 22:14:30] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 22:14:30] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 20/30 places, 15/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 20 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 19 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 0 with 2 rules applied. Total rules applied 4 place count 18 transition count 13
Applied a total of 4 rules in 7 ms. Remains 18 /20 variables (removed 2) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 18 cols
[2021-05-16 22:14:30] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-16 22:14:30] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 13 rows 18 cols
[2021-05-16 22:14:30] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-16 22:14:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 22:14:30] [INFO ] Implicit Places using invariants and state equation in 54 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 : 18/30 places, 13/22 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000010000-03 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:(LEQ s9 s0), p1:(LEQ 3 s1)], 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 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000010000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000010000-03 finished in 419 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 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-16 22:14:30] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 22:14:30] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 22:14:30] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 22:14:30] [INFO ] Implicit Places using invariants in 46 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:14:30] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:14:30] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 28/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:14:30] [INFO ] Computed 8 place invariants in 6 ms
[2021-05-16 22:14:30] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : GPPP-PT-C0001N0000010000-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 339 ms.
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0), true]
Support contains 1 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 28/28 places, 22/22 transitions.
Graph (trivial) has 7 edges and 28 vertex of which 2 / 28 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 27 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 27 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 27 transition count 21
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 25 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 25 transition count 19
Performed 2 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 2 rules applied. Total rules applied 12 place count 25 transition count 19
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 24 transition count 18
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 24 transition count 18
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 15 place count 24 transition count 18
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 15 rules in 8 ms. Remains 24 /28 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-16 22:14:31] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:14:31] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
[2021-05-16 22:14:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2021-05-16 22:14:31] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:14:32] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/28 places, 18/22 transitions.
Product exploration explored 100000 steps with 50000 reset in 433 ms.
Product exploration explored 100000 steps with 50000 reset in 309 ms.
[2021-05-16 22:14:32] [INFO ] Flatten gal took : 9 ms
[2021-05-16 22:14:32] [INFO ] Flatten gal took : 8 ms
[2021-05-16 22:14:32] [INFO ] Time to serialize gal into /tmp/LTL6708293286835197612.gal : 2 ms
[2021-05-16 22:14:32] [INFO ] Time to serialize properties into /tmp/LTL610677735266906705.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/LTL6708293286835197612.gal, -t, CGAL, -LTL, /tmp/LTL610677735266906705.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/LTL6708293286835197612.gal -t CGAL -LTL /tmp/LTL610677735266906705.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X("(Pyr<1)")))
Formula 0 simplified : !X"(Pyr<1)"
Detected timeout of ITS tools.
[2021-05-16 22:14:47] [INFO ] Flatten gal took : 9 ms
[2021-05-16 22:14:47] [INFO ] Applying decomposition
[2021-05-16 22:14:47] [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/graph3639729127464983335.txt, -o, /tmp/graph3639729127464983335.bin, -w, /tmp/graph3639729127464983335.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/graph3639729127464983335.bin, -l, -1, -v, -w, /tmp/graph3639729127464983335.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 22:14:47] [INFO ] Decomposing Gal with order
[2021-05-16 22:14:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 22:14:47] [INFO ] Removed a total of 3 redundant transitions.
[2021-05-16 22:14:48] [INFO ] Flatten gal took : 51 ms
[2021-05-16 22:14:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 22:14:48] [INFO ] Time to serialize gal into /tmp/LTL8765342283451480472.gal : 6 ms
[2021-05-16 22:14:48] [INFO ] Time to serialize properties into /tmp/LTL12785614615678725024.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/LTL8765342283451480472.gal, -t, CGAL, -LTL, /tmp/LTL12785614615678725024.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/LTL8765342283451480472.gal -t CGAL -LTL /tmp/LTL12785614615678725024.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X("(i3.u7.Pyr<1)")))
Formula 0 simplified : !X"(i3.u7.Pyr<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11020711475118945513
[2021-05-16 22:15:03] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11020711475118945513
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/ltsmin11020711475118945513]
Compilation finished in 409 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11020711475118945513]
Link finished in 52 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)), --buchi-type=spotba], workingDir=/tmp/ltsmin11020711475118945513]
LTSmin run took 416 ms.
FORMULA GPPP-PT-C0001N0000010000-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000010000-04 finished in 33494 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 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-16 22:15:04] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 22:15:04] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 22:15:04] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 22:15:04] [INFO ] Implicit Places using invariants in 55 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:15:04] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:15:04] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 28/30 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:15:04] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-16 22:15:04] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000010000-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s1), p1:(LEQ s12 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 28/28 places, 22/22 transitions.
Graph (trivial) has 8 edges and 28 vertex of which 2 / 28 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 27 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 27 transition count 21
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 27 transition count 21
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 24 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 24 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 24 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 23 transition count 17
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 23 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 23 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 17 rules in 11 ms. Remains 23 /28 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 22:15:05] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:15:05] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
[2021-05-16 22:15:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 22:15:05] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:15:05] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/28 places, 17/22 transitions.
Product exploration explored 100000 steps with 50000 reset in 365 ms.
Product exploration explored 100000 steps with 50000 reset in 368 ms.
[2021-05-16 22:15:06] [INFO ] Flatten gal took : 5 ms
[2021-05-16 22:15:06] [INFO ] Flatten gal took : 5 ms
[2021-05-16 22:15:06] [INFO ] Time to serialize gal into /tmp/LTL9770146411974250882.gal : 1 ms
[2021-05-16 22:15:06] [INFO ] Time to serialize properties into /tmp/LTL11731950831502376067.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/LTL9770146411974250882.gal, -t, CGAL, -LTL, /tmp/LTL11731950831502376067.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/LTL9770146411974250882.gal -t CGAL -LTL /tmp/LTL11731950831502376067.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(NADPH>=1)")||(X("(FBP<=Xu5P)")))))
Formula 0 simplified : !F("(NADPH>=1)" | X"(FBP<=Xu5P)")
Detected timeout of ITS tools.
[2021-05-16 22:15:21] [INFO ] Flatten gal took : 3 ms
[2021-05-16 22:15:21] [INFO ] Applying decomposition
[2021-05-16 22:15:21] [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/graph11314556380293494733.txt, -o, /tmp/graph11314556380293494733.bin, -w, /tmp/graph11314556380293494733.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/graph11314556380293494733.bin, -l, -1, -v, -w, /tmp/graph11314556380293494733.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 22:15:21] [INFO ] Decomposing Gal with order
[2021-05-16 22:15:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 22:15:21] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-16 22:15:21] [INFO ] Flatten gal took : 9 ms
[2021-05-16 22:15:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-16 22:15:21] [INFO ] Time to serialize gal into /tmp/LTL3107958129965462187.gal : 4 ms
[2021-05-16 22:15:21] [INFO ] Time to serialize properties into /tmp/LTL1260361170983401658.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/LTL3107958129965462187.gal, -t, CGAL, -LTL, /tmp/LTL1260361170983401658.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/LTL3107958129965462187.gal -t CGAL -LTL /tmp/LTL1260361170983401658.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(gi1.gi0.gu0.NADPH>=1)")||(X("(gu2.FBP<=gu2.Xu5P)")))))
Formula 0 simplified : !F("(gi1.gi0.gu0.NADPH>=1)" | X"(gu2.FBP<=gu2.Xu5P)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4702355506808654645
[2021-05-16 22:15:36] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4702355506808654645
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/ltsmin4702355506808654645]
Compilation finished in 206 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4702355506808654645]
Link finished in 30 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)||X((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin4702355506808654645]
LTSmin run took 203 ms.
FORMULA GPPP-PT-C0001N0000010000-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000010000-05 finished in 32764 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((F(p0) U p1))&&X(p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 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-16 22:15:36] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 22:15:36] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 22:15:36] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 22:15:36] [INFO ] Implicit Places using invariants in 48 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:15:36] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:15:36] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 28/30 places, 22/22 transitions.
Applied a total of 0 rules in 6 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:15:36] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:15:37] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p1), (NOT p2), true]
Running random walk in product with property : GPPP-PT-C0001N0000010000-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 3 s0), p0:(LEQ 2 s10), p2:(LEQ 2 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 186 ms.
Product exploration explored 100000 steps with 0 reset in 673 ms.
Knowledge obtained : [p1, (NOT p0), p2]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p1), (NOT p2), true]
Product exploration explored 100000 steps with 1 reset in 109 ms.
Product exploration explored 100000 steps with 2 reset in 292 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p1), (NOT p2), true]
Support contains 3 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 28/28 places, 22/22 transitions.
Graph (trivial) has 8 edges and 28 vertex of which 2 / 28 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.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 27 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 5 place count 27 transition count 21
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 27 transition count 21
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 24 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 24 transition count 18
Performed 2 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 2 rules applied. Total rules applied 15 place count 24 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 23 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 23 transition count 17
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 18 place count 23 transition count 17
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 18 rules in 6 ms. Remains 23 /28 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 22:15:39] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 22:15:39] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
[2021-05-16 22:15:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 22:15:39] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:15:39] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/28 places, 17/22 transitions.
Product exploration explored 100000 steps with 0 reset in 494 ms.
Product exploration explored 100000 steps with 2 reset in 343 ms.
[2021-05-16 22:15:40] [INFO ] Flatten gal took : 7 ms
[2021-05-16 22:15:40] [INFO ] Flatten gal took : 4 ms
[2021-05-16 22:15:40] [INFO ] Time to serialize gal into /tmp/LTL13979411371809768744.gal : 2 ms
[2021-05-16 22:15:40] [INFO ] Time to serialize properties into /tmp/LTL13801905614409007794.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/LTL13979411371809768744.gal, -t, CGAL, -LTL, /tmp/LTL13801905614409007794.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/LTL13979411371809768744.gal -t CGAL -LTL /tmp/LTL13801905614409007794.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G((F("(F6P>=2)"))U("(NADPplus>=3)")))&&(X("(a1>=2)"))))
Formula 0 simplified : !(G(F"(F6P>=2)" U "(NADPplus>=3)") & X"(a1>=2)")
Detected timeout of ITS tools.
[2021-05-16 22:15:55] [INFO ] Flatten gal took : 3 ms
[2021-05-16 22:15:55] [INFO ] Applying decomposition
[2021-05-16 22:15:55] [INFO ] Flatten gal took : 2 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/graph4076757363424688915.txt, -o, /tmp/graph4076757363424688915.bin, -w, /tmp/graph4076757363424688915.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/graph4076757363424688915.bin, -l, -1, -v, -w, /tmp/graph4076757363424688915.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 22:15:55] [INFO ] Decomposing Gal with order
[2021-05-16 22:15:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 22:15:55] [INFO ] Removed a total of 3 redundant transitions.
[2021-05-16 22:15:55] [INFO ] Flatten gal took : 5 ms
[2021-05-16 22:15:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-16 22:15:55] [INFO ] Time to serialize gal into /tmp/LTL3178753530967550232.gal : 1 ms
[2021-05-16 22:15:55] [INFO ] Time to serialize properties into /tmp/LTL10757706964710405666.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/LTL3178753530967550232.gal, -t, CGAL, -LTL, /tmp/LTL10757706964710405666.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/LTL3178753530967550232.gal -t CGAL -LTL /tmp/LTL10757706964710405666.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G((F("(i1.u3.F6P>=2)"))U("(i0.u0.NADPplus>=3)")))&&(X("(u9.a1>=2)"))))
Formula 0 simplified : !(G(F"(i1.u3.F6P>=2)" U "(i0.u0.NADPplus>=3)") & X"(u9.a1>=2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1382007492835611423
[2021-05-16 22:16:10] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1382007492835611423
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/ltsmin1382007492835611423]
Compilation finished in 204 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1382007492835611423]
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, ([]((<>((LTLAPp0==true)) U (LTLAPp1==true)))&&X((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin1382007492835611423]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0001N0000010000-07 finished in 48427 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X((G(p1) U (p2&&G(p1))))||p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 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-16 22:16:25] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 22:16:25] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 22:16:25] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 22:16:25] [INFO ] Implicit Places using invariants in 27 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:16:25] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:16:25] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 28/30 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:16:25] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:16:25] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000010000-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LEQ 2 s23) (LEQ s22 s15)), p2:(OR (LEQ 2 s23) (LEQ s22 s15)), p1:(LEQ s9 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 20505 reset in 143 ms.
Product exploration explored 100000 steps with 20518 reset in 402 ms.
Knowledge obtained : [(NOT p0), (NOT p2), p1]
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20491 reset in 111 ms.
Product exploration explored 100000 steps with 20494 reset in 242 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 28/28 places, 22/22 transitions.
Graph (trivial) has 5 edges and 28 vertex of which 2 / 28 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 27 transition count 21
Performed 2 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 2 rules applied. Total rules applied 6 place count 27 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 26 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 26 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 9 place count 26 transition count 20
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 9 rules in 4 ms. Remains 26 /28 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 26 cols
[2021-05-16 22:16:26] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 22:16:26] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
[2021-05-16 22:16:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 26 cols
[2021-05-16 22:16:26] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:16:26] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/28 places, 20/22 transitions.
Product exploration explored 100000 steps with 20494 reset in 246 ms.
Product exploration explored 100000 steps with 20529 reset in 260 ms.
[2021-05-16 22:16:27] [INFO ] Flatten gal took : 3 ms
[2021-05-16 22:16:27] [INFO ] Flatten gal took : 4 ms
[2021-05-16 22:16:27] [INFO ] Time to serialize gal into /tmp/LTL12838619227175812883.gal : 1 ms
[2021-05-16 22:16:27] [INFO ] Time to serialize properties into /tmp/LTL11401546187977257356.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/LTL12838619227175812883.gal, -t, CGAL, -LTL, /tmp/LTL11401546187977257356.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/LTL12838619227175812883.gal -t CGAL -LTL /tmp/LTL11401546187977257356.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("((b2>=2)||(b1<=_3PG))")||(X((G("(E4P<=Pyr)"))U(("((b2>=2)||(b1<=_3PG))")&&(G("(E4P<=Pyr)")))))))))
Formula 0 simplified : !XF("((b2>=2)||(b1<=_3PG))" | X(G"(E4P<=Pyr)" U ("((b2>=2)||(b1<=_3PG))" & G"(E4P<=Pyr)")))
Detected timeout of ITS tools.
[2021-05-16 22:16:42] [INFO ] Flatten gal took : 4 ms
[2021-05-16 22:16:42] [INFO ] Applying decomposition
[2021-05-16 22:16:42] [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/graph8626315912546846237.txt, -o, /tmp/graph8626315912546846237.bin, -w, /tmp/graph8626315912546846237.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/graph8626315912546846237.bin, -l, -1, -v, -w, /tmp/graph8626315912546846237.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 22:16:42] [INFO ] Decomposing Gal with order
[2021-05-16 22:16:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 22:16:42] [INFO ] Removed a total of 4 redundant transitions.
[2021-05-16 22:16:42] [INFO ] Flatten gal took : 8 ms
[2021-05-16 22:16:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 22:16:42] [INFO ] Time to serialize gal into /tmp/LTL9895988629760854025.gal : 2 ms
[2021-05-16 22:16:42] [INFO ] Time to serialize properties into /tmp/LTL8414724305585908249.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/LTL9895988629760854025.gal, -t, CGAL, -LTL, /tmp/LTL8414724305585908249.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/LTL9895988629760854025.gal -t CGAL -LTL /tmp/LTL8414724305585908249.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("((gi0.gi0.gi1.gu8.b2>=2)||(gu9.b1<=gu9._3PG))")||(X((G("(gu6.E4P<=gu6.Pyr)"))U(("((gi0.gi0.gi1.gu8.b2>=2)||(gu9.b1<=gu9._3PG))")&&(G("(gu6.E4P<=gu6.Pyr)")))))))))
Formula 0 simplified : !XF("((gi0.gi0.gi1.gu8.b2>=2)||(gu9.b1<=gu9._3PG))" | X(G"(gu6.E4P<=gu6.Pyr)" U ("((gi0.gi0.gi1.gu8.b2>=2)||(gu9.b1<=gu9._3PG))" & G"(gu6.E4P<=gu6.Pyr)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13254928143611754065
[2021-05-16 22:16:57] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13254928143611754065
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/ltsmin13254928143611754065]
Compilation finished in 203 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13254928143611754065]
Link finished in 32 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(([]((LTLAPp1==true)) U ((LTLAPp2==true)&&[]((LTLAPp1==true)))))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin13254928143611754065]
LTSmin run took 156 ms.
FORMULA GPPP-PT-C0001N0000010000-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000010000-09 finished in 32826 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 22/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 30 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 28 transition count 20
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 13 place count 23 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 16 place count 21 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 18 place count 20 transition count 14
Applied a total of 18 rules in 4 ms. Remains 20 /30 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 20 cols
[2021-05-16 22:16:58] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:16:58] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2021-05-16 22:16:58] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:16:58] [INFO ] Implicit Places using invariants in 38 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
[2021-05-16 22:16:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-16 22:16:58] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 22:16:58] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 18/30 places, 14/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 18 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 13
Applied a total of 2 rules in 2 ms. Remains 17 /18 variables (removed 1) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 17 cols
[2021-05-16 22:16:58] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 22:16:58] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 13 rows 17 cols
[2021-05-16 22:16:58] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 22:16:58] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 17/30 places, 13/22 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000010000-10 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:(GT s4 s6)], 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 14197 reset in 158 ms.
Stack based approach found an accepted trace after 677 steps with 93 reset with depth 11 and stack size 11 in 3 ms.
FORMULA GPPP-PT-C0001N0000010000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000010000-10 finished in 403 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 5 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.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 29 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 26 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 16 place count 21 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 19 transition count 13
Applied a total of 19 rules in 6 ms. Remains 19 /30 variables (removed 11) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 19 cols
[2021-05-16 22:16:58] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:16:58] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2021-05-16 22:16:58] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:16:58] [INFO ] Implicit Places using invariants in 50 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
[2021-05-16 22:16:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 17 cols
[2021-05-16 22:16:58] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 22:16:58] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 17/30 places, 13/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 12
Applied a total of 2 rules in 4 ms. Remains 16 /17 variables (removed 1) and now considering 12/13 (removed 1) transitions.
// Phase 1: matrix 12 rows 16 cols
[2021-05-16 22:16:58] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 22:16:58] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2021-05-16 22:16:58] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 22:16:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 22:16:58] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 16/30 places, 12/22 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000010000-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT 1 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000010000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000010000-11 finished in 270 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 11 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 22:16:58] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 22:16:58] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 22:16:58] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 22:16:58] [INFO ] Implicit Places using invariants in 54 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:16:58] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-16 22:16:58] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 28/30 places, 22/22 transitions.
Applied a total of 0 rules in 5 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 22:16:58] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:16:58] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000010000-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GT 3 s22), p0:(OR (GT 1 s4) (GT s11 s21))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000010000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000010000-12 finished in 360 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(((F(p0) U p1)||G(p2))))&&F(p2)))], workingDir=/home/mcc/execution]
Support contains 2 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 4 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.
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 29 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 28 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 28 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 27 transition count 19
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 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 24 transition count 17
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 22 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 21 transition count 15
Applied a total of 15 rules in 12 ms. Remains 21 /30 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 21 cols
[2021-05-16 22:16:59] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:16:59] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
// Phase 1: matrix 15 rows 21 cols
[2021-05-16 22:16:59] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 22:16:59] [INFO ] Implicit Places using invariants in 42 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
[2021-05-16 22:16:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 19 cols
[2021-05-16 22:16:59] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-16 22:16:59] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 19/30 places, 15/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 19 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18 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 0 with 2 rules applied. Total rules applied 4 place count 17 transition count 13
Applied a total of 4 rules in 4 ms. Remains 17 /19 variables (removed 2) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 17 cols
[2021-05-16 22:16:59] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-16 22:16:59] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 13 rows 17 cols
[2021-05-16 22:16:59] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 22:16:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 22:16:59] [INFO ] Implicit Places using invariants and state equation in 42 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 : 17/30 places, 13/22 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000010000-15 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 3 s6), p1:(LEQ 2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000010000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000010000-15 finished in 417 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16210940984391747740
[2021-05-16 22:16:59] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2021-05-16 22:16:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 22:16:59] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2021-05-16 22:16:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 22:16:59] [INFO ] Applying decomposition
[2021-05-16 22:16:59] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2021-05-16 22:16:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 22:16:59] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16210940984391747740
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/ltsmin16210940984391747740]
[2021-05-16 22:16:59] [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/graph16748457574356559641.txt, -o, /tmp/graph16748457574356559641.bin, -w, /tmp/graph16748457574356559641.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/graph16748457574356559641.bin, -l, -1, -v, -w, /tmp/graph16748457574356559641.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 22:16:59] [INFO ] Decomposing Gal with order
[2021-05-16 22:16:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 22:16:59] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-16 22:16:59] [INFO ] Flatten gal took : 8 ms
[2021-05-16 22:16:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 22:16:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality10743184767441628821.gal : 2 ms
[2021-05-16 22:16:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality7978912026982539676.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/LTLCardinality10743184767441628821.gal, -t, CGAL, -LTL, /tmp/LTLCardinality7978912026982539676.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/LTLCardinality10743184767441628821.gal -t CGAL -LTL /tmp/LTLCardinality7978912026982539676.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G((F("(i4.u3.F6P>=2)"))U("(i0.u1.NADPplus>=3)")))&&(X("(u9.a1>=2)"))))
Formula 0 simplified : !(G(F"(i4.u3.F6P>=2)" U "(i0.u1.NADPplus>=3)") & X"(u9.a1>=2)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-16 22:16:59] [INFO ] Flatten gal took : 3 ms
[2021-05-16 22:16:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality11006752651051052911.gal : 1 ms
[2021-05-16 22:16:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality5656587570353170058.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/LTLCardinality11006752651051052911.gal, -t, CGAL, -LTL, /tmp/LTLCardinality5656587570353170058.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/LTLCardinality11006752651051052911.gal -t CGAL -LTL /tmp/LTLCardinality5656587570353170058.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G((F("(F6P>=2)"))U("(NADPplus>=3)")))&&(X("(a1>=2)"))))
Formula 0 simplified : !(G(F"(F6P>=2)" U "(NADPplus>=3)") & X"(a1>=2)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-16 22:16:59] [INFO ] Flatten gal took : 4 ms
[2021-05-16 22:16:59] [INFO ] Input system was already deterministic with 22 transitions.
[2021-05-16 22:16:59] [INFO ] Transformed 30 places.
[2021-05-16 22:16:59] [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-16 22:16:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality7121130711203937144.gal : 1 ms
[2021-05-16 22:16:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality7769526372171631349.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/LTLCardinality7121130711203937144.gal, -t, CGAL, -LTL, /tmp/LTLCardinality7769526372171631349.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/LTLCardinality7121130711203937144.gal -t CGAL -LTL /tmp/LTLCardinality7769526372171631349.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G((F("(F6P>=2)"))U("(NADPplus>=3)")))&&(X("(a1>=2)"))))
Formula 0 simplified : !(G(F"(F6P>=2)" U "(NADPplus>=3)") & X"(a1>=2)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Compilation finished in 398 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16210940984391747740]
Link finished in 43 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)) U (LTLAPp1==true)))&&X((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin16210940984391747740]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: ([]((<>((LTLAPp0==true)) U (LTLAPp1==true)))&&X((LTLAPp2==true)))
pins2lts-mc-linux64( 1/ 8), 0.003: "([]((<>((LTLAPp0==true)) U (LTLAPp1==true)))&&X((LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.090: DFS-FIFO for weak LTL, using special progress label 26
pins2lts-mc-linux64( 0/ 8), 0.092: There are 27 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.092: State length is 31, there are 34 groups
pins2lts-mc-linux64( 0/ 8), 0.092: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.092: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.092: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.092: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.259: ~1 levels ~960 states ~3880 transitions
pins2lts-mc-linux64( 7/ 8), 0.272: ~1 levels ~1920 states ~8568 transitions
pins2lts-mc-linux64( 7/ 8), 0.277: ~1 levels ~3840 states ~17352 transitions
pins2lts-mc-linux64( 3/ 8), 0.283: ~1 levels ~7680 states ~39000 transitions
pins2lts-mc-linux64( 3/ 8), 0.288: ~1 levels ~15360 states ~80584 transitions
pins2lts-mc-linux64( 3/ 8), 0.311: ~1 levels ~30720 states ~164248 transitions
pins2lts-mc-linux64( 3/ 8), 0.357: ~1 levels ~61440 states ~333440 transitions
pins2lts-mc-linux64( 5/ 8), 0.442: ~1 levels ~122880 states ~689752 transitions
pins2lts-mc-linux64( 3/ 8), 0.600: ~1 levels ~245760 states ~1326896 transitions
pins2lts-mc-linux64( 3/ 8), 0.959: ~1 levels ~491520 states ~2746560 transitions
pins2lts-mc-linux64( 3/ 8), 1.659: ~1 levels ~983040 states ~5595736 transitions
pins2lts-mc-linux64( 3/ 8), 3.034: ~1 levels ~1966080 states ~11234752 transitions
pins2lts-mc-linux64( 0/ 8), 5.763: ~1 levels ~3932160 states ~22885152 transitions
pins2lts-mc-linux64( 0/ 8), 11.153: ~1 levels ~7864320 states ~45840248 transitions
pins2lts-mc-linux64( 0/ 8), 22.073: ~1 levels ~15728640 states ~92200432 transitions
pins2lts-mc-linux64( 2/ 8), 44.439: ~1 levels ~31457280 states ~188602240 transitions
pins2lts-mc-linux64( 2/ 8), 89.834: ~1 levels ~62914560 states ~377266784 transitions
pins2lts-mc-linux64( 7/ 8), 187.848: ~1 levels ~125829120 states ~753902376 transitions
pins2lts-mc-linux64( 1/ 8), 229.919: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 229.937:
pins2lts-mc-linux64( 0/ 8), 229.937: mean standard work distribution: 2.5% (states) 2.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 229.937:
pins2lts-mc-linux64( 0/ 8), 229.937: Explored 134046685 states 802371460 transitions, fanout: 5.986
pins2lts-mc-linux64( 0/ 8), 229.937: Total exploration time 229.830 sec (229.810 sec minimum, 229.818 sec on average)
pins2lts-mc-linux64( 0/ 8), 229.937: States per second: 583243, Transitions per second: 3491152
pins2lts-mc-linux64( 0/ 8), 229.937:
pins2lts-mc-linux64( 0/ 8), 229.937: Progress states detected: 134216389
pins2lts-mc-linux64( 0/ 8), 229.937: Redundant explorations: -0.1266
pins2lts-mc-linux64( 0/ 8), 229.937:
pins2lts-mc-linux64( 0/ 8), 229.937: Queue width: 8B, total height: 629949, memory: 4.81MB
pins2lts-mc-linux64( 0/ 8), 229.937: Tree memory: 1187.1MB, 9.3 B/state, compr.: 7.4%
pins2lts-mc-linux64( 0/ 8), 229.937: Tree fill ratio (roots/leafs): 99.0%/63.0%
pins2lts-mc-linux64( 0/ 8), 229.937: Stored 22 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 229.937: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 229.937: Est. total memory use: 1191.9MB (~1028.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((<>((LTLAPp0==true)) U (LTLAPp1==true)))&&X((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin16210940984391747740]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((<>((LTLAPp0==true)) U (LTLAPp1==true)))&&X((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin16210940984391747740]
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)

BK_STOP 1621203650791

--------------------
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-C0001N0000010000"
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-C0001N0000010000, 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-162075331200196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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