Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127900468.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 PermAdmissibility-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127900468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 112K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 06:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 08:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 54K 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 PermAdmissibility-COL-02-00
FORMULA_NAME PermAdmissibility-COL-02-01
FORMULA_NAME PermAdmissibility-COL-02-02
FORMULA_NAME PermAdmissibility-COL-02-03
FORMULA_NAME PermAdmissibility-COL-02-04
FORMULA_NAME PermAdmissibility-COL-02-05
FORMULA_NAME PermAdmissibility-COL-02-06
FORMULA_NAME PermAdmissibility-COL-02-07
FORMULA_NAME PermAdmissibility-COL-02-08
FORMULA_NAME PermAdmissibility-COL-02-09
FORMULA_NAME PermAdmissibility-COL-02-10
FORMULA_NAME PermAdmissibility-COL-02-11
FORMULA_NAME PermAdmissibility-COL-02-12
FORMULA_NAME PermAdmissibility-COL-02-13
FORMULA_NAME PermAdmissibility-COL-02-14
FORMULA_NAME PermAdmissibility-COL-02-15

=== Now, execution of the tool begins

BK_START 1620985472055

Running Version 0
[2021-05-14 09:44:33] [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-14 09:44:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 09:44:33] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-14 09:44:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 09:44:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 558 ms
[2021-05-14 09:44:34] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
FORMULA PermAdmissibility-COL-02-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 09:44:34] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions in 4 ms.
[2021-05-14 09:44:34] [INFO ] Skeletonized HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1000_15805387389873026465.dot
[2021-05-14 09:44:34] [INFO ] Initial state test concluded for 6 properties.
FORMULA PermAdmissibility-COL-02-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100000 steps, including 2083 resets, run finished after 221 ms. (steps per millisecond=452 ) properties (out of 13) seen :12
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 40 cols
[2021-05-14 09:44:34] [INFO ] Computed 24 place invariants in 5 ms
[2021-05-14 09:44:34] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
[2021-05-14 09:44:34] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-14 09:44:34] [INFO ] Flatten gal took : 22 ms
FORMULA PermAdmissibility-COL-02-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 09:44:34] [INFO ] Flatten gal took : 5 ms
[2021-05-14 09:44:34] [INFO ] Unfolded HLPN to a Petri net with 208 places and 1024 transitions in 10 ms.
[2021-05-14 09:44:34] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_8514988533056526640.dot
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 432 transitions.
Support contains 53 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 144 transition count 592
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 137 transition count 480
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 137 transition count 480
Applied a total of 38 rules in 40 ms. Remains 137 /168 variables (removed 31) and now considering 480/592 (removed 112) transitions.
// Phase 1: matrix 480 rows 137 cols
[2021-05-14 09:44:34] [INFO ] Computed 21 place invariants in 20 ms
[2021-05-14 09:44:34] [INFO ] Implicit Places using invariants in 172 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
// Phase 1: matrix 480 rows 136 cols
[2021-05-14 09:44:34] [INFO ] Computed 20 place invariants in 10 ms
[2021-05-14 09:44:35] [INFO ] Dead Transitions using invariants and state equation in 234 ms returned []
Starting structural reductions, iteration 1 : 136/168 places, 480/592 transitions.
Applied a total of 0 rules in 9 ms. Remains 136 /136 variables (removed 0) and now considering 480/480 (removed 0) transitions.
// Phase 1: matrix 480 rows 136 cols
[2021-05-14 09:44:35] [INFO ] Computed 20 place invariants in 7 ms
[2021-05-14 09:44:35] [INFO ] Dead Transitions using invariants and state equation in 181 ms returned []
Finished structural reductions, in 2 iterations. Remains : 136/168 places, 480/592 transitions.
[2021-05-14 09:44:35] [INFO ] Flatten gal took : 73 ms
[2021-05-14 09:44:35] [INFO ] Flatten gal took : 52 ms
[2021-05-14 09:44:35] [INFO ] Input system was already deterministic with 480 transitions.
Finished random walk after 48 steps, including 0 resets, run visited all 6 properties in 1 ms. (steps per millisecond=48 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 12 out of 136 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 136/136 places, 480/480 transitions.
Graph (complete) has 1159 edges and 136 vertex of which 104 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.5 ms
Discarding 32 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 90 transition count 354
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 90 transition count 354
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 43 place count 76 transition count 228
Iterating global reduction 0 with 14 rules applied. Total rules applied 57 place count 76 transition count 228
Applied a total of 57 rules in 31 ms. Remains 76 /136 variables (removed 60) and now considering 228/480 (removed 252) transitions.
// Phase 1: matrix 228 rows 76 cols
[2021-05-14 09:44:35] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-14 09:44:35] [INFO ] Implicit Places using invariants in 72 ms returned [12, 13, 63, 72]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 82 ms to find 4 implicit places.
[2021-05-14 09:44:35] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 09:44:35] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-14 09:44:35] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Starting structural reductions, iteration 1 : 72/136 places, 228/480 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 70 transition count 226
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 70 transition count 224
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 68 transition count 224
Applied a total of 8 rules in 28 ms. Remains 68 /72 variables (removed 4) and now considering 224/228 (removed 4) transitions.
// Phase 1: matrix 224 rows 68 cols
[2021-05-14 09:44:35] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 09:44:35] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 224 rows 68 cols
[2021-05-14 09:44:35] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 09:44:36] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 68/136 places, 224/480 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ (ADD s34 s35 s36 s37) (ADD s0 s1 s2 s3 s4 s5 s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-02-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-05 finished in 623 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0)) U (p1&&X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 35 out of 136 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 136/136 places, 480/480 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 120 transition count 480
Applied a total of 16 rules in 4 ms. Remains 120 /136 variables (removed 16) and now considering 480/480 (removed 0) transitions.
// Phase 1: matrix 480 rows 120 cols
[2021-05-14 09:44:36] [INFO ] Computed 18 place invariants in 4 ms
[2021-05-14 09:44:36] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 480 rows 120 cols
[2021-05-14 09:44:36] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-14 09:44:36] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
// Phase 1: matrix 480 rows 120 cols
[2021-05-14 09:44:36] [INFO ] Computed 18 place invariants in 4 ms
[2021-05-14 09:44:36] [INFO ] Dead Transitions using invariants and state equation in 174 ms returned []
Finished structural reductions, in 1 iterations. Remains : 120/136 places, 480/480 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-02-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={0} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(OR p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s72 s73) (ADD s8 s9 s10 s11 s12 s13 s14 s15)), p0:(OR (LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7) (ADD s55 s56 s57 s58)) (LEQ 1 (ADD s68 s69 s70 s71))), p2:(GT (ADD s16 s17 s18 s19 s20 s21 s22 s23) s92)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-02-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-11 finished in 882 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 8 out of 136 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 136/136 places, 480/480 transitions.
Graph (complete) has 1159 edges and 136 vertex of which 104 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 90 transition count 354
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 90 transition count 354
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 43 place count 76 transition count 228
Iterating global reduction 0 with 14 rules applied. Total rules applied 57 place count 76 transition count 228
Applied a total of 57 rules in 22 ms. Remains 76 /136 variables (removed 60) and now considering 228/480 (removed 252) transitions.
// Phase 1: matrix 228 rows 76 cols
[2021-05-14 09:44:37] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 09:44:37] [INFO ] Implicit Places using invariants in 61 ms returned [12, 21, 52, 64]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 62 ms to find 4 implicit places.
[2021-05-14 09:44:37] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 09:44:37] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 09:44:37] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Starting structural reductions, iteration 1 : 72/136 places, 228/480 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 72 transition count 225
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 69 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 69 transition count 224
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 68 transition count 224
Applied a total of 8 rules in 14 ms. Remains 68 /72 variables (removed 4) and now considering 224/228 (removed 4) transitions.
// Phase 1: matrix 224 rows 68 cols
[2021-05-14 09:44:37] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 09:44:37] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 224 rows 68 cols
[2021-05-14 09:44:37] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 09:44:37] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 68/136 places, 224/480 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5960 reset in 399 ms.
Product exploration explored 100000 steps with 5960 reset in 370 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 68 transition count 224
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), (NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5960 reset in 332 ms.
Product exploration explored 100000 steps with 5943 reset in 320 ms.
[2021-05-14 09:44:39] [INFO ] Flatten gal took : 22 ms
[2021-05-14 09:44:39] [INFO ] Flatten gal took : 17 ms
[2021-05-14 09:44:39] [INFO ] Time to serialize gal into /tmp/LTL4573444608693162444.gal : 3 ms
[2021-05-14 09:44:39] [INFO ] Time to serialize properties into /tmp/LTL16520996892794847438.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/LTL4573444608693162444.gal, -t, CGAL, -LTL, /tmp/LTL16520996892794847438.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/LTL4573444608693162444.gal -t CGAL -LTL /tmp/LTL16520996892794847438.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((out6_0+out6_1)+out6_2)+out6_3)+out6_4)+out6_5)+out6_6)+out6_7)>=1)"))))
Formula 0 simplified : !GF"((((((((out6_0+out6_1)+out6_2)+out6_3)+out6_4)+out6_5)+out6_6)+out6_7)>=1)"
Detected timeout of ITS tools.
[2021-05-14 09:44:54] [INFO ] Flatten gal took : 18 ms
[2021-05-14 09:44:54] [INFO ] Applying decomposition
[2021-05-14 09:44:54] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6971192725327561048.txt, -o, /tmp/graph6971192725327561048.bin, -w, /tmp/graph6971192725327561048.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6971192725327561048.bin, -l, -1, -v, -w, /tmp/graph6971192725327561048.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 09:44:54] [INFO ] Decomposing Gal with order
[2021-05-14 09:44:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 09:44:54] [INFO ] Removed a total of 20 redundant transitions.
[2021-05-14 09:44:54] [INFO ] Flatten gal took : 37 ms
[2021-05-14 09:44:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 3 ms.
[2021-05-14 09:44:54] [INFO ] Time to serialize gal into /tmp/LTL9717665292814820632.gal : 2 ms
[2021-05-14 09:44:54] [INFO ] Time to serialize properties into /tmp/LTL15916393641996603796.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/LTL9717665292814820632.gal, -t, CGAL, -LTL, /tmp/LTL15916393641996603796.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/LTL9717665292814820632.gal -t CGAL -LTL /tmp/LTL15916393641996603796.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((gu0.out6_0+gu0.out6_1)+gu0.out6_2)+gu0.out6_3)+gu0.out6_4)+gu0.out6_5)+gu0.out6_6)+gu0.out6_7)>=1)"))))
Formula 0 simplified : !GF"((((((((gu0.out6_0+gu0.out6_1)+gu0.out6_2)+gu0.out6_3)+gu0.out6_4)+gu0.out6_5)+gu0.out6_6)+gu0.out6_7)>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3914402798192990906
[2021-05-14 09:45:09] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3914402798192990906
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3914402798192990906]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3914402798192990906] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3914402798192990906] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property PermAdmissibility-COL-02-12 finished in 33385 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 136/136 places, 480/480 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 96 transition count 480
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 61 place count 75 transition count 340
Iterating global reduction 1 with 21 rules applied. Total rules applied 82 place count 75 transition count 340
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 110 place count 47 transition count 88
Iterating global reduction 1 with 28 rules applied. Total rules applied 138 place count 47 transition count 88
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 150 place count 35 transition count 28
Iterating global reduction 1 with 12 rules applied. Total rules applied 162 place count 35 transition count 28
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 166 place count 31 transition count 16
Ensure Unique test removed 2 places
Iterating global reduction 1 with 6 rules applied. Total rules applied 172 place count 29 transition count 16
Applied a total of 172 rules in 7 ms. Remains 29 /136 variables (removed 107) and now considering 16/480 (removed 464) transitions.
// Phase 1: matrix 16 rows 29 cols
[2021-05-14 09:45:10] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-14 09:45:10] [INFO ] Implicit Places using invariants in 47 ms returned [4, 5, 6, 10, 12, 13, 14, 17, 18, 19, 23, 24, 25]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 47 ms to find 13 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-14 09:45:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 09:45:10] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 16/136 places, 16/480 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-14 09:45:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 09:45:10] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 2 iterations. Remains : 16/136 places, 16/480 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s5 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10762 reset in 73 ms.
Product exploration explored 100000 steps with 10747 reset in 63 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10721 reset in 59 ms.
Product exploration explored 100000 steps with 10708 reset in 71 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 16 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 16 transition count 16
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 16 transition count 16
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 19 place count 8 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 27 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 8 transition count 8
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 6 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 6 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 32 rules in 3 ms. Remains 6 /16 variables (removed 10) and now considering 6/16 (removed 10) transitions.
[2021-05-14 09:45:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-14 09:45:11] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-14 09:45:11] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/16 places, 6/16 transitions.
Product exploration explored 100000 steps with 17007 reset in 160 ms.
Product exploration explored 100000 steps with 17045 reset in 132 ms.
[2021-05-14 09:45:11] [INFO ] Flatten gal took : 1 ms
[2021-05-14 09:45:11] [INFO ] Flatten gal took : 1 ms
[2021-05-14 09:45:11] [INFO ] Time to serialize gal into /tmp/LTL5446856828456186652.gal : 0 ms
[2021-05-14 09:45:11] [INFO ] Time to serialize properties into /tmp/LTL4440644039367814732.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/LTL5446856828456186652.gal, -t, CGAL, -LTL, /tmp/LTL4440644039367814732.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/LTL5446856828456186652.gal -t CGAL -LTL /tmp/LTL4440644039367814732.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(c110_0>c6_0)"))))
Formula 0 simplified : !XF"(c110_0>c6_0)"
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/15/1/16
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 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.019933,16584,1,0,123,2620,56,81,412,3313,241
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PermAdmissibility-COL-02-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property PermAdmissibility-COL-02-13 finished in 1019 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6166020752708342619
[2021-05-14 09:45:11] [INFO ] Computing symmetric may disable matrix : 480 transitions.
[2021-05-14 09:45:11] [INFO ] Applying decomposition
[2021-05-14 09:45:11] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 09:45:11] [INFO ] Computing symmetric may enable matrix : 480 transitions.
[2021-05-14 09:45:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 09:45:11] [INFO ] Flatten gal took : 39 ms
[2021-05-14 09:45:11] [INFO ] Computing Do-Not-Accords matrix : 480 transitions.
[2021-05-14 09:45:11] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13397735690491281454.txt, -o, /tmp/graph13397735690491281454.bin, -w, /tmp/graph13397735690491281454.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13397735690491281454.bin, -l, -1, -v, -w, /tmp/graph13397735690491281454.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 09:45:11] [INFO ] Decomposing Gal with order
[2021-05-14 09:45:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 09:45:11] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6166020752708342619
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6166020752708342619]
[2021-05-14 09:45:11] [INFO ] Removed a total of 447 redundant transitions.
[2021-05-14 09:45:11] [INFO ] Flatten gal took : 101 ms
[2021-05-14 09:45:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 8 ms.
[2021-05-14 09:45:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality6488342499857336439.gal : 8 ms
[2021-05-14 09:45:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality8443071907522010407.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/LTLCardinality6488342499857336439.gal, -t, CGAL, -LTL, /tmp/LTLCardinality8443071907522010407.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/LTLCardinality6488342499857336439.gal -t CGAL -LTL /tmp/LTLCardinality8443071907522010407.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((gu0.out6_0+gu0.out6_1)+gu0.out6_2)+gu0.out6_3)+gu0.out6_4)+gu0.out6_5)+gu0.out6_6)+gu0.out6_7)>=1)"))))
Formula 0 simplified : !GF"((((((((gu0.out6_0+gu0.out6_1)+gu0.out6_2)+gu0.out6_3)+gu0.out6_4)+gu0.out6_5)+gu0.out6_6)+gu0.out6_7)>=1)"
Compilation finished in 2979 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6166020752708342619]
Link finished in 46 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin6166020752708342619]
WARNING : LTSmin timed out (>900 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin6166020752708342619]
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin6166020752708342619]
Detected timeout of ITS tools.
[2021-05-14 10:05:24] [INFO ] Applying decomposition
[2021-05-14 10:05:24] [INFO ] Flatten gal took : 79 ms
[2021-05-14 10:05:24] [INFO ] Decomposing Gal with order
[2021-05-14 10:05:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 10:05:24] [INFO ] Removed a total of 1553 redundant transitions.
[2021-05-14 10:05:24] [INFO ] Flatten gal took : 202 ms
[2021-05-14 10:05:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2021-05-14 10:05:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality7003956710868426615.gal : 32 ms
[2021-05-14 10:05:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality56848632410111105.ltl : 2447 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/LTLCardinality7003956710868426615.gal, -t, CGAL, -LTL, /tmp/LTLCardinality56848632410111105.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/LTLCardinality7003956710868426615.gal -t CGAL -LTL /tmp/LTLCardinality56848632410111105.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((ginput0.out6_0+ginput1.out6_1)+ginput2.out6_2)+ginput3.out6_3)+ginput4.out6_4)+ginput5.out6_5)+ginput6.out6_6)+ginput7.out6_7)>=1)"))))
Formula 0 simplified : !GF"((((((((ginput0.out6_0+ginput1.out6_1)+ginput2.out6_2)+ginput3.out6_3)+ginput4.out6_4)+ginput5.out6_5)+ginput6.out6_6)+ginput7.out6_7)>=1)"
Detected timeout of ITS tools.
[2021-05-14 10:25:40] [INFO ] Flatten gal took : 86 ms
[2021-05-14 10:25:40] [INFO ] Input system was already deterministic with 480 transitions.
[2021-05-14 10:25:40] [INFO ] Transformed 136 places.
[2021-05-14 10:25:40] [INFO ] Transformed 480 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-14 10:26:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality15285594352812404986.gal : 11 ms
[2021-05-14 10:26:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality17595274156805715400.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/LTLCardinality15285594352812404986.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17595274156805715400.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality15285594352812404986.gal -t CGAL -LTL /tmp/LTLCardinality17595274156805715400.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((((((((out6_0+out6_1)+out6_2)+out6_3)+out6_4)+out6_5)+out6_6)+out6_7)>=1)"))))
Formula 0 simplified : !GF"((((((((out6_0+out6_1)+out6_2)+out6_3)+out6_4)+out6_5)+out6_6)+out6_7)>=1)"

BK_TIME_CONFINEMENT_REACHED

--------------------
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="PermAdmissibility-COL-02"
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 PermAdmissibility-COL-02, 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 r140-tall-162089127900468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-02.tgz
mv PermAdmissibility-COL-02 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 ;