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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 27K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 207K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 156K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 768K 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 5.7K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 27 06:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 27 06:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 28K Mar 25 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Mar 25 08:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 484K 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-PT-01-00
FORMULA_NAME PermAdmissibility-PT-01-01
FORMULA_NAME PermAdmissibility-PT-01-02
FORMULA_NAME PermAdmissibility-PT-01-03
FORMULA_NAME PermAdmissibility-PT-01-04
FORMULA_NAME PermAdmissibility-PT-01-05
FORMULA_NAME PermAdmissibility-PT-01-06
FORMULA_NAME PermAdmissibility-PT-01-07
FORMULA_NAME PermAdmissibility-PT-01-08
FORMULA_NAME PermAdmissibility-PT-01-09
FORMULA_NAME PermAdmissibility-PT-01-10
FORMULA_NAME PermAdmissibility-PT-01-11
FORMULA_NAME PermAdmissibility-PT-01-12
FORMULA_NAME PermAdmissibility-PT-01-13
FORMULA_NAME PermAdmissibility-PT-01-14
FORMULA_NAME PermAdmissibility-PT-01-15

=== Now, execution of the tool begins

BK_START 1620995693211

Running Version 0
[2021-05-14 12:35:06] [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 12:35:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 12:35:06] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2021-05-14 12:35:06] [INFO ] Transformed 168 places.
[2021-05-14 12:35:06] [INFO ] Transformed 592 transitions.
[2021-05-14 12:35:06] [INFO ] Parsed PT model containing 168 places and 592 transitions in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 12:35:06] [INFO ] Initial state test concluded for 4 properties.
FORMULA PermAdmissibility-PT-01-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 146 transition count 592
Applied a total of 22 rules in 33 ms. Remains 146 /168 variables (removed 22) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 146 cols
[2021-05-14 12:35:06] [INFO ] Computed 21 place invariants in 27 ms
[2021-05-14 12:35:06] [INFO ] Implicit Places using invariants in 225 ms returned []
// Phase 1: matrix 592 rows 146 cols
[2021-05-14 12:35:06] [INFO ] Computed 21 place invariants in 10 ms
[2021-05-14 12:35:07] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
// Phase 1: matrix 592 rows 146 cols
[2021-05-14 12:35:07] [INFO ] Computed 21 place invariants in 7 ms
[2021-05-14 12:35:07] [INFO ] Dead Transitions using invariants and state equation in 210 ms returned []
Finished structural reductions, in 1 iterations. Remains : 146/168 places, 592/592 transitions.
[2021-05-14 12:35:07] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-14 12:35:07] [INFO ] Flatten gal took : 92 ms
FORMULA PermAdmissibility-PT-01-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 12:35:07] [INFO ] Flatten gal took : 63 ms
[2021-05-14 12:35:07] [INFO ] Input system was already deterministic with 592 transitions.
Incomplete random walk after 100000 steps, including 5882 resets, run finished after 612 ms. (steps per millisecond=163 ) properties (out of 19) seen :12
Running SMT prover for 7 properties.
// Phase 1: matrix 592 rows 146 cols
[2021-05-14 12:35:08] [INFO ] Computed 21 place invariants in 6 ms
[2021-05-14 12:35:08] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 6 ms returned unsat
[2021-05-14 12:35:08] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 4 ms returned unsat
[2021-05-14 12:35:08] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 7 ms returned unsat
[2021-05-14 12:35:08] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 6 ms returned sat
[2021-05-14 12:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 12:35:08] [INFO ] [Real]Absence check using state equation in 95 ms returned unsat
[2021-05-14 12:35:08] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 5 ms returned unsat
[2021-05-14 12:35:08] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 4 ms returned unsat
[2021-05-14 12:35:08] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 5 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 11 simplifications.
[2021-05-14 12:35:08] [INFO ] Initial state test concluded for 3 properties.
FORMULA PermAdmissibility-PT-01-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p1)||G(p2)||p0)))], workingDir=/home/mcc/execution]
Support contains 17 out of 146 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 146/146 places, 592/592 transitions.
Graph (complete) has 1395 edges and 146 vertex of which 112 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.5 ms
Discarding 34 places :
Also discarding 0 output transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 93 transition count 372
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 93 transition count 372
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 49 place count 83 transition count 262
Iterating global reduction 0 with 10 rules applied. Total rules applied 59 place count 83 transition count 262
Applied a total of 59 rules in 42 ms. Remains 83 /146 variables (removed 63) and now considering 262/592 (removed 330) transitions.
// Phase 1: matrix 262 rows 83 cols
[2021-05-14 12:35:08] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 12:35:08] [INFO ] Implicit Places using invariants in 67 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
[2021-05-14 12:35:08] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 262 rows 82 cols
[2021-05-14 12:35:08] [INFO ] Computed 16 place invariants in 9 ms
[2021-05-14 12:35:09] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Starting structural reductions, iteration 1 : 82/146 places, 262/592 transitions.
Applied a total of 0 rules in 8 ms. Remains 82 /82 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2021-05-14 12:35:09] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 262 rows 82 cols
[2021-05-14 12:35:09] [INFO ] Computed 16 place invariants in 5 ms
[2021-05-14 12:35:09] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Finished structural reductions, in 2 iterations. Remains : 82/146 places, 262/592 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), true, (NOT p2), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-01-01 automaton TGBA [mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ 1 (ADD s4 s5 s6 s7 s8 s9 s10 s12)), p2:(LEQ 1 s78), p0:(OR (LEQ (ADD s15 s17 s18 s19 s20 s21 s22 s23) (ADD s4 s5 s6 s7 s8 s9 s10 s12)) (LEQ 1 (ADD s4 s5 s6 s7 s8 s9 s10 s12)))], 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, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-PT-01-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-01 finished in 603 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 22 out of 146 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 146/146 places, 592/592 transitions.
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 112 transition count 592
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 53 place count 93 transition count 372
Iterating global reduction 1 with 19 rules applied. Total rules applied 72 place count 93 transition count 372
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 83 transition count 262
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 83 transition count 262
Applied a total of 92 rules in 10 ms. Remains 83 /146 variables (removed 63) and now considering 262/592 (removed 330) transitions.
// Phase 1: matrix 262 rows 83 cols
[2021-05-14 12:35:09] [INFO ] Computed 17 place invariants in 7 ms
[2021-05-14 12:35:09] [INFO ] Implicit Places using invariants in 63 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
// Phase 1: matrix 262 rows 82 cols
[2021-05-14 12:35:09] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 12:35:09] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Starting structural reductions, iteration 1 : 82/146 places, 262/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 82 cols
[2021-05-14 12:35:09] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 12:35:09] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Finished structural reductions, in 2 iterations. Remains : 82/146 places, 262/592 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT (ADD s64 s65) (ADD s11 s12 s13 s14 s15 s16 s17 s18)) (LEQ (ADD s47 s49 s50 s51 s52 s66 s67 s68) (ADD s24 s29 s31 s32)))], 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 50000 reset in 252 ms.
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 82 transition count 262
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)))), p0]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Product exploration explored 100000 steps with 50000 reset in 249 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Support contains 22 out of 82 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 82/82 places, 262/262 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2021-05-14 12:35:21] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 262 rows 82 cols
[2021-05-14 12:35:21] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 12:35:21] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 262/262 transitions.
Product exploration explored 100000 steps with 50000 reset in 500 ms.
Product exploration explored 100000 steps with 50000 reset in 462 ms.
[2021-05-14 12:35:22] [INFO ] Flatten gal took : 19 ms
[2021-05-14 12:35:22] [INFO ] Flatten gal took : 18 ms
[2021-05-14 12:35:22] [INFO ] Time to serialize gal into /tmp/LTL1191848647285579666.gal : 9 ms
[2021-05-14 12:35:22] [INFO ] Time to serialize properties into /tmp/LTL17177486569315638084.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/LTL1191848647285579666.gal, -t, CGAL, -LTL, /tmp/LTL17177486569315638084.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/LTL1191848647285579666.gal -t CGAL -LTL /tmp/LTL17177486569315638084.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(((in2_2+in2_3)>(((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6))||((((((((aux10_0+aux10_2)+aux10_1)+aux10_4)+aux10_3)+aux10_5)+aux10_6)+aux10_7)<=(((aux6_0+aux6_5)+aux6_1)+aux6_4)))"))))
Formula 0 simplified : !XF"(((in2_2+in2_3)>(((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6))||((((((((aux10_0+aux10_2)+aux10_1)+aux10_4)+aux10_3)+aux10_5)+aux10_6)+aux10_7)<=(((aux6_0+aux6_5)+aux6_1)+aux6_4)))"
Reverse transition relation is NOT exact ! Due to transitions t81, t136, t137, t138, t139, t140, t141, t142, t189, t243, t248, t249, t250, t251, t252, t277, t278, t279, t280, t282, t298, t299, t300, t301, t302, t303, t304, t305, t306, t307, t308, t310, t329, t330, t332, t333, t334, t335, t336, t337, t338, t339, t340, t345, t359, t367, t372, t377, t379, t397, t405, t407, t427, t432, t433, t434, t435, t436, t437, t439, t465, t469, t470, t471, t472, t473, t474, t475, t477, t478, t479, t480, t481, t482, t483, t484, t491, t492, t493, t494, t495, t496, t497, t498, t499, t502, t503, t504, t505, t506, t507, t508, t509, t511, t512, t513, t514, t515, t516, t517, t518, t519, t521, t522, t523, t524, t525, t526, t528, t529, t530, t531, t532, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :20/129/113/262
Computing Next relation with stutter on 8 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
105 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.08591,52956,1,0,548,148630,530,241,7386,78568,517
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PermAdmissibility-PT-01-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property PermAdmissibility-PT-01-03 finished in 14627 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&(p0 U G(p1)))))], workingDir=/home/mcc/execution]
Support contains 24 out of 146 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 146/146 places, 592/592 transitions.
Graph (complete) has 1395 edges and 146 vertex of which 120 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 0 output transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 101 transition count 372
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 101 transition count 372
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 49 place count 91 transition count 262
Iterating global reduction 0 with 10 rules applied. Total rules applied 59 place count 91 transition count 262
Applied a total of 59 rules in 17 ms. Remains 91 /146 variables (removed 55) and now considering 262/592 (removed 330) transitions.
// Phase 1: matrix 262 rows 91 cols
[2021-05-14 12:35:24] [INFO ] Computed 18 place invariants in 6 ms
[2021-05-14 12:35:24] [INFO ] Implicit Places using invariants in 67 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
[2021-05-14 12:35:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 262 rows 90 cols
[2021-05-14 12:35:24] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 12:35:24] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Starting structural reductions, iteration 1 : 90/146 places, 262/592 transitions.
Applied a total of 0 rules in 8 ms. Remains 90 /90 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2021-05-14 12:35:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 262 rows 90 cols
[2021-05-14 12:35:24] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 12:35:24] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 2 iterations. Remains : 90/146 places, 262/592 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-01-05 automaton TGBA [mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s41 s42 s43 s44 s45 s46 s47 s52) (ADD s19 s20 s22 s23 s24 s25 s26 s27)), p1:(LEQ 1 (ADD s11 s12 s13 s14 s15 s16 s17 s18))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-01-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-05 finished in 438 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 146/146 places, 592/592 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 68 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 94 place count 78 transition count 344
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 117 place count 55 transition count 114
Iterating global reduction 1 with 23 rules applied. Total rules applied 140 place count 55 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 53 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 53 transition count 98
Applied a total of 144 rules in 6 ms. Remains 53 /146 variables (removed 93) and now considering 98/592 (removed 494) transitions.
// Phase 1: matrix 98 rows 53 cols
[2021-05-14 12:35:24] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 12:35:24] [INFO ] Implicit Places using invariants in 41 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 42 ms to find 4 implicit places.
// Phase 1: matrix 98 rows 49 cols
[2021-05-14 12:35:24] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-14 12:35:24] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 49/146 places, 98/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 49 /49 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 49 cols
[2021-05-14 12:35:24] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-14 12:35:24] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 2 iterations. Remains : 49/146 places, 98/592 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ s36 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 124 ms.
Product exploration explored 100000 steps with 25000 reset in 132 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 98
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)))), p0]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 120 ms.
Product exploration explored 100000 steps with 25000 reset in 132 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 49 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 49/49 places, 98/98 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 49 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 49 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 48 transition count 97
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 48 transition count 97
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 4 rules in 7 ms. Remains 48 /49 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2021-05-14 12:35:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 97 rows 48 cols
[2021-05-14 12:35:25] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 12:35:25] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 48/49 places, 97/98 transitions.
Product exploration explored 100000 steps with 25000 reset in 244 ms.
Product exploration explored 100000 steps with 25000 reset in 245 ms.
[2021-05-14 12:35:26] [INFO ] Flatten gal took : 7 ms
[2021-05-14 12:35:26] [INFO ] Flatten gal took : 7 ms
[2021-05-14 12:35:26] [INFO ] Time to serialize gal into /tmp/LTL3511996801541651324.gal : 1 ms
[2021-05-14 12:35:26] [INFO ] Time to serialize properties into /tmp/LTL17628882078827090999.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/LTL3511996801541651324.gal, -t, CGAL, -LTL, /tmp/LTL17628882078827090999.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/LTL3511996801541651324.gal -t CGAL -LTL /tmp/LTL17628882078827090999.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(c9<=aux9_4)"))))))
Formula 0 simplified : !XXXF"(c9<=aux9_4)"
Reverse transition relation is NOT exact ! Due to transitions t0, t65, t245, t246, t247, t250, t251, t252, t253, t254, t255, t260, t263, t265, t266, t267, t268, t277, t281, t283, t284, t285, t287, t288, t289, t291, t292, t294, t295, t296, t298, t299, t306, t307, t308, t310, t333, t334, t336, t337, t338, t340, t345, t353, t359, t372, t379, t397, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :2/48/48/98
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
20 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.218889,25540,1,0,214,26969,220,97,2874,17152,213
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PermAdmissibility-PT-01-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property PermAdmissibility-PT-01-10 finished in 1893 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 146/146 places, 592/592 transitions.
Graph (complete) has 1395 edges and 146 vertex of which 105 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Discarding 41 places :
Also discarding 0 output transitions
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 80 transition count 348
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 80 transition count 348
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 73 place count 58 transition count 118
Iterating global reduction 0 with 22 rules applied. Total rules applied 95 place count 58 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 98 place count 55 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 101 place count 55 transition count 94
Applied a total of 101 rules in 14 ms. Remains 55 /146 variables (removed 91) and now considering 94/592 (removed 498) transitions.
// Phase 1: matrix 94 rows 55 cols
[2021-05-14 12:35:26] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-14 12:35:26] [INFO ] Implicit Places using invariants in 43 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
[2021-05-14 12:35:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 94 rows 54 cols
[2021-05-14 12:35:26] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-14 12:35:26] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Starting structural reductions, iteration 1 : 54/146 places, 94/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2021-05-14 12:35:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 94 rows 54 cols
[2021-05-14 12:35:26] [INFO ] Computed 15 place invariants in 6 ms
[2021-05-14 12:35:26] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/146 places, 94/592 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, (G p0 | G!p0)], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 11612 ms :[false, (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-13 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:(GT s10 s37)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-01-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-13 finished in 11778 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 146/146 places, 592/592 transitions.
Graph (complete) has 1395 edges and 146 vertex of which 104 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.2 ms
Discarding 42 places :
Also discarding 0 output transitions
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 27 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 53 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 77 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 101 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 104 place count 51 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 107 place count 51 transition count 84
Applied a total of 107 rules in 12 ms. Remains 51 /146 variables (removed 95) and now considering 84/592 (removed 508) transitions.
// Phase 1: matrix 84 rows 51 cols
[2021-05-14 12:35:38] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 12:35:38] [INFO ] Implicit Places using invariants in 35 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 ms to find 4 implicit places.
[2021-05-14 12:35:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 84 rows 47 cols
[2021-05-14 12:35:38] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-14 12:35:38] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Starting structural reductions, iteration 1 : 47/146 places, 84/592 transitions.
Applied a total of 0 rules in 5 ms. Remains 47 /47 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2021-05-14 12:35:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 84 rows 47 cols
[2021-05-14 12:35:38] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 12:35:38] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 47/146 places, 84/592 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-14 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 s10 s36)], 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 7711 reset in 221 ms.
Product exploration explored 100000 steps with 7708 reset in 176 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 84
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)))), p0]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7695 reset in 147 ms.
Product exploration explored 100000 steps with 7713 reset in 133 ms.
[2021-05-14 12:35:39] [INFO ] Flatten gal took : 6 ms
[2021-05-14 12:35:39] [INFO ] Flatten gal took : 5 ms
[2021-05-14 12:35:39] [INFO ] Time to serialize gal into /tmp/LTL12431677131118871928.gal : 1 ms
[2021-05-14 12:35:39] [INFO ] Time to serialize properties into /tmp/LTL1246300402300378914.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/LTL12431677131118871928.gal, -t, CGAL, -LTL, /tmp/LTL1246300402300378914.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/LTL12431677131118871928.gal -t CGAL -LTL /tmp/LTL1246300402300378914.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(c12<=c16)"))))
Formula 0 simplified : !GF"(c12<=c16)"
Reverse transition relation is NOT exact ! Due to transitions t0, t65, t245, t246, t247, t250, t251, t252, t253, t254, t255, t260, t263, t265, t266, t267, t268, t281, t283, t285, t287, t289, t291, t294, t296, t308, t310, t334, t336, t338, t340, t345, t359, t372, t379, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :2/47/35/84
Computing Next relation with stutter on 1 deadlock states
18 unique states visited
0 strongly connected components in search stack
25 transitions explored
17 items max in DFS search stack
11 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.132285,21572,1,0,178,18217,196,109,2657,13721,316
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PermAdmissibility-PT-01-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property PermAdmissibility-PT-01-14 finished in 1171 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 146/146 places, 592/592 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 68 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 94 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 118 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 142 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 145 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 148 place count 51 transition count 84
Applied a total of 148 rules in 6 ms. Remains 51 /146 variables (removed 95) and now considering 84/592 (removed 508) transitions.
// Phase 1: matrix 84 rows 51 cols
[2021-05-14 12:35:39] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-14 12:35:39] [INFO ] Implicit Places using invariants in 42 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 42 ms to find 4 implicit places.
// Phase 1: matrix 84 rows 47 cols
[2021-05-14 12:35:39] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-14 12:35:39] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 47/146 places, 84/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 47 cols
[2021-05-14 12:35:39] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 12:35:39] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 47/146 places, 84/592 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PermAdmissibility-PT-01-15 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 1 s36)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-01-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-15 finished in 177 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620995741250

--------------------
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-PT-01"
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-PT-01, 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-162089128000508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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