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.r312-tall-165472282100355.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 DoubleLock-PT-p3s3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282100355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.0K Jun 7 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 7 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 7 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 7 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 7 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 1.4M Jun 6 12:11 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 DoubleLock-PT-p3s3-LTLCardinality-00
FORMULA_NAME DoubleLock-PT-p3s3-LTLCardinality-01
FORMULA_NAME DoubleLock-PT-p3s3-LTLCardinality-02
FORMULA_NAME DoubleLock-PT-p3s3-LTLCardinality-03
FORMULA_NAME DoubleLock-PT-p3s3-LTLCardinality-04
FORMULA_NAME DoubleLock-PT-p3s3-LTLCardinality-05
FORMULA_NAME DoubleLock-PT-p3s3-LTLCardinality-06
FORMULA_NAME DoubleLock-PT-p3s3-LTLCardinality-07
FORMULA_NAME DoubleLock-PT-p3s3-LTLCardinality-08
FORMULA_NAME DoubleLock-PT-p3s3-LTLCardinality-09
FORMULA_NAME DoubleLock-PT-p3s3-LTLCardinality-10
FORMULA_NAME DoubleLock-PT-p3s3-LTLCardinality-11
FORMULA_NAME DoubleLock-PT-p3s3-LTLCardinality-12
FORMULA_NAME DoubleLock-PT-p3s3-LTLCardinality-13
FORMULA_NAME DoubleLock-PT-p3s3-LTLCardinality-14
FORMULA_NAME DoubleLock-PT-p3s3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1654809739674

Running Version 202205111006
[2022-06-09 21:22:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 21:22:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 21:22:21] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2022-06-09 21:22:21] [INFO ] Transformed 306 places.
[2022-06-09 21:22:21] [INFO ] Transformed 3136 transitions.
[2022-06-09 21:22:21] [INFO ] Parsed PT model containing 306 places and 3136 transitions in 337 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 68 places in 12 ms
Reduce places removed 68 places and 128 transitions.
FORMULA DoubleLock-PT-p3s3-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 3008/3008 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 235 transition count 3008
Applied a total of 3 rules in 63 ms. Remains 235 /238 variables (removed 3) and now considering 3008/3008 (removed 0) transitions.
[2022-06-09 21:22:21] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:22:21] [INFO ] Computed 2 place invariants in 45 ms
[2022-06-09 21:22:21] [INFO ] Implicit Places using invariants in 415 ms returned []
[2022-06-09 21:22:21] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:22:21] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-09 21:22:22] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:22:24] [INFO ] Implicit Places using invariants and state equation in 2970 ms returned []
Implicit Place search using SMT with State Equation took 3413 ms to find 0 implicit places.
[2022-06-09 21:22:24] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:22:24] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-09 21:22:25] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/238 places, 3008/3008 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/238 places, 3008/3008 transitions.
Support contains 25 out of 235 places after structural reductions.
[2022-06-09 21:22:26] [INFO ] Flatten gal took : 222 ms
[2022-06-09 21:22:26] [INFO ] Flatten gal took : 160 ms
[2022-06-09 21:22:26] [INFO ] Input system was already deterministic with 3008 transitions.
Incomplete random walk after 10003 steps, including 92 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 21) seen :7
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2022-06-09 21:22:27] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:22:27] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 21:22:27] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 21:22:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 21:22:27] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-09 21:22:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 21:22:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-09 21:22:28] [INFO ] After 532ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :2
[2022-06-09 21:22:28] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:22:28] [INFO ] After 454ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :7 sat :2
[2022-06-09 21:22:28] [INFO ] After 673ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :2
Attempting to minimize the solution found.
Minimization took 3898 ms.
[2022-06-09 21:22:32] [INFO ] After 5248ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :2
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 235 transition count 2976
Applied a total of 32 rules in 131 ms. Remains 235 /235 variables (removed 0) and now considering 2976/3008 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/3008 transitions.
Incomplete random walk after 10001 steps, including 96 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 188638 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188638 steps, saw 141309 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-09 21:22:36] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:22:36] [INFO ] Computed 3 place invariants in 10 ms
[2022-06-09 21:22:36] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 21:22:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 21:22:36] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 21:22:36] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:22:37] [INFO ] After 964ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 21:22:37] [INFO ] After 1148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 118 ms.
[2022-06-09 21:22:37] [INFO ] After 1745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 63 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 57 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
[2022-06-09 21:22:37] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:22:38] [INFO ] Computed 3 place invariants in 18 ms
[2022-06-09 21:22:38] [INFO ] Implicit Places using invariants in 276 ms returned []
[2022-06-09 21:22:38] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:22:38] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-09 21:22:38] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:22:39] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 1848 ms to find 0 implicit places.
[2022-06-09 21:22:40] [INFO ] Redundant transitions in 212 ms returned []
[2022-06-09 21:22:40] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 21:22:40] [INFO ] Computed 3 place invariants in 15 ms
[2022-06-09 21:22:40] [INFO ] Dead Transitions using invariants and state equation in 893 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Ensure Unique test removed 887 transitions
Reduce isomorphic transitions removed 887 transitions.
Iterating post reduction 0 with 887 rules applied. Total rules applied 887 place count 235 transition count 2089
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 887 place count 235 transition count 2080
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 905 place count 226 transition count 2080
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 907 place count 225 transition count 2079
Applied a total of 907 rules in 71 ms. Remains 225 /235 variables (removed 10) and now considering 2079/2976 (removed 897) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2079 rows 225 cols
[2022-06-09 21:22:41] [INFO ] Computed 3 place invariants in 15 ms
[2022-06-09 21:22:41] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 21:22:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 21:22:41] [INFO ] After 732ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 21:22:42] [INFO ] After 928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 110 ms.
[2022-06-09 21:22:42] [INFO ] After 1095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 7 atomic propositions for a total of 11 simplifications.
FORMULA DoubleLock-PT-p3s3-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 960 stable transitions
FORMULA DoubleLock-PT-p3s3-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 13 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2022-06-09 21:22:42] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:22:42] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-09 21:22:42] [INFO ] Implicit Places using invariants in 247 ms returned []
[2022-06-09 21:22:42] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:22:42] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-09 21:22:43] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:22:46] [INFO ] Implicit Places using invariants and state equation in 3839 ms returned []
Implicit Place search using SMT with State Equation took 4092 ms to find 0 implicit places.
[2022-06-09 21:22:46] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:22:46] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 21:22:47] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 3008/3008 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s3-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s225 s14)], 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 50000 reset in 564 ms.
Product exploration explored 100000 steps with 50000 reset in 415 ms.
Computed a total of 9 stabilizing places and 960 stable transitions
Computed a total of 9 stabilizing places and 960 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleLock-PT-p3s3-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p3s3-LTLCardinality-01 finished in 6186 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(G(p1))))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 18 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2022-06-09 21:22:48] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:22:48] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-09 21:22:48] [INFO ] Implicit Places using invariants in 238 ms returned []
[2022-06-09 21:22:48] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:22:48] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-09 21:22:49] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:22:51] [INFO ] Implicit Places using invariants and state equation in 3062 ms returned []
Implicit Place search using SMT with State Equation took 3303 ms to find 0 implicit places.
[2022-06-09 21:22:51] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:22:51] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-09 21:22:52] [INFO ] Dead Transitions using invariants and state equation in 824 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 3008/3008 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : DoubleLock-PT-p3s3-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s205 s45), p1:(GT s79 s125)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p3s3-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s3-LTLCardinality-09 finished in 4408 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!(p0 U p1))||F(!(p2 U p3)))))'
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 16 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2022-06-09 21:22:53] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:22:53] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-09 21:22:53] [INFO ] Implicit Places using invariants in 235 ms returned []
[2022-06-09 21:22:53] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:22:53] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-09 21:22:53] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:22:57] [INFO ] Implicit Places using invariants and state equation in 3873 ms returned []
Implicit Place search using SMT with State Equation took 4110 ms to find 0 implicit places.
[2022-06-09 21:22:57] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:22:57] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-09 21:22:57] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 3008/3008 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND p1 p3), (AND p1 p3), (AND p1 p3), p3]
Running random walk in product with property : DoubleLock-PT-p3s3-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p3), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p2 p0 (NOT p1)) (AND p3 p0 (NOT p1))), acceptance={} source=2 dest: 2}, { cond=(OR (AND p2 p1) (AND p3 p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=p3, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GT s103 s42), p3:(OR (LEQ 1 s137) (GT s11 s158)), p0:(LEQ s11 s158), p1:(LEQ 1 s137)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 343 ms.
Product exploration explored 100000 steps with 50000 reset in 343 ms.
Computed a total of 9 stabilizing places and 960 stable transitions
Computed a total of 9 stabilizing places and 960 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) p0 (NOT p1)), (X (NOT (OR p2 p3))), (X (X (NOT (OR (AND p2 p0 (NOT p1)) (AND p3 p0 (NOT p1)))))), (X (X (NOT (OR (AND p2 p1) (AND p3 p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR p2 p3)))
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 4 states, 6 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleLock-PT-p3s3-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p3s3-LTLCardinality-10 finished in 5924 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 81 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2022-06-09 21:22:59] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:22:59] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 21:22:59] [INFO ] Implicit Places using invariants in 284 ms returned []
[2022-06-09 21:22:59] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:22:59] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 21:22:59] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:23:02] [INFO ] Implicit Places using invariants and state equation in 3447 ms returned []
Implicit Place search using SMT with State Equation took 3756 ms to find 0 implicit places.
[2022-06-09 21:23:02] [INFO ] Redundant transitions in 162 ms returned []
[2022-06-09 21:23:02] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:23:02] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 21:23:03] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 3008/3008 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s3-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s112)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33308 reset in 340 ms.
Product exploration explored 100000 steps with 33298 reset in 384 ms.
Computed a total of 9 stabilizing places and 960 stable transitions
Computed a total of 9 stabilizing places and 960 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2022-06-09 21:23:04] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:23:04] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 21:23:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 21:23:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 21:23:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 21:23:05] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2022-06-09 21:23:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 21:23:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 21:23:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 21:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 21:23:06] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2022-06-09 21:23:06] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:23:07] [INFO ] [Nat]Added 143 Read/Feed constraints in 119 ms returned sat
[2022-06-09 21:23:07] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1860 transitions) in 258 ms.
[2022-06-09 21:23:07] [INFO ] Added : 0 causal constraints over 0 iterations in 406 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 61 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2022-06-09 21:23:07] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:23:07] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-09 21:23:07] [INFO ] Implicit Places using invariants in 230 ms returned []
[2022-06-09 21:23:07] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:23:07] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 21:23:08] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:23:11] [INFO ] Implicit Places using invariants and state equation in 3560 ms returned []
Implicit Place search using SMT with State Equation took 3793 ms to find 0 implicit places.
[2022-06-09 21:23:11] [INFO ] Redundant transitions in 63 ms returned []
[2022-06-09 21:23:11] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:23:11] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-09 21:23:12] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 3008/3008 transitions.
Computed a total of 9 stabilizing places and 960 stable transitions
Computed a total of 9 stabilizing places and 960 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2022-06-09 21:23:12] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:23:12] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-09 21:23:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 21:23:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-09 21:23:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 21:23:13] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2022-06-09 21:23:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 21:23:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 21:23:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 21:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 21:23:14] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2022-06-09 21:23:14] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:23:14] [INFO ] [Nat]Added 143 Read/Feed constraints in 120 ms returned sat
[2022-06-09 21:23:14] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1860 transitions) in 190 ms.
[2022-06-09 21:23:15] [INFO ] Added : 0 causal constraints over 0 iterations in 319 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 33320 reset in 375 ms.
Product exploration explored 100000 steps with 33351 reset in 351 ms.
Built C files in :
/tmp/ltsmin6493544761366225543
[2022-06-09 21:23:15] [INFO ] Too many transitions (3008) to apply POR reductions. Disabling POR matrices.
[2022-06-09 21:23:15] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6493544761366225543
Running compilation step : cd /tmp/ltsmin6493544761366225543;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6493544761366225543;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6493544761366225543;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 69 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2022-06-09 21:23:19] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:23:19] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 21:23:19] [INFO ] Implicit Places using invariants in 257 ms returned []
[2022-06-09 21:23:19] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:23:19] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 21:23:19] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:23:22] [INFO ] Implicit Places using invariants and state equation in 3085 ms returned []
Implicit Place search using SMT with State Equation took 3349 ms to find 0 implicit places.
[2022-06-09 21:23:22] [INFO ] Redundant transitions in 61 ms returned []
[2022-06-09 21:23:22] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:23:22] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-09 21:23:23] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 3008/3008 transitions.
Built C files in :
/tmp/ltsmin331135060117205498
[2022-06-09 21:23:23] [INFO ] Too many transitions (3008) to apply POR reductions. Disabling POR matrices.
[2022-06-09 21:23:23] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin331135060117205498
Running compilation step : cd /tmp/ltsmin331135060117205498;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin331135060117205498;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin331135060117205498;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-09 21:23:26] [INFO ] Flatten gal took : 113 ms
[2022-06-09 21:23:26] [INFO ] Flatten gal took : 114 ms
[2022-06-09 21:23:26] [INFO ] Time to serialize gal into /tmp/LTL7741207225465666988.gal : 19 ms
[2022-06-09 21:23:26] [INFO ] Time to serialize properties into /tmp/LTL10358925313698030410.ltl : 40 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/LTL7741207225465666988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10358925313698030410.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/LTL7741207...267
Read 1 LTL properties
Checking formula 0 : !((F("(s0<=p112)")))
Formula 0 simplified : !F"(s0<=p112)"
Detected timeout of ITS tools.
[2022-06-09 21:23:41] [INFO ] Flatten gal took : 107 ms
[2022-06-09 21:23:41] [INFO ] Applying decomposition
[2022-06-09 21:23:42] [INFO ] Flatten gal took : 100 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/graph1094538243698479917.txt' '-o' '/tmp/graph1094538243698479917.bin' '-w' '/tmp/graph1094538243698479917.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1094538243698479917.bin' '-l' '-1' '-v' '-w' '/tmp/graph1094538243698479917.weights' '-q' '0' '-e' '0.001'
[2022-06-09 21:23:42] [INFO ] Decomposing Gal with order
[2022-06-09 21:23:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 21:23:43] [INFO ] Removed a total of 3984 redundant transitions.
[2022-06-09 21:23:43] [INFO ] Flatten gal took : 843 ms
[2022-06-09 21:23:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 717 labels/synchronizations in 67 ms.
[2022-06-09 21:23:43] [INFO ] Time to serialize gal into /tmp/LTL5603709688193907495.gal : 9 ms
[2022-06-09 21:23:43] [INFO ] Time to serialize properties into /tmp/LTL9159845658010154731.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/LTL5603709688193907495.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9159845658010154731.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/LTL5603709...266
Read 1 LTL properties
Checking formula 0 : !((F("(gu5.s0<=gu5.p112)")))
Formula 0 simplified : !F"(gu5.s0<=gu5.p112)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9434478759973719330
[2022-06-09 21:23:58] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9434478759973719330
Running compilation step : cd /tmp/ltsmin9434478759973719330;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9434478759973719330;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9434478759973719330;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property DoubleLock-PT-p3s3-LTLCardinality-11 finished in 62784 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(p0))&&F(F(X(p1))))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 3008/3008 transitions.
Applied a total of 0 rules in 51 ms. Remains 235 /235 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2022-06-09 21:24:01] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:24:01] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 21:24:02] [INFO ] Implicit Places using invariants in 276 ms returned []
[2022-06-09 21:24:02] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:24:02] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 21:24:02] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-09 21:24:05] [INFO ] Implicit Places using invariants and state equation in 3210 ms returned []
Implicit Place search using SMT with State Equation took 3491 ms to find 0 implicit places.
[2022-06-09 21:24:05] [INFO ] Redundant transitions in 62 ms returned []
[2022-06-09 21:24:05] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 235 cols
[2022-06-09 21:24:05] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-09 21:24:06] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 3008/3008 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p3s3-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s79 s67), p1:(GT s12 s79)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p3s3-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s3-LTLCardinality-12 finished in 4463 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2022-06-09 21:24:06] [INFO ] Flatten gal took : 91 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13728985686199161799
[2022-06-09 21:24:06] [INFO ] Too many transitions (3008) to apply POR reductions. Disabling POR matrices.
[2022-06-09 21:24:06] [INFO ] Applying decomposition
[2022-06-09 21:24:06] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13728985686199161799
Running compilation step : cd /tmp/ltsmin13728985686199161799;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-09 21:24:06] [INFO ] Flatten gal took : 86 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/graph6577002229037819395.txt' '-o' '/tmp/graph6577002229037819395.bin' '-w' '/tmp/graph6577002229037819395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6577002229037819395.bin' '-l' '-1' '-v' '-w' '/tmp/graph6577002229037819395.weights' '-q' '0' '-e' '0.001'
[2022-06-09 21:24:06] [INFO ] Decomposing Gal with order
[2022-06-09 21:24:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 21:24:06] [INFO ] Removed a total of 7183 redundant transitions.
[2022-06-09 21:24:07] [INFO ] Flatten gal took : 187 ms
[2022-06-09 21:24:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 34 ms.
[2022-06-09 21:24:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality4499933233322498087.gal : 7 ms
[2022-06-09 21:24:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality13911698659394177040.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/LTLCardinality4499933233322498087.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13911698659394177040.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((F("(gu0.s0<=gu0.p112)")))
Formula 0 simplified : !F"(gu0.s0<=gu0.p112)"
Compilation finished in 6803 ms.
Running link step : cd /tmp/ltsmin13728985686199161799;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin13728985686199161799;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
LTSmin run took 99995 ms.
FORMULA DoubleLock-PT-p3s3-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 212636 ms.

BK_STOP 1654809953535

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleLock-PT-p3s3"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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