Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416400796.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ResAllocation-PT-R015C002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416400796
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 10:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 25 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Mar 25 14:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 9 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 64K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ResAllocation-PT-R015C002-00
FORMULA_NAME ResAllocation-PT-R015C002-01
FORMULA_NAME ResAllocation-PT-R015C002-02
FORMULA_NAME ResAllocation-PT-R015C002-03
FORMULA_NAME ResAllocation-PT-R015C002-04
FORMULA_NAME ResAllocation-PT-R015C002-05
FORMULA_NAME ResAllocation-PT-R015C002-06
FORMULA_NAME ResAllocation-PT-R015C002-07
FORMULA_NAME ResAllocation-PT-R015C002-08
FORMULA_NAME ResAllocation-PT-R015C002-09
FORMULA_NAME ResAllocation-PT-R015C002-10
FORMULA_NAME ResAllocation-PT-R015C002-11
FORMULA_NAME ResAllocation-PT-R015C002-12
FORMULA_NAME ResAllocation-PT-R015C002-13
FORMULA_NAME ResAllocation-PT-R015C002-14
FORMULA_NAME ResAllocation-PT-R015C002-15

=== Now, execution of the tool begins

BK_START 1621266812997

Running Version 0
[2021-05-17 15:53:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 15:53:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:53:35] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2021-05-17 15:53:35] [INFO ] Transformed 60 places.
[2021-05-17 15:53:35] [INFO ] Transformed 32 transitions.
[2021-05-17 15:53:35] [INFO ] Parsed PT model containing 60 places and 32 transitions in 76 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 15:53:35] [INFO ] Initial state test concluded for 6 properties.
FORMULA ResAllocation-PT-R015C002-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 8 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 60 cols
[2021-05-17 15:53:35] [INFO ] Computed 30 place invariants in 5 ms
[2021-05-17 15:53:35] [INFO ] Implicit Places using invariants in 124 ms returned [37, 39, 41, 43, 59]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 151 ms to find 5 implicit places.
// Phase 1: matrix 32 rows 55 cols
[2021-05-17 15:53:35] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-17 15:53:35] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 55/60 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 55 cols
[2021-05-17 15:53:35] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 15:53:35] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 2 iterations. Remains : 55/60 places, 32/32 transitions.
[2021-05-17 15:53:35] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 15:53:35] [INFO ] Flatten gal took : 23 ms
FORMULA ResAllocation-PT-R015C002-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 15:53:35] [INFO ] Flatten gal took : 8 ms
[2021-05-17 15:53:35] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 100000 steps, including 1460 resets, run finished after 227 ms. (steps per millisecond=440 ) properties (out of 23) seen :20
Running SMT prover for 3 properties.
// Phase 1: matrix 32 rows 55 cols
[2021-05-17 15:53:35] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-17 15:53:35] [INFO ] [Real]Absence check using 25 positive place invariants in 3 ms returned unsat
[2021-05-17 15:53:35] [INFO ] [Real]Absence check using 25 positive place invariants in 3 ms returned unsat
[2021-05-17 15:53:35] [INFO ] [Real]Absence check using 25 positive place invariants in 2 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
[2021-05-17 15:53:35] [INFO ] Initial state test concluded for 1 properties.
FORMULA ResAllocation-PT-R015C002-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 52 transition count 30
Applied a total of 5 rules in 10 ms. Remains 52 /55 variables (removed 3) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 52 cols
[2021-05-17 15:53:35] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-17 15:53:36] [INFO ] Implicit Places using invariants in 41 ms returned [30, 32, 38, 40, 42, 44, 46, 48, 50]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 46 ms to find 9 implicit places.
[2021-05-17 15:53:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 43 cols
[2021-05-17 15:53:36] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 15:53:36] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 43/55 places, 30/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2021-05-17 15:53:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 30 rows 43 cols
[2021-05-17 15:53:36] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 15:53:36] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 43/55 places, 30/32 transitions.
Stuttering acceptance computed with spot in 357 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s27)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1458 reset in 272 ms.
Product exploration explored 100000 steps with 1457 reset in 210 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1462 reset in 122 ms.
Product exploration explored 100000 steps with 1454 reset in 281 ms.
[2021-05-17 15:53:37] [INFO ] Flatten gal took : 7 ms
[2021-05-17 15:53:37] [INFO ] Flatten gal took : 5 ms
[2021-05-17 15:53:37] [INFO ] Time to serialize gal into /tmp/LTL17173753867095704087.gal : 2 ms
[2021-05-17 15:53:37] [INFO ] Time to serialize properties into /tmp/LTL9021900197795117824.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17173753867095704087.gal, -t, CGAL, -LTL, /tmp/LTL9021900197795117824.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17173753867095704087.gal -t CGAL -LTL /tmp/LTL9021900197795117824.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(r_0_13<1)"))))
Formula 0 simplified : !FG"(r_0_13<1)"
Reverse transition relation is NOT exact ! Due to transitions t14.t15, t17.t16, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/28/2/30
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
17 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.19109,23968,1,0,706,42649,90,543,1311,74894,1182
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R015C002-00 finished in 1807 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0)&&(p1||G(p2))) U (!p1&&X(p3))))], workingDir=/home/mcc/execution]
Support contains 6 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 55 cols
[2021-05-17 15:53:37] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 15:53:37] [INFO ] Implicit Places using invariants in 70 ms returned [31, 33, 35, 41, 43, 45, 47, 53]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 72 ms to find 8 implicit places.
// Phase 1: matrix 32 rows 47 cols
[2021-05-17 15:53:37] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-17 15:53:37] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 47/55 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 47 cols
[2021-05-17 15:53:37] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-17 15:53:37] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 47/55 places, 32/32 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p3) p1), true, (NOT p0), (NOT p3), (NOT p3), (NOT p2)]
Running random walk in product with property : ResAllocation-PT-R015C002-02 automaton TGBA [mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p0 p2 (NOT p3)), acceptance={0} source=4 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s18 s0), p0:(LEQ s42 s11), p2:(LEQ s44 s27), p3:(AND (LEQ s18 s0) (LEQ s42 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 25 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R015C002-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-02 finished in 406 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 55 cols
[2021-05-17 15:53:38] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-17 15:53:38] [INFO ] Implicit Places using invariants in 47 ms returned [31, 35, 41, 43, 45, 47, 49, 51, 53]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 49 ms to find 9 implicit places.
// Phase 1: matrix 32 rows 46 cols
[2021-05-17 15:53:38] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 15:53:38] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 46/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 46 cols
[2021-05-17 15:53:38] [INFO ] Computed 16 place invariants in 4 ms
[2021-05-17 15:53:38] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 2 iterations. Remains : 46/55 places, 32/32 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s32 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-03 finished in 209 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 52 transition count 30
Applied a total of 5 rules in 5 ms. Remains 52 /55 variables (removed 3) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 52 cols
[2021-05-17 15:53:38] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-17 15:53:38] [INFO ] Implicit Places using invariants in 36 ms returned [30, 40, 42, 44, 46, 48]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 37 ms to find 6 implicit places.
[2021-05-17 15:53:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 46 cols
[2021-05-17 15:53:38] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 15:53:38] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 46/55 places, 30/32 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2021-05-17 15:53:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 46 cols
[2021-05-17 15:53:38] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 15:53:38] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 46/55 places, 30/32 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R015C002-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s44 s33), p1:(GT s31 s37)], 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 1303 steps with 210 reset in 9 ms.
FORMULA ResAllocation-PT-R015C002-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-10 finished in 221 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 55 cols
[2021-05-17 15:53:38] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-17 15:53:38] [INFO ] Implicit Places using invariants in 38 ms returned [31, 33, 35, 41, 43, 45, 47, 49, 51, 53]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 39 ms to find 10 implicit places.
// Phase 1: matrix 32 rows 45 cols
[2021-05-17 15:53:38] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 15:53:38] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Starting structural reductions, iteration 1 : 45/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 45 cols
[2021-05-17 15:53:38] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-17 15:53:38] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 45/55 places, 32/32 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ResAllocation-PT-R015C002-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s43 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), true]
Support contains 2 out of 45 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 45/45 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2021-05-17 15:53:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 45 cols
[2021-05-17 15:53:39] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 15:53:39] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 32/32 transitions.
Product exploration explored 100000 steps with 50000 reset in 301 ms.
Product exploration explored 100000 steps with 50000 reset in 302 ms.
[2021-05-17 15:53:40] [INFO ] Flatten gal took : 4 ms
[2021-05-17 15:53:40] [INFO ] Flatten gal took : 3 ms
[2021-05-17 15:53:40] [INFO ] Time to serialize gal into /tmp/LTL586040236684800983.gal : 1 ms
[2021-05-17 15:53:40] [INFO ] Time to serialize properties into /tmp/LTL6487596876420871230.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL586040236684800983.gal, -t, CGAL, -LTL, /tmp/LTL6487596876420871230.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL586040236684800983.gal -t CGAL -LTL /tmp/LTL6487596876420871230.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X("(p_1_13<=p_0_12)")))
Formula 0 simplified : !X"(p_1_13<=p_0_12)"
Reverse transition relation is NOT exact ! Due to transitions t15, t16, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/2/32
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.040371,17360,1,0,79,6253,84,37,1384,4082,75
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R015C002-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R015C002-11 finished in 1873 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G((p0||G(p1)))||X(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 55 cols
[2021-05-17 15:53:40] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 15:53:40] [INFO ] Implicit Places using invariants in 48 ms returned [31, 33, 35, 41, 43, 45, 49, 51, 53]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 49 ms to find 9 implicit places.
// Phase 1: matrix 32 rows 46 cols
[2021-05-17 15:53:40] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 15:53:40] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 46/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 46 cols
[2021-05-17 15:53:40] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 15:53:40] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 46/55 places, 32/32 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R015C002-12 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s20 s5), p1:(LEQ s33 s41), p2:(GT 1 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1456 reset in 135 ms.
Product exploration explored 100000 steps with 1462 reset in 133 ms.
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Product exploration explored 100000 steps with 1457 reset in 150 ms.
Product exploration explored 100000 steps with 1460 reset in 173 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 477 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 5 out of 46 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 46/46 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 32
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2021-05-17 15:53:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 46 cols
[2021-05-17 15:53:42] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 15:53:42] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 32/32 transitions.
Product exploration explored 100000 steps with 1455 reset in 294 ms.
Product exploration explored 100000 steps with 1460 reset in 230 ms.
[2021-05-17 15:53:42] [INFO ] Flatten gal took : 8 ms
[2021-05-17 15:53:42] [INFO ] Flatten gal took : 6 ms
[2021-05-17 15:53:42] [INFO ] Time to serialize gal into /tmp/LTL15666290908004371553.gal : 3 ms
[2021-05-17 15:53:42] [INFO ] Time to serialize properties into /tmp/LTL3112482938213887101.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15666290908004371553.gal, -t, CGAL, -LTL, /tmp/LTL3112482938213887101.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15666290908004371553.gal -t CGAL -LTL /tmp/LTL3112482938213887101.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((G(("(p_0_10<=r_0_2)")||(G("(p_1_3<=r_1_10)"))))||(X("(p_0_7<1)")))))
Formula 0 simplified : !G(G("(p_0_10<=r_0_2)" | G"(p_1_3<=r_1_10)") | X"(p_0_7<1)")
Reverse transition relation is NOT exact ! Due to transitions t15, t16, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/2/32
Computing Next relation with stutter on 14 deadlock states
6 unique states visited
6 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
85 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.864881,43896,1,0,852,141003,134,1089,1502,218440,1998
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R015C002-12 finished in 3546 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&(p1||X((p2 U p3))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 55 cols
[2021-05-17 15:53:44] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 15:53:44] [INFO ] Implicit Places using invariants in 44 ms returned [31, 33, 35, 41, 43, 45, 47, 49, 51, 53]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 47 ms to find 10 implicit places.
// Phase 1: matrix 32 rows 45 cols
[2021-05-17 15:53:44] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-17 15:53:44] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 45/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 45 cols
[2021-05-17 15:53:44] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-17 15:53:44] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 45/55 places, 32/32 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (NOT p3)]
Running random walk in product with property : ResAllocation-PT-R015C002-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s8 s31), p1:(GT s15 s34), p3:(AND (LEQ 1 s29) (GT s15 s34)), p2:(LEQ 1 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-14 finished in 187 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 52 transition count 30
Applied a total of 5 rules in 3 ms. Remains 52 /55 variables (removed 3) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 52 cols
[2021-05-17 15:53:44] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-17 15:53:44] [INFO ] Implicit Places using invariants in 41 ms returned [30, 32, 38, 40, 44, 46, 48, 50]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 41 ms to find 8 implicit places.
[2021-05-17 15:53:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 44 cols
[2021-05-17 15:53:44] [INFO ] Computed 16 place invariants in 5 ms
[2021-05-17 15:53:44] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 44/55 places, 30/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2021-05-17 15:53:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 44 cols
[2021-05-17 15:53:44] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-17 15:53:44] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 44/55 places, 30/32 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R015C002-15 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s7 s38), p1:(LEQ s10 s29)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1460 reset in 118 ms.
Product exploration explored 100000 steps with 1457 reset in 129 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1459 reset in 117 ms.
Product exploration explored 100000 steps with 1458 reset in 128 ms.
[2021-05-17 15:53:45] [INFO ] Flatten gal took : 18 ms
[2021-05-17 15:53:45] [INFO ] Flatten gal took : 3 ms
[2021-05-17 15:53:45] [INFO ] Time to serialize gal into /tmp/LTL13944873666170023634.gal : 2 ms
[2021-05-17 15:53:45] [INFO ] Time to serialize properties into /tmp/LTL4280087690329900450.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13944873666170023634.gal, -t, CGAL, -LTL, /tmp/LTL4280087690329900450.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13944873666170023634.gal -t CGAL -LTL /tmp/LTL4280087690329900450.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(r_0_3<=r_1_9)"))||(G("(p_0_5<=p_1_1)")))))
Formula 0 simplified : !F(G"(r_0_3<=r_1_9)" | G"(p_0_5<=p_1_1)")
Reverse transition relation is NOT exact ! Due to transitions t14.t15, t17.t16, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/28/2/30
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
168 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.68725,78648,1,0,2004,362693,103,2217,1353,596864,4373
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ResAllocation-PT-R015C002-15 finished in 2907 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621266827838

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R015C002"
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 ResAllocation-PT-R015C002, 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 r178-tajo-162089416400796"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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