Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110200363.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 ERK-PT-100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110200363
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 6.9K Apr 29 12:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 29 12:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 29 12:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 29 12:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 9 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 9 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 6.7K May 10 09:33 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 ERK-PT-100000-LTLCardinality-00
FORMULA_NAME ERK-PT-100000-LTLCardinality-01
FORMULA_NAME ERK-PT-100000-LTLCardinality-02
FORMULA_NAME ERK-PT-100000-LTLCardinality-03
FORMULA_NAME ERK-PT-100000-LTLCardinality-04
FORMULA_NAME ERK-PT-100000-LTLCardinality-05
FORMULA_NAME ERK-PT-100000-LTLCardinality-06
FORMULA_NAME ERK-PT-100000-LTLCardinality-07
FORMULA_NAME ERK-PT-100000-LTLCardinality-08
FORMULA_NAME ERK-PT-100000-LTLCardinality-09
FORMULA_NAME ERK-PT-100000-LTLCardinality-10
FORMULA_NAME ERK-PT-100000-LTLCardinality-11
FORMULA_NAME ERK-PT-100000-LTLCardinality-12
FORMULA_NAME ERK-PT-100000-LTLCardinality-13
FORMULA_NAME ERK-PT-100000-LTLCardinality-14
FORMULA_NAME ERK-PT-100000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652663616659

Running Version 202205111006
[2022-05-16 01:13:37] [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]
[2022-05-16 01:13:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:13:38] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2022-05-16 01:13:38] [INFO ] Transformed 11 places.
[2022-05-16 01:13:38] [INFO ] Transformed 11 transitions.
[2022-05-16 01:13:38] [INFO ] Parsed PT model containing 11 places and 11 transitions in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ERK-PT-100000-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 9 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-16 01:13:38] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-16 01:13:38] [INFO ] Implicit Places using invariants in 120 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 149 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 10/11 places, 11/11 transitions.
Support contains 10 out of 10 places after structural reductions.
[2022-05-16 01:13:38] [INFO ] Flatten gal took : 14 ms
[2022-05-16 01:13:38] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:13:38] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 67 ms. (steps per millisecond=1492 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 24) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:13:38] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:13:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:13:38] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-16 01:13:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:13:38] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2022-05-16 01:13:38] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-16 01:13:38] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 1 properties in 22002 ms.
Support contains 7 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 7 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 11/11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=4000 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 183542 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 183542 steps, saw 110546 distinct states, run finished after 3008 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:14:04] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:14:04] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-16 01:14:04] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-16 01:14:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:14:04] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-16 01:14:04] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-16 01:14:04] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 18000 ms.
Support contains 7 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 11/11 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:14:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:14:22] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:14:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:14:22] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-16 01:14:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:14:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:14:22] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:14:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:14:22] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:14:22] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-16 01:14:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:14:22] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-16 01:14:22] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-16 01:14:22] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2022-05-16 01:14:22] [INFO ] Flatten gal took : 2 ms
[2022-05-16 01:14:22] [INFO ] Flatten gal took : 2 ms
[2022-05-16 01:14:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17566981293518608984.gal : 1 ms
[2022-05-16 01:14:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6135331719140567547.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12034366687715619859;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17566981293518608984.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6135331719140567547.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality6135331719140567547.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
[2022-05-16 01:14:22] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:14:22] [INFO ] Applying decomposition
[2022-05-16 01:14:22] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2198627513293720133.txt' '-o' '/tmp/graph2198627513293720133.bin' '-w' '/tmp/graph2198627513293720133.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2198627513293720133.bin' '-l' '-1' '-v' '-w' '/tmp/graph2198627513293720133.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:14:22] [INFO ] Decomposing Gal with order
[2022-05-16 01:14:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:14:22] [INFO ] Removed a total of 4 redundant transitions.
[2022-05-16 01:14:22] [INFO ] Flatten gal took : 27 ms
[2022-05-16 01:14:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 01:14:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17713040802691286481.gal : 1 ms
[2022-05-16 01:14:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3820868694525394085.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12034366687715619859;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17713040802691286481.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3820868694525394085.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality3820868694525394085.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
Built C files in :
/tmp/ltsmin8031061862945104727
[2022-05-16 01:14:23] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8031061862945104727
Running compilation step : cd /tmp/ltsmin8031061862945104727;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 177 ms.
Running link step : cd /tmp/ltsmin8031061862945104727;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8031061862945104727;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA ERK-PT-100000-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !F(F(p1))))'
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 5 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:14:38] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:14:38] [INFO ] Implicit Places using invariants in 28 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/10 places, 11/11 transitions.
Graph (trivial) has 2 edges and 9 vertex of which 2 / 9 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 5 ms. Remains 8 /9 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 01:14:38] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 01:14:38] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 01:14:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 01:14:38] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/10 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 8/10 places, 10/11 transitions.
Stuttering acceptance computed with spot in 276 ms :[p1, true, p1]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s5), p0:(AND (LEQ s4 s7) (LEQ 1 s5) (LEQ s3 s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA ERK-PT-100000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLCardinality-00 finished in 427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Graph (trivial) has 3 edges and 10 vertex of which 2 / 10 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 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 9 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 7 transition count 9
Applied a total of 4 rules in 3 ms. Remains 7 /10 variables (removed 3) and now considering 9/11 (removed 2) transitions.
[2022-05-16 01:14:38] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 7 cols
[2022-05-16 01:14:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 01:14:38] [INFO ] Implicit Places using invariants in 22 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/10 places, 9/11 transitions.
Graph (trivial) has 5 edges and 6 vertex of which 2 / 6 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.
Applied a total of 1 rules in 1 ms. Remains 5 /6 variables (removed 1) and now considering 8/9 (removed 1) transitions.
[2022-05-16 01:14:38] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 01:14:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 01:14:38] [INFO ] Implicit Places using invariants in 18 ms returned []
[2022-05-16 01:14:38] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 01:14:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 01:14:38] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/10 places, 8/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/10 places, 8/11 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ERK-PT-100000-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLCardinality-01 finished in 115 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U X(p1)) U (F(p3)&&p2))))'
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 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 10 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 8 transition count 10
Applied a total of 3 rules in 1 ms. Remains 8 /10 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 01:14:38] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 01:14:38] [INFO ] Implicit Places using invariants in 25 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/10 places, 10/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/10 places, 10/11 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p3), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p3:(LEQ 1 s4), p2:(AND (LEQ s1 s4) (LEQ s6 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ERK-PT-100000-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLCardinality-02 finished in 139 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Graph (trivial) has 2 edges and 10 vertex of which 2 / 10 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 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 9 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 7 transition count 9
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 6 place count 6 transition count 8
Applied a total of 6 rules in 3 ms. Remains 6 /10 variables (removed 4) and now considering 8/11 (removed 3) transitions.
[2022-05-16 01:14:39] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 01:14:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 01:14:39] [INFO ] Implicit Places using invariants in 23 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/10 places, 8/11 transitions.
Applied a total of 0 rules in 5 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 5/10 places, 8/11 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-03 automaton TGBA Formula[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:(LEQ 3 s0)], 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 0 reset in 192 ms.
Product exploration explored 100000 steps with 0 reset in 216 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=5555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3670495 steps, run timeout after 3001 ms. (steps per millisecond=1223 ) properties seen :{}
Probabilistic random walk after 3670495 steps, saw 1329367 distinct states, run finished after 3001 ms. (steps per millisecond=1223 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-16 01:14:42] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 01:14:42] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 01:14:42] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 01:14:42] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 01:14:42] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-16 01:14:42] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 99998 steps, including 0 resets, run visited all 1 properties in 75 ms. (steps per millisecond=1333 )
Parikh walk visited 1 properties in 75 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 3 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2022-05-16 01:14:43] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 01:14:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 01:14:43] [INFO ] Implicit Places using invariants in 17 ms returned []
[2022-05-16 01:14:43] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 01:14:43] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 01:14:43] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-16 01:14:43] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-16 01:14:43] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 01:14:43] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 01:14:43] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=7692 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3976859 steps, run timeout after 3038 ms. (steps per millisecond=1309 ) properties seen :{}
Probabilistic random walk after 3976859 steps, saw 1417188 distinct states, run finished after 3038 ms. (steps per millisecond=1309 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-16 01:14:46] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 01:14:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 01:14:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 01:14:46] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 01:14:46] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-16 01:14:46] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 99998 steps, including 0 resets, run visited all 1 properties in 58 ms. (steps per millisecond=1724 )
Parikh walk visited 1 properties in 57 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 59 ms.
Product exploration explored 100000 steps with 0 reset in 68 ms.
Built C files in :
/tmp/ltsmin14641425037318589665
[2022-05-16 01:14:47] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2022-05-16 01:14:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:14:47] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2022-05-16 01:14:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:14:47] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2022-05-16 01:14:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:14:47] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14641425037318589665
Running compilation step : cd /tmp/ltsmin14641425037318589665;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin14641425037318589665;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14641425037318589665;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2945881898742199561.hoa' '--buchi-type=spotba'
LTSmin run took 4110 ms.
FORMULA ERK-PT-100000-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ERK-PT-100000-LTLCardinality-03 finished in 12347 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Graph (trivial) has 3 edges and 10 vertex of which 2 / 10 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 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 8 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 8 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 6 transition count 7
Applied a total of 7 rules in 4 ms. Remains 6 /10 variables (removed 4) and now considering 7/11 (removed 4) transitions.
[2022-05-16 01:14:51] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 01:14:51] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 01:14:51] [INFO ] Implicit Places using invariants in 18 ms returned []
[2022-05-16 01:14:51] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 01:14:51] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 01:14:51] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-16 01:14:51] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-16 01:14:51] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 01:14:51] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 01:14:51] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/10 places, 7/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/10 places, 7/11 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ERK-PT-100000-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLCardinality-04 finished in 116 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((X(p1) U p2))))'
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:14:51] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:14:51] [INFO ] Implicit Places using invariants in 21 ms returned [0, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/10 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 8/10 places, 11/11 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(LEQ s7 s6), p1:(LEQ s2 s0), p0:(LEQ 2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 9 factoid took 174 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ERK-PT-100000-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ERK-PT-100000-LTLCardinality-06 finished in 550 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p0)||p1))&&!p0)))'
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:14:52] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:14:52] [INFO ] Implicit Places using invariants in 20 ms returned [0, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/10 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 8/10 places, 11/11 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GT 1 s2), p1:(AND (LEQ 1 s1) (LEQ 2 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ERK-PT-100000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLCardinality-07 finished in 198 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(!((G(F(!p0))||F(p1)) U p2)))))'
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:14:52] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:14:52] [INFO ] Implicit Places using invariants in 21 ms returned [0, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/10 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 8/10 places, 11/11 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, p2, p2]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(AND (LEQ 1 s2) (LEQ 2 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 109 steps with 0 reset in 3 ms.
FORMULA ERK-PT-100000-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLCardinality-11 finished in 123 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Graph (trivial) has 3 edges and 10 vertex of which 2 / 10 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.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 9 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 9 transition count 8
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 6 place count 8 transition count 8
Applied a total of 6 rules in 9 ms. Remains 8 /10 variables (removed 2) and now considering 8/11 (removed 3) transitions.
[2022-05-16 01:14:52] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 01:14:52] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:14:52] [INFO ] Implicit Places using invariants in 20 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/10 places, 8/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 6/10 places, 8/11 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 65 ms.
Product exploration explored 100000 steps with 0 reset in 79 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=5555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2422509 steps, run visited all 1 properties in 2511 ms. (steps per millisecond=964 )
Probabilistic random walk after 2422509 steps, saw 1571926 distinct states, run finished after 2511 ms. (steps per millisecond=964 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2022-05-16 01:14:55] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 6 cols
[2022-05-16 01:14:55] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 01:14:55] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-16 01:14:55] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 6 cols
[2022-05-16 01:14:55] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 01:14:55] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-16 01:14:55] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-16 01:14:55] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 6 cols
[2022-05-16 01:14:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 01:14:55] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=6250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2422509 steps, run visited all 1 properties in 2266 ms. (steps per millisecond=1069 )
Probabilistic random walk after 2422509 steps, saw 1571926 distinct states, run finished after 2266 ms. (steps per millisecond=1069 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 60 ms.
Product exploration explored 100000 steps with 0 reset in 203 ms.
Built C files in :
/tmp/ltsmin18125392172042392953
[2022-05-16 01:14:58] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2022-05-16 01:14:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:14:58] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2022-05-16 01:14:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:14:58] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2022-05-16 01:14:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:14:58] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18125392172042392953
Running compilation step : cd /tmp/ltsmin18125392172042392953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 79 ms.
Running link step : cd /tmp/ltsmin18125392172042392953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18125392172042392953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15750843581159208406.hoa' '--buchi-type=spotba'
LTSmin run took 2652 ms.
FORMULA ERK-PT-100000-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ERK-PT-100000-LTLCardinality-13 finished in 9043 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&F(((F(p1)||G(p2))&&!p0)))))'
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:01] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:15:01] [INFO ] Implicit Places using invariants in 28 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/10 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 9/10 places, 11/11 transitions.
Stuttering acceptance computed with spot in 320 ms :[true, true, (NOT p0), (NOT p0), (OR p0 (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 6}], [{ cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 1 s4), p1:(LEQ 2 s6), p2:(LEQ s5 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5796 reset in 58 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ERK-PT-100000-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ERK-PT-100000-LTLCardinality-14 finished in 433 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(G(X(G(p1)))&&G(F(p2)))))'
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:01] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:15:01] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:01] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:15:01] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:01] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:15:01] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 11/11 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GT s0 s6) (GT s7 s8)), p1:(LEQ s0 s6), p2:(GT s7 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 83 ms.
Product exploration explored 100000 steps with 0 reset in 147 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p0 (NOT p1)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 690 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=5555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3066101 steps, run timeout after 3001 ms. (steps per millisecond=1021 ) properties seen :{}
Probabilistic random walk after 3066101 steps, saw 1831560 distinct states, run finished after 3001 ms. (steps per millisecond=1021 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:15:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:15:06] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 01:15:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:15:06] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 01:15:06] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-16 01:15:06] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 199490 steps, including 0 resets, run visited all 1 properties in 178 ms. (steps per millisecond=1120 )
Parikh walk visited 1 properties in 177 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p0 (NOT p1)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT p0))]
Knowledge based reduction with 17 factoid took 741 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:15:07] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:07] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:15:07] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:15:07] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=7692 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2839958 steps, run timeout after 3001 ms. (steps per millisecond=946 ) properties seen :{}
Probabilistic random walk after 2839958 steps, saw 1751158 distinct states, run finished after 3001 ms. (steps per millisecond=946 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:15:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:15:10] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 01:15:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:15:10] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 01:15:10] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-16 01:15:10] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 200000 steps, including 0 resets, run visited all 1 properties in 276 ms. (steps per millisecond=724 )
Parikh walk visited 1 properties in 276 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 91 ms.
Product exploration explored 100000 steps with 0 reset in 107 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2022-05-16 01:15:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:11] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:15:11] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 11/11 transitions.
Product exploration explored 100000 steps with 0 reset in 87 ms.
Product exploration explored 100000 steps with 0 reset in 109 ms.
Built C files in :
/tmp/ltsmin16670719393699014635
[2022-05-16 01:15:12] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16670719393699014635
Running compilation step : cd /tmp/ltsmin16670719393699014635;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 76 ms.
Running link step : cd /tmp/ltsmin16670719393699014635;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin16670719393699014635;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased403778215361752813.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:27] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:15:27] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:27] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:15:27] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:27] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:15:27] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin11224948004071465832
[2022-05-16 01:15:27] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11224948004071465832
Running compilation step : cd /tmp/ltsmin11224948004071465832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin11224948004071465832;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin11224948004071465832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15866324557587177156.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:15:42] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:15:42] [INFO ] Flatten gal took : 12 ms
[2022-05-16 01:15:42] [INFO ] Time to serialize gal into /tmp/LTL881488113224194935.gal : 1 ms
[2022-05-16 01:15:42] [INFO ] Time to serialize properties into /tmp/LTL5774331315242102628.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL881488113224194935.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5774331315242102628.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8814881...265
Read 1 LTL properties
Checking formula 0 : !(((G("((Raf1Star>RKIPP_RP)||(MEKPP>ERK))"))||((G(X(G("(Raf1Star<=RKIPP_RP)"))))&&(G(F("(MEKPP>ERK)"))))))
Formula 0 simplified : !(G"((Raf1Star>RKIPP_RP)||(MEKPP>ERK))" | (GXG"(Raf1Star<=RKIPP_RP)" & GF"(MEKPP>ERK)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2022-05-16 01:15:42] [INFO ] Flatten gal took : 2 ms
[2022-05-16 01:15:42] [INFO ] Applying decomposition
[2022-05-16 01:15:42] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17041774232656606047.txt' '-o' '/tmp/graph17041774232656606047.bin' '-w' '/tmp/graph17041774232656606047.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17041774232656606047.bin' '-l' '-1' '-v' '-w' '/tmp/graph17041774232656606047.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:15:42] [INFO ] Decomposing Gal with order
[2022-05-16 01:15:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:15:42] [INFO ] Flatten gal took : 2 ms
[2022-05-16 01:15:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 01:15:42] [INFO ] Time to serialize gal into /tmp/LTL9462371984880900080.gal : 0 ms
[2022-05-16 01:15:42] [INFO ] Time to serialize properties into /tmp/LTL10093833162242049324.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9462371984880900080.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10093833162242049324.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9462371...267
Read 1 LTL properties
Checking formula 0 : !(((G("((gu0.Raf1Star>gu0.RKIPP_RP)||(gu3.MEKPP>gu3.ERK))"))||((G(X(G("(gu0.Raf1Star<=gu0.RKIPP_RP)"))))&&(G(F("(gu3.MEKPP>gu3.ERK)"))...159
Formula 0 simplified : !(G"((gu0.Raf1Star>gu0.RKIPP_RP)||(gu3.MEKPP>gu3.ERK))" | (GXG"(gu0.Raf1Star<=gu0.RKIPP_RP)" & GF"(gu3.MEKPP>gu3.ERK)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin6286716622338523253
[2022-05-16 01:15:42] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6286716622338523253
Running compilation step : cd /tmp/ltsmin6286716622338523253;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 71 ms.
Running link step : cd /tmp/ltsmin6286716622338523253;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6286716622338523253;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||([](X([]((LTLAPp1==true))))&&[](<>((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ERK-PT-100000-LTLCardinality-15 finished in 55909 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(G(X(G(p1)))&&G(F(p2)))))'
Found a SL insensitive property : ERK-PT-100000-LTLCardinality-15
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p0)]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 11
Applied a total of 1 rules in 3 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:58] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:15:58] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:15:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:15:58] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:58] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:15:58] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 10/10 places, 11/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 11/11 transitions.
Running random walk in product with property : ERK-PT-100000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GT s0 s6) (GT s7 s8)), p1:(LEQ s0 s6), p2:(GT s7 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 89 ms.
Product exploration explored 100000 steps with 0 reset in 113 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p0 (NOT p1)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 665 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=5263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3120769 steps, run timeout after 3001 ms. (steps per millisecond=1039 ) properties seen :{}
Probabilistic random walk after 3120769 steps, saw 1695015 distinct states, run finished after 3001 ms. (steps per millisecond=1039 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:16:02] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:16:02] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-16 01:16:02] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 01:16:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:16:02] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 01:16:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:16:02] [INFO ] After 2ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 01:16:02] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-16 01:16:02] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 199773 steps, including 0 resets, run visited all 1 properties in 128 ms. (steps per millisecond=1560 )
Parikh walk visited 1 properties in 128 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p0 (NOT p1)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT p0))]
Knowledge based reduction with 17 factoid took 585 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:16:03] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:16:03] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:16:03] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:16:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:16:03] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:16:03] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:16:03] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=5000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3217128 steps, run timeout after 3001 ms. (steps per millisecond=1072 ) properties seen :{}
Probabilistic random walk after 3217128 steps, saw 1726416 distinct states, run finished after 3001 ms. (steps per millisecond=1072 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:16:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:16:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:16:06] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 01:16:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:16:06] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 01:16:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:16:06] [INFO ] After 1ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 01:16:06] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-16 01:16:06] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 200000 steps, including 0 resets, run visited all 1 properties in 128 ms. (steps per millisecond=1562 )
Parikh walk visited 1 properties in 127 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 89 ms.
Product exploration explored 100000 steps with 0 reset in 108 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2022-05-16 01:16:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:16:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:16:07] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 11/11 transitions.
Product exploration explored 100000 steps with 0 reset in 83 ms.
Product exploration explored 100000 steps with 0 reset in 106 ms.
Built C files in :
/tmp/ltsmin12712791762929902181
[2022-05-16 01:16:07] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12712791762929902181
Running compilation step : cd /tmp/ltsmin12712791762929902181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin12712791762929902181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12712791762929902181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2580857314209295165.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:16:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:16:22] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:16:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:16:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 01:16:22] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:16:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:16:22] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin14715333336690549764
[2022-05-16 01:16:22] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14715333336690549764
Running compilation step : cd /tmp/ltsmin14715333336690549764;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin14715333336690549764;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14715333336690549764;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5440654706482238558.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:16:38] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:16:38] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:16:38] [INFO ] Time to serialize gal into /tmp/LTL13855418883825669569.gal : 1 ms
[2022-05-16 01:16:38] [INFO ] Time to serialize properties into /tmp/LTL4898294554353178092.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13855418883825669569.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4898294554353178092.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1385541...267
Read 1 LTL properties
Checking formula 0 : !(((G("((Raf1Star>RKIPP_RP)||(MEKPP>ERK))"))||((G(X(G("(Raf1Star<=RKIPP_RP)"))))&&(G(F("(MEKPP>ERK)"))))))
Formula 0 simplified : !(G"((Raf1Star>RKIPP_RP)||(MEKPP>ERK))" | (GXG"(Raf1Star<=RKIPP_RP)" & GF"(MEKPP>ERK)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2022-05-16 01:16:38] [INFO ] Flatten gal took : 1 ms
[2022-05-16 01:16:38] [INFO ] Applying decomposition
[2022-05-16 01:16:38] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13318852890769524234.txt' '-o' '/tmp/graph13318852890769524234.bin' '-w' '/tmp/graph13318852890769524234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13318852890769524234.bin' '-l' '-1' '-v' '-w' '/tmp/graph13318852890769524234.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:16:38] [INFO ] Decomposing Gal with order
[2022-05-16 01:16:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:16:38] [INFO ] Flatten gal took : 2 ms
[2022-05-16 01:16:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 01:16:38] [INFO ] Time to serialize gal into /tmp/LTL3776802243355984792.gal : 0 ms
[2022-05-16 01:16:38] [INFO ] Time to serialize properties into /tmp/LTL3951455241567826813.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3776802243355984792.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3951455241567826813.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3776802...266
Read 1 LTL properties
Checking formula 0 : !(((G("((gu0.Raf1Star>gu0.RKIPP_RP)||(gu3.MEKPP>gu3.ERK))"))||((G(X(G("(gu0.Raf1Star<=gu0.RKIPP_RP)"))))&&(G(F("(gu3.MEKPP>gu3.ERK)"))...159
Formula 0 simplified : !(G"((gu0.Raf1Star>gu0.RKIPP_RP)||(gu3.MEKPP>gu3.ERK))" | (GXG"(gu0.Raf1Star<=gu0.RKIPP_RP)" & GF"(gu3.MEKPP>gu3.ERK)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin12616946589139547426
[2022-05-16 01:16:38] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12616946589139547426
Running compilation step : cd /tmp/ltsmin12616946589139547426;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 71 ms.
Running link step : cd /tmp/ltsmin12616946589139547426;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin12616946589139547426;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||([](X([]((LTLAPp1==true))))&&[](<>((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ERK-PT-100000-LTLCardinality-15 finished in 55430 ms.
[2022-05-16 01:16:53] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
[2022-05-16 01:16:53] [INFO ] Applying decomposition
[2022-05-16 01:16:53] [INFO ] Flatten gal took : 1 ms
Built C files in :
/tmp/ltsmin7118105836102117388
[2022-05-16 01:16:53] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2022-05-16 01:16:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:16:53] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2022-05-16 01:16:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:16:53] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2022-05-16 01:16:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:16:53] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7118105836102117388
Running compilation step : cd /tmp/ltsmin7118105836102117388;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2342813521355287679.txt' '-o' '/tmp/graph2342813521355287679.bin' '-w' '/tmp/graph2342813521355287679.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2342813521355287679.bin' '-l' '-1' '-v' '-w' '/tmp/graph2342813521355287679.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:16:53] [INFO ] Decomposing Gal with order
[2022-05-16 01:16:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:16:53] [INFO ] Flatten gal took : 1 ms
[2022-05-16 01:16:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 01:16:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality9093417757485966630.gal : 1 ms
[2022-05-16 01:16:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality10248247107915927843.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9093417757485966630.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10248247107915927843.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !(((G("((gu2.Raf1Star>gu2.RKIPP_RP)||(gu3.MEKPP>gu3.ERK))"))||((G(X(G("(gu2.Raf1Star<=gu2.RKIPP_RP)"))))&&(G(F("(gu3.MEKPP>gu3.ERK)"))...159
Formula 0 simplified : !(G"((gu2.Raf1Star>gu2.RKIPP_RP)||(gu3.MEKPP>gu3.ERK))" | (GXG"(gu2.Raf1Star<=gu2.RKIPP_RP)" & GF"(gu3.MEKPP>gu3.ERK)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2022-05-16 01:16:53] [INFO ] Flatten gal took : 1 ms
[2022-05-16 01:16:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality4186174514925971128.gal : 1 ms
[2022-05-16 01:16:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality516459805478079937.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4186174514925971128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality516459805478079937.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...287
Read 1 LTL properties
Checking formula 0 : !(((G("((Raf1Star>RKIPP_RP)||(MEKPP>ERK))"))||((G(X(G("(Raf1Star<=RKIPP_RP)"))))&&(G(F("(MEKPP>ERK)"))))))
Formula 0 simplified : !(G"((Raf1Star>RKIPP_RP)||(MEKPP>ERK))" | (GXG"(Raf1Star<=RKIPP_RP)" & GF"(MEKPP>ERK)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2022-05-16 01:16:53] [INFO ] Flatten gal took : 1 ms
[2022-05-16 01:16:53] [INFO ] Input system was already deterministic with 11 transitions.
[2022-05-16 01:16:53] [INFO ] Transformed 10 places.
[2022-05-16 01:16:53] [INFO ] Transformed 11 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 01:16:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality11360268952307163560.gal : 1 ms
[2022-05-16 01:16:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality17674422859722622338.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11360268952307163560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17674422859722622338.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
Compilation finished in 88 ms.

Running link step : cd /tmp/ltsmin7118105836102117388;'gcc' '-shared' '-o' 'gal.so' 'model.o'
its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("((Raf1Star>RKIPP_RP)||(MEKPP>ERK))"))||((G(X(G("(Raf1Star<=RKIPP_RP)"))))&&(G(F("(MEKPP>ERK)"))))))
Formula 0 simplified : !(G"((Raf1Star>RKIPP_RP)||(MEKPP>ERK))" | (GXG"(Raf1Star<=RKIPP_RP)" & GF"(MEKPP>ERK)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin7118105836102117388;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||([](X([]((LTLAPp1==true))))&&[](<>((LTLAPp2==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: LTL layer: formula: ([]((LTLAPp0==true))||([](X([]((LTLAPp1==true))))&&[](<>((LTLAPp2==true)))))
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: "([]((LTLAPp0==true))||([](X([]((LTLAPp1==true))))&&[](<>((LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: 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.079: DFS-FIFO for weak LTL, using special progress label 15
pins2lts-mc-linux64( 0/ 8), 0.079: There are 16 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.079: State length is 11, there are 25 groups
pins2lts-mc-linux64( 0/ 8), 0.079: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.079: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.079: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.079: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.094: ~1 levels ~960 states ~4808 transitions
pins2lts-mc-linux64( 2/ 8), 0.100: ~1 levels ~1920 states ~10336 transitions
pins2lts-mc-linux64( 2/ 8), 0.108: ~1 levels ~3840 states ~21816 transitions
pins2lts-mc-linux64( 2/ 8), 0.122: ~1 levels ~7680 states ~47128 transitions
pins2lts-mc-linux64( 2/ 8), 0.146: ~1 levels ~15360 states ~99712 transitions
pins2lts-mc-linux64( 2/ 8), 0.222: ~1 levels ~30720 states ~206464 transitions
pins2lts-mc-linux64( 2/ 8), 0.429: ~1 levels ~61440 states ~420296 transitions
pins2lts-mc-linux64( 2/ 8), 0.803: ~1 levels ~122880 states ~860400 transitions
pins2lts-mc-linux64( 5/ 8), 1.404: ~1 levels ~245760 states ~1985392 transitions
pins2lts-mc-linux64( 5/ 8), 2.189: ~1 levels ~491520 states ~4087120 transitions
pins2lts-mc-linux64( 5/ 8), 3.253: ~1 levels ~983040 states ~8405256 transitions
pins2lts-mc-linux64( 6/ 8), 4.824: ~1 levels ~1966080 states ~17296280 transitions
pins2lts-mc-linux64( 6/ 8), 7.833: ~1 levels ~3932160 states ~35161216 transitions
pins2lts-mc-linux64( 2/ 8), 14.067: ~1 levels ~7864320 states ~69439648 transitions
pins2lts-mc-linux64( 2/ 8), 26.717: ~1 levels ~15728640 states ~141740664 transitions
pins2lts-mc-linux64( 2/ 8), 53.447: ~1 levels ~31457280 states ~289052680 transitions
pins2lts-mc-linux64( 6/ 8), 109.987: ~1 levels ~62914560 states ~601433712 transitions
pins2lts-mc-linux64( 6/ 8), 238.584: ~1 levels ~125829120 states ~1220168424 transitions
pins2lts-mc-linux64( 7/ 8), 281.600: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 281.616:
pins2lts-mc-linux64( 0/ 8), 281.616: mean standard work distribution: 3.5% (states) 2.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 281.616:
pins2lts-mc-linux64( 0/ 8), 281.616: Explored 129214818 states 1288189880 transitions, fanout: 9.969
pins2lts-mc-linux64( 0/ 8), 281.616: Total exploration time 281.530 sec (281.500 sec minimum, 281.515 sec on average)
pins2lts-mc-linux64( 0/ 8), 281.616: States per second: 458974, Transitions per second: 4575675
pins2lts-mc-linux64( 0/ 8), 281.616:
pins2lts-mc-linux64( 0/ 8), 281.616: Progress states detected: 134216369
pins2lts-mc-linux64( 0/ 8), 281.616: Redundant explorations: -3.7266
pins2lts-mc-linux64( 0/ 8), 281.616:
pins2lts-mc-linux64( 0/ 8), 281.616: Queue width: 8B, total height: 10301622, memory: 78.60MB
pins2lts-mc-linux64( 0/ 8), 281.616: Tree memory: 1065.9MB, 8.3 B/state, compr.: 18.1%
pins2lts-mc-linux64( 0/ 8), 281.616: Tree fill ratio (roots/leafs): 99.0%/16.0%
pins2lts-mc-linux64( 0/ 8), 281.616: Stored 11 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 281.616: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 281.616: Est. total memory use: 1144.5MB (~1102.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7118105836102117388;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||([](X([]((LTLAPp1==true))))&&[](<>((LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7118105836102117388;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||([](X([]((LTLAPp1==true))))&&[](<>((LTLAPp2==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Total runtime 477247 ms.

BK_STOP 1652664095202

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="ERK-PT-100000"
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 ERK-PT-100000, 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 r078-tall-165260110200363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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