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-165260110200364.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110200364
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME ERK-PT-100000-LTLFireability-01
FORMULA_NAME ERK-PT-100000-LTLFireability-02
FORMULA_NAME ERK-PT-100000-LTLFireability-03
FORMULA_NAME ERK-PT-100000-LTLFireability-04
FORMULA_NAME ERK-PT-100000-LTLFireability-05
FORMULA_NAME ERK-PT-100000-LTLFireability-06
FORMULA_NAME ERK-PT-100000-LTLFireability-07
FORMULA_NAME ERK-PT-100000-LTLFireability-08
FORMULA_NAME ERK-PT-100000-LTLFireability-09
FORMULA_NAME ERK-PT-100000-LTLFireability-10
FORMULA_NAME ERK-PT-100000-LTLFireability-11
FORMULA_NAME ERK-PT-100000-LTLFireability-12
FORMULA_NAME ERK-PT-100000-LTLFireability-13
FORMULA_NAME ERK-PT-100000-LTLFireability-14
FORMULA_NAME ERK-PT-100000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652663645686

Running Version 202205111006
[2022-05-16 01:14:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 01:14:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:14:07] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2022-05-16 01:14:07] [INFO ] Transformed 11 places.
[2022-05-16 01:14:07] [INFO ] Transformed 11 transitions.
[2022-05-16 01:14:07] [INFO ] Parsed PT model containing 11 places and 11 transitions in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ERK-PT-100000-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 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 8 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:14:07] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-16 01:14:07] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-16 01:14:07] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-16 01:14:07] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2022-05-16 01:14:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:14:07] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Support contains 11 out of 11 places after structural reductions.
[2022-05-16 01:14:07] [INFO ] Flatten gal took : 15 ms
[2022-05-16 01:14:07] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:14:07] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 51 ms. (steps per millisecond=1960 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 11 rows 11 cols
[2022-05-16 01:14:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:14:08] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 01:14:08] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 01:14:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 01:14:08] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 01:14:08] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-16 01:14:08] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4000 ms.
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 11/11 places, 11/11 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 10
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 10 transition count 9
Applied a total of 3 rules in 10 ms. Remains 10 /11 variables (removed 1) and now considering 9/11 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/11 places, 9/11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=2564 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 330596 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 330596 steps, saw 191925 distinct states, run finished after 3002 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 9 rows 10 cols
[2022-05-16 01:14:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:14:15] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 01:14:15] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 01:14:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 01:14:15] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 01:14:15] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-16 01:14:15] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4001 ms.
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 9/9 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-16 01:14:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:14:19] [INFO ] Implicit Places using invariants in 22 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 9/10 places, 9/9 transitions.
Applied a total of 0 rules in 3 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 9/10 places, 9/9 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=6666 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 323788 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 323788 steps, saw 187670 distinct states, run finished after 3002 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 9 rows 9 cols
[2022-05-16 01:14:22] [INFO ] Computed 4 place invariants in 1 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 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[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 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 01:14:22] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-16 01:14:22] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4001 ms.
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 9/9 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 11 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2022-05-16 01:14:26] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:14:26] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2022-05-16 01:14:26] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-16 01:14:26] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-16 01:14:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2022-05-16 01:14:26] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:14:26] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 9 rows 9 cols
[2022-05-16 01:14:26] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:14:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:14:26] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 01:14:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:14:26] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 01:14:26] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-16 01:14:26] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-16 01:14:26] [INFO ] Flatten gal took : 2 ms
[2022-05-16 01:14:26] [INFO ] Flatten gal took : 2 ms
[2022-05-16 01:14:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5007430477444993710.gal : 1 ms
[2022-05-16 01:14:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17619404873116476470.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11125875721859568593;'/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/ReachabilityCardinality5007430477444993710.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17619404873116476470.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
ITS-tools command line returned an error code 1
Loading property file /tmp/ReachabilityCardinality17619404873116476470.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
[2022-05-16 01:14:26] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:14:26] [INFO ] Applying decomposition
[2022-05-16 01:14:26] [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/graph10921801918070486355.txt' '-o' '/tmp/graph10921801918070486355.bin' '-w' '/tmp/graph10921801918070486355.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10921801918070486355.bin' '-l' '-1' '-v' '-w' '/tmp/graph10921801918070486355.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:14:27] [INFO ] Decomposing Gal with order
[2022-05-16 01:14:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:14:27] [INFO ] Flatten gal took : 27 ms
[2022-05-16 01:14:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 01:14:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11395453530549432811.gal : 1 ms
[2022-05-16 01:14:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11861990250572472437.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11125875721859568593;'/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/ReachabilityCardinality11395453530549432811.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11861990250572472437.prop' '--nowitness'

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...300
Loading property file /tmp/ReachabilityCardinality11861990250572472437.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/ltsmin6356083280276688224
[2022-05-16 01:14:27] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6356083280276688224
Running compilation step : cd /tmp/ltsmin6356083280276688224;'/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 168 ms.
Running link step : cd /tmp/ltsmin6356083280276688224;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6356083280276688224;'/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' 'AtomicPropp5==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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' '!(X(G((G(F(X(p0)))||p1))))'
Support contains 3 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 0 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:14:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:14:42] [INFO ] Implicit Places using invariants in 36 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/11 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/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s3 1), p0:(OR (LT s1 1) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4503 reset in 209 ms.
Stack based approach found an accepted trace after 77 steps with 5 reset with depth 9 and stack size 9 in 1 ms.
FORMULA ERK-PT-100000-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ERK-PT-100000-LTLFireability-00 finished in 588 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!(X(p0) U !G(p1)))||F(p0)))))'
Support contains 2 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 1 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:14:42] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-16 01:14:43] [INFO ] Implicit Places using invariants in 45 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ERK-PT-100000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s4 1), p1:(LT s1 1)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 5935 reset in 77 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ERK-PT-100000-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ERK-PT-100000-LTLFireability-01 finished in 314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(X(G((G(p1)&&p2))))))'
Support contains 5 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 0 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:14:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:14:43] [INFO ] Implicit Places using invariants in 37 ms returned [0, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p2) (NOT p1)), true, (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ERK-PT-100000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s5 1) (LT s4 1)), p2:(OR (LT s6 1) (LT s7 1)), p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ERK-PT-100000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLFireability-02 finished in 233 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(p1)))||G(((p1 U p2)||G(X(p1))))))'
Support contains 6 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 1 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:14:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:14:43] [INFO ] Implicit Places using invariants in 29 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 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.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), true]
Running random walk in product with property : ERK-PT-100000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s3 1)), p2:(AND (GEQ s7 1) (GEQ s8 1)), p1:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 118 ms.
Product exploration explored 100000 steps with 0 reset in 214 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 (NOT p0) p2 p1), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1170 ms. Reduced automaton from 6 states, 15 edges and 3 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=5000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 264358 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 264358 steps, saw 171118 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:14:48] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:14:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:14:48] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 01:14:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:14:48] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 01:14:48] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-16 01:14:48] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4000 ms.
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 5 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 8 transition count 7
Applied a total of 4 rules in 14 ms. Remains 8 /10 variables (removed 2) and now considering 7/11 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/10 places, 7/11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=8333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 300456 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 300456 steps, saw 172555 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 01:14:55] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:14:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:14:55] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 01:14:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:14:55] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 01:14:56] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-16 01:14:56] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6000 ms.
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 3 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 7/7 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 01:15:02] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:15:02] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 01:15:02] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:15:02] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-16 01:15:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 01:15:02] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:15:02] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 01:15:02] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:15:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:15:02] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 01:15:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-16 01:15:02] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 01:15:02] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-16 01:15:02] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-16 01:15:02] [INFO ] Flatten gal took : 1 ms
[2022-05-16 01:15:02] [INFO ] Flatten gal took : 1 ms
[2022-05-16 01:15:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4039446430756762713.gal : 0 ms
[2022-05-16 01:15:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4741820213250169605.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16333651699484859190;'/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/ReachabilityCardinality4039446430756762713.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4741820213250169605.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...319
Loading property file /tmp/ReachabilityCardinality4741820213250169605.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:15:02] [INFO ] Flatten gal took : 1 ms
[2022-05-16 01:15:02] [INFO ] Applying decomposition
[2022-05-16 01:15:02] [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/graph17757526299794659254.txt' '-o' '/tmp/graph17757526299794659254.bin' '-w' '/tmp/graph17757526299794659254.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17757526299794659254.bin' '-l' '-1' '-v' '-w' '/tmp/graph17757526299794659254.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:15:02] [INFO ] Decomposing Gal with order
[2022-05-16 01:15:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:15:02] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 01:15:02] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:15:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 01:15:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality406187917426742033.gal : 0 ms
[2022-05-16 01:15:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9261244066935491512.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16333651699484859190;'/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/ReachabilityCardinality406187917426742033.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9261244066935491512.prop' '--nowitness'

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...297
Loading property file /tmp/ReachabilityCardinality9261244066935491512.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/ltsmin11365615691507259065
[2022-05-16 01:15:02] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11365615691507259065
Running compilation step : cd /tmp/ltsmin11365615691507259065;'/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/ltsmin11365615691507259065;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11365615691507259065;'/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' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 919 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 10 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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:18] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:15:18] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:15:18] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:15:18] [INFO ] Dead Transitions using invariants and state equation in 21 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 : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 409 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=5263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 271642 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 271642 steps, saw 176581 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:15:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:15:22] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-16 01:15:22] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 01:15:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:15:22] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 01:15:22] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-16 01:15:22] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4000 ms.
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 8 transition count 7
Applied a total of 4 rules in 7 ms. Remains 8 /10 variables (removed 2) and now considering 7/11 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/10 places, 7/11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=6666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 336723 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 336723 steps, saw 195222 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 01:15:29] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:15:29] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-05-16 01:15:29] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 01:15:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:15:29] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 01:15:29] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-16 01:15:29] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6000 ms.
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 7/7 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 01:15:35] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:15:35] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 01:15:35] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:15:35] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-16 01:15:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 01:15:35] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:15:35] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 01:15:35] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:15:35] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-16 01:15:35] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 01:15:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 01:15:35] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 01:15:35] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-16 01:15:35] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-16 01:15:35] [INFO ] Flatten gal took : 1 ms
[2022-05-16 01:15:35] [INFO ] Flatten gal took : 1 ms
[2022-05-16 01:15:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14627280185385165124.gal : 0 ms
[2022-05-16 01:15:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10355640767594495269.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2691352408897085319;'/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/ReachabilityCardinality14627280185385165124.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10355640767594495269.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...321
Loading property file /tmp/ReachabilityCardinality10355640767594495269.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:15:35] [INFO ] Flatten gal took : 1 ms
[2022-05-16 01:15:35] [INFO ] Applying decomposition
[2022-05-16 01:15:35] [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/graph10820874794863753980.txt' '-o' '/tmp/graph10820874794863753980.bin' '-w' '/tmp/graph10820874794863753980.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10820874794863753980.bin' '-l' '-1' '-v' '-w' '/tmp/graph10820874794863753980.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:15:35] [INFO ] Decomposing Gal with order
[2022-05-16 01:15:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:15:35] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 01:15:35] [INFO ] Flatten gal took : 2 ms
[2022-05-16 01:15:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 01:15:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2064647979017256493.gal : 1 ms
[2022-05-16 01:15:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13748340155299853026.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2691352408897085319;'/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/ReachabilityCardinality2064647979017256493.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13748340155299853026.prop' '--nowitness'

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...299
Loading property file /tmp/ReachabilityCardinality13748340155299853026.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/ltsmin10303152018861690904
[2022-05-16 01:15:35] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10303152018861690904
Running compilation step : cd /tmp/ltsmin10303152018861690904;'/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/ltsmin10303152018861690904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10303152018861690904;'/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' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 297 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 122 ms.
Product exploration explored 100000 steps with 0 reset in 196 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
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.
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.
Applied a total of 1 rules in 2 ms. Remains 9 /10 variables (removed 1) and now considering 10/11 (removed 1) transitions.
[2022-05-16 01:15:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 9 cols
[2022-05-16 01:15:52] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-16 01:15:52] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/10 places, 10/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/10 places, 10/11 transitions.
Product exploration explored 100000 steps with 0 reset in 115 ms.
Product exploration explored 100000 steps with 0 reset in 155 ms.
Built C files in :
/tmp/ltsmin3580106292923294585
[2022-05-16 01:15:52] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3580106292923294585
Running compilation step : cd /tmp/ltsmin3580106292923294585;'/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 86 ms.
Running link step : cd /tmp/ltsmin3580106292923294585;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin3580106292923294585;'/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/stateBased14869502748720248947.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:08] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:16:08] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:16:08] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:16:08] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 01:16:08] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 01:16:08] [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/ltsmin7288372719466117181
[2022-05-16 01:16:08] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7288372719466117181
Running compilation step : cd /tmp/ltsmin7288372719466117181;'/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 81 ms.
Running link step : cd /tmp/ltsmin7288372719466117181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7288372719466117181;'/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/stateBased9849357320430582126.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:16:23] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:16:23] [INFO ] Flatten gal took : 1 ms
[2022-05-16 01:16:23] [INFO ] Time to serialize gal into /tmp/LTL12915512656305182433.gal : 0 ms
[2022-05-16 01:16:23] [INFO ] Time to serialize properties into /tmp/LTL11721967596970290290.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/LTL12915512656305182433.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11721967596970290290.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/LTL1291551...268
Read 1 LTL properties
Checking formula 0 : !(((("((Raf1Star_RKIP>=1)&&(ERKPP>=1))")U(X(G("((Raf1Star>=1)&&(RKIP>=1))"))))||(G((("((Raf1Star>=1)&&(RKIP>=1))")U("((MEKPP>=1)&&(ERK...205
Formula 0 simplified : !(("((Raf1Star_RKIP>=1)&&(ERKPP>=1))" U XG"((Raf1Star>=1)&&(RKIP>=1))") | G(("((Raf1Star>=1)&&(RKIP>=1))" U "((MEKPP>=1)&&(ERK>=1))"...191
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2022-05-16 01:16:23] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:16:23] [INFO ] Applying decomposition
[2022-05-16 01:16:23] [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/graph6280710146198439284.txt' '-o' '/tmp/graph6280710146198439284.bin' '-w' '/tmp/graph6280710146198439284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6280710146198439284.bin' '-l' '-1' '-v' '-w' '/tmp/graph6280710146198439284.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:16:23] [INFO ] Decomposing Gal with order
[2022-05-16 01:16:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:16:23] [INFO ] Flatten gal took : 2 ms
[2022-05-16 01:16:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 01:16:23] [INFO ] Time to serialize gal into /tmp/LTL4280179757932886046.gal : 1 ms
[2022-05-16 01:16:23] [INFO ] Time to serialize properties into /tmp/LTL3929260196808005196.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/LTL4280179757932886046.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3929260196808005196.ltl' '-c' '-stutter-deadlock'

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/LTL4280179...245
Read 1 LTL properties
Checking formula 0 : !(((("((i0.u0.Raf1Star_RKIP>=1)&&(i0.u1.ERKPP>=1))")U(X(G("((i0.u0.Raf1Star>=1)&&(i0.u0.RKIP>=1))"))))||(G((("((i0.u0.Raf1Star>=1)&&(i...259
Formula 0 simplified : !(("((i0.u0.Raf1Star_RKIP>=1)&&(i0.u1.ERKPP>=1))" U XG"((i0.u0.Raf1Star>=1)&&(i0.u0.RKIP>=1))") | G(("((i0.u0.Raf1Star>=1)&&(i0.u0.R...245
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin5607724837590152501
[2022-05-16 01:16:23] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5607724837590152501
Running compilation step : cd /tmp/ltsmin5607724837590152501;'/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/ltsmin5607724837590152501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5607724837590152501;'/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) U X([]((LTLAPp1==true))))||[]((((LTLAPp1==true) U (LTLAPp2==true))||[](X((LTLAPp1==true))))))' '--buchi-type=spotba'
LTSmin run took 4350 ms.
FORMULA ERK-PT-100000-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ERK-PT-100000-LTLFireability-03 finished in 104273 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||X(G(p1)))))'
Support contains 3 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 1 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:16:27] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:16:27] [INFO ] Implicit Places using invariants in 28 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ERK-PT-100000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GEQ s4 1), p0:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 2 steps with 0 reset in 1 ms.
FORMULA ERK-PT-100000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLFireability-05 finished in 227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 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 0 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:16:28] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:16:28] [INFO ] Implicit Places using invariants in 31 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 32 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/11 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/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1)], 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][false, false]]
Product exploration explored 100000 steps with 27919 reset in 52 ms.
Stack based approach found an accepted trace after 24 steps with 9 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ERK-PT-100000-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ERK-PT-100000-LTLFireability-06 finished in 182 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 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 0 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:16:28] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:16:28] [INFO ] Implicit Places using invariants in 31 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s3 1)], 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][false, false]]
Product exploration explored 100000 steps with 29655 reset in 51 ms.
Stack based approach found an accepted trace after 11 steps with 3 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ERK-PT-100000-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ERK-PT-100000-LTLFireability-07 finished in 171 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((F(p0)&&p1)))||X(F(G((!p1 U !p1))))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 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 11 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 9 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 9 transition count 10
Applied a total of 4 rules in 4 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 9 cols
[2022-05-16 01:16:28] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 01:16:28] [INFO ] Implicit Places using invariants in 27 ms returned [0, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/11 places, 10/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/11 places, 10/11 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : ERK-PT-100000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s3 1), p0:(OR (LT s1 1) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 100 steps with 4 reset in 1 ms.
FORMULA ERK-PT-100000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLFireability-08 finished in 132 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G((F(p2)&&p1))&&p0))))'
Support contains 6 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 1 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:16:28] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:16:28] [INFO ] Implicit Places using invariants in 26 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 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.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ERK-PT-100000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1)), p1:(AND (GEQ s8 1) (GEQ s9 1)), p2:(OR (LT s1 1) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1692 reset in 178 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA ERK-PT-100000-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ERK-PT-100000-LTLFireability-09 finished in 397 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||p1))))'
Support contains 3 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 0 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:16:28] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:16:28] [INFO ] Implicit Places using invariants in 23 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/11 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/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ERK-PT-100000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1)), p1:(GEQ s4 1)], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ERK-PT-100000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLFireability-11 finished in 171 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 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 11 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 9 transition count 10
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 5 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 6 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 6 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 9 place count 6 transition count 7
Applied a total of 9 rules in 7 ms. Remains 6 /11 variables (removed 5) and now considering 7/11 (removed 4) transitions.
[2022-05-16 01:16:29] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2022-05-16 01:16:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 01:16:29] [INFO ] Implicit Places using invariants in 23 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/11 places, 7/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 5/11 places, 7/11 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLFireability-12 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:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ERK-PT-100000-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLFireability-12 finished in 121 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((G(p1)||p0)))&&F(p1)))'
Support contains 4 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 0 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:16:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:16:29] [INFO ] Implicit Places using invariants in 32 ms returned [0, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/11 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/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ERK-PT-100000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LT s3 1), p0:(OR (LT s5 1) (AND (GEQ s6 1) (GEQ s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 57 ms.
Product exploration explored 100000 steps with 50000 reset in 64 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 208 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ERK-PT-100000-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ERK-PT-100000-LTLFireability-13 finished in 484 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((F(!(p0 U F(p0)))||p0)))))'
Support contains 2 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 1 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:16:29] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:16:29] [INFO ] Implicit Places using invariants in 26 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/11 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/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 136 ms :[false, false, false, p0]
Running random walk in product with property : ERK-PT-100000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 85 ms.
Product exploration explored 100000 steps with 0 reset in 176 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 141 ms :[false, false, false, p0]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=5882 ) 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 3154306 steps, run timeout after 3001 ms. (steps per millisecond=1051 ) properties seen :{}
Probabilistic random walk after 3154306 steps, saw 1738340 distinct states, run finished after 3001 ms. (steps per millisecond=1051 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 9 cols
[2022-05-16 01:16:33] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 01:16:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 01:16:33] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 01:16:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 01:16:33] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 01:16:33] [INFO ] After 6ms 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:33] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 300000 steps, including 0 resets, run visited all 1 properties in 289 ms. (steps per millisecond=1038 )
Parikh walk visited 1 properties in 288 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 133 ms :[false, false, false, p0]
Stuttering acceptance computed with spot in 140 ms :[false, false, false, p0]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 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.
// Phase 1: matrix 11 rows 9 cols
[2022-05-16 01:16:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 01:16:34] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 11 rows 9 cols
[2022-05-16 01:16:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 01:16:34] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 9 cols
[2022-05-16 01:16:34] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 01:16:34] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 145 ms :[false, false, false, 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 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3105422 steps, run timeout after 3001 ms. (steps per millisecond=1034 ) properties seen :{}
Probabilistic random walk after 3105422 steps, saw 1722542 distinct states, run finished after 3004 ms. (steps per millisecond=1033 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 9 cols
[2022-05-16 01:16:37] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 01:16:37] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 01:16:37] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 01:16:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 01:16:37] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 01:16:37] [INFO ] After 6ms 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:37] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 298857 steps, including 0 resets, run visited all 1 properties in 198 ms. (steps per millisecond=1509 )
Parikh walk visited 1 properties in 197 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 132 ms :[false, false, false, p0]
Stuttering acceptance computed with spot in 215 ms :[false, false, false, p0]
Stuttering acceptance computed with spot in 134 ms :[false, false, false, p0]
Product exploration explored 100000 steps with 0 reset in 101 ms.
Product exploration explored 100000 steps with 0 reset in 139 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 137 ms :[false, false, false, p0]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 11/11 transitions.
Graph (trivial) has 5 edges and 9 vertex of which 4 / 9 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 3 ms. Remains 7 /9 variables (removed 2) and now considering 9/11 (removed 2) transitions.
[2022-05-16 01:16:38] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-16 01:16:38] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 7 cols
[2022-05-16 01:16:38] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 01:16:38] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 9/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 9/11 transitions.
Product exploration explored 100000 steps with 0 reset in 126 ms.
Product exploration explored 100000 steps with 0 reset in 148 ms.
Built C files in :
/tmp/ltsmin8892873826588200885
[2022-05-16 01:16:39] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8892873826588200885
Running compilation step : cd /tmp/ltsmin8892873826588200885;'/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 74 ms.
Running link step : cd /tmp/ltsmin8892873826588200885;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8892873826588200885;'/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/stateBased16771408531887804143.hoa' '--buchi-type=spotba'
LTSmin run took 2568 ms.
FORMULA ERK-PT-100000-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ERK-PT-100000-LTLFireability-14 finished in 12092 ms.
All properties solved by simple procedures.
Total runtime 154920 ms.

BK_STOP 1652663801894

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ERK-PT-100000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110200364"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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