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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K 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.2K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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-01-00
FORMULA_NAME PermAdmissibility-COL-01-01
FORMULA_NAME PermAdmissibility-COL-01-02
FORMULA_NAME PermAdmissibility-COL-01-03
FORMULA_NAME PermAdmissibility-COL-01-04
FORMULA_NAME PermAdmissibility-COL-01-05
FORMULA_NAME PermAdmissibility-COL-01-06
FORMULA_NAME PermAdmissibility-COL-01-07
FORMULA_NAME PermAdmissibility-COL-01-08
FORMULA_NAME PermAdmissibility-COL-01-09
FORMULA_NAME PermAdmissibility-COL-01-10
FORMULA_NAME PermAdmissibility-COL-01-11
FORMULA_NAME PermAdmissibility-COL-01-12
FORMULA_NAME PermAdmissibility-COL-01-13
FORMULA_NAME PermAdmissibility-COL-01-14
FORMULA_NAME PermAdmissibility-COL-01-15

=== Now, execution of the tool begins

BK_START 1620985009964

Running Version 0
[2021-05-14 09:36:51] [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:36:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 09:36:51] [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:36:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 09:36:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 604 ms
[2021-05-14 09:36:52] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
FORMULA PermAdmissibility-COL-01-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 09:36:52] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions in 3 ms.
[2021-05-14 09:36:52] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_17977276238026237553.dot
[2021-05-14 09:36:52] [INFO ] Initial state test concluded for 4 properties.
FORMULA PermAdmissibility-COL-01-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100000 steps, including 5882 resets, run finished after 284 ms. (steps per millisecond=352 ) properties (out of 14) seen :9
Running SMT prover for 5 properties.
// Phase 1: matrix 16 rows 40 cols
[2021-05-14 09:36:52] [INFO ] Computed 24 place invariants in 6 ms
[2021-05-14 09:36:52] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 15 ms returned unsat
[2021-05-14 09:36:52] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned unsat
[2021-05-14 09:36:52] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned unsat
[2021-05-14 09:36:52] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 3 ms returned unsat
[2021-05-14 09:36:52] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 8 simplifications.
FORMULA PermAdmissibility-COL-01-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 09:36:53] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-14 09:36:53] [INFO ] Flatten gal took : 21 ms
FORMULA PermAdmissibility-COL-01-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 09:36:53] [INFO ] Flatten gal took : 5 ms
[2021-05-14 09:36:53] [INFO ] Unfolded HLPN to a Petri net with 208 places and 1024 transitions in 11 ms.
[2021-05-14 09:36:53] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_13096174276592815585.dot
[2021-05-14 09:36:53] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 40 places in 5 ms
Reduce places removed 40 places and 432 transitions.
Support contains 64 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 128 transition count 592
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 121 transition count 480
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 121 transition count 480
Applied a total of 54 rules in 30 ms. Remains 121 /168 variables (removed 47) and now considering 480/592 (removed 112) transitions.
// Phase 1: matrix 480 rows 121 cols
[2021-05-14 09:36:53] [INFO ] Computed 19 place invariants in 22 ms
[2021-05-14 09:36:53] [INFO ] Implicit Places using invariants in 142 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
// Phase 1: matrix 480 rows 120 cols
[2021-05-14 09:36:53] [INFO ] Computed 18 place invariants in 11 ms
[2021-05-14 09:36:53] [INFO ] Dead Transitions using invariants and state equation in 238 ms returned []
Starting structural reductions, iteration 1 : 120/168 places, 480/592 transitions.
Applied a total of 0 rules in 15 ms. Remains 120 /120 variables (removed 0) and now considering 480/480 (removed 0) transitions.
// Phase 1: matrix 480 rows 120 cols
[2021-05-14 09:36:53] [INFO ] Computed 18 place invariants in 4 ms
[2021-05-14 09:36:53] [INFO ] Dead Transitions using invariants and state equation in 197 ms returned []
Finished structural reductions, in 2 iterations. Remains : 120/168 places, 480/592 transitions.
[2021-05-14 09:36:53] [INFO ] Flatten gal took : 63 ms
[2021-05-14 09:36:53] [INFO ] Flatten gal took : 50 ms
[2021-05-14 09:36:53] [INFO ] Input system was already deterministic with 480 transitions.
Finished random walk after 17 steps, including 1 resets, run visited all 7 properties in 1 ms. (steps per millisecond=17 )
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 120 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 120/120 places, 480/480 transitions.
Graph (complete) has 999 edges and 120 vertex of which 104 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.4 ms
Discarding 16 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 46 ms. Remains 76 /120 variables (removed 44) and now considering 228/480 (removed 252) transitions.
// Phase 1: matrix 228 rows 76 cols
[2021-05-14 09:36:54] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-14 09:36:54] [INFO ] Implicit Places using invariants in 65 ms returned [4, 13, 54, 64]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
[2021-05-14 09:36:54] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 09:36:54] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 09:36:54] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Starting structural reductions, iteration 1 : 72/120 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 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 70 transition count 225
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 6 place count 69 transition count 225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 68 transition count 224
Applied a total of 8 rules in 29 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:36:54] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 09:36:54] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 224 rows 68 cols
[2021-05-14 09:36:54] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-14 09:36:54] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 68/120 places, 224/480 transitions.
Stuttering acceptance computed with spot in 239 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-COL-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 s51 s52 s53 s54 s55 s56 s57 s58)), p2:(LEQ 1 s21), p0:(OR (LEQ (ADD s60 s61 s62 s63 s64 s65 s66 s67) (ADD s51 s52 s53 s54 s55 s56 s57 s58)) (LEQ 1 (ADD s51 s52 s53 s54 s55 s56 s57 s58)))], 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 12 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-COL-01-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-01 finished in 719 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 120 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 120/120 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 104 transition count 480
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 30 place count 90 transition count 354
Iterating global reduction 1 with 14 rules applied. Total rules applied 44 place count 90 transition count 354
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 76 transition count 228
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 76 transition count 228
Applied a total of 72 rules in 8 ms. Remains 76 /120 variables (removed 44) and now considering 228/480 (removed 252) transitions.
// Phase 1: matrix 228 rows 76 cols
[2021-05-14 09:36:54] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 09:36:54] [INFO ] Implicit Places using invariants in 94 ms returned [4, 13, 63, 64]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 95 ms to find 4 implicit places.
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 09:36:54] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 09:36:54] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Starting structural reductions, iteration 1 : 72/120 places, 228/480 transitions.
Applied a total of 0 rules in 2 ms. Remains 72 /72 variables (removed 0) and now considering 228/228 (removed 0) transitions.
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 09:36:54] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 09:36:55] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 2 iterations. Remains : 72/120 places, 228/480 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-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 s28 s29) (ADD s64 s65 s66 s67 s68 s69 s70 s71)) (LEQ (ADD s4 s5 s6 s7 s8 s9 s10 s11) (ADD s36 s37 s38 s39)))], 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 323 ms.
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 72 transition count 228
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 40 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Product exploration explored 100000 steps with 50000 reset in 266 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Support contains 22 out of 72 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 72/72 places, 228/228 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 228
Performed 2 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 2 rules applied. Total rules applied 4 place count 72 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 70 transition count 226
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 70 transition count 226
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 8 rules in 12 ms. Remains 70 /72 variables (removed 2) and now considering 226/228 (removed 2) transitions.
[2021-05-14 09:36:56] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 226 rows 70 cols
[2021-05-14 09:36:56] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 09:36:56] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 1 iterations. Remains : 70/72 places, 226/228 transitions.
Product exploration explored 100000 steps with 50000 reset in 480 ms.
Product exploration explored 100000 steps with 50000 reset in 415 ms.
[2021-05-14 09:36:57] [INFO ] Flatten gal took : 19 ms
[2021-05-14 09:36:57] [INFO ] Flatten gal took : 17 ms
[2021-05-14 09:36:57] [INFO ] Time to serialize gal into /tmp/LTL16026628945086818699.gal : 3 ms
[2021-05-14 09:36:57] [INFO ] Time to serialize properties into /tmp/LTL310914257701748076.ltl : 4 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/LTL16026628945086818699.gal, -t, CGAL, -LTL, /tmp/LTL310914257701748076.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/LTL16026628945086818699.gal -t CGAL -LTL /tmp/LTL310914257701748076.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(((in2_2+in2_3)>(((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7))||((((((((aux10_0+aux10_1)+aux10_2)+aux10_3)+aux10_4)+aux10_5)+aux10_6)+aux10_7)<=(((aux6_0+aux6_1)+aux6_4)+aux6_5)))"))))
Formula 0 simplified : !XF"(((in2_2+in2_3)>(((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7))||((((((((aux10_0+aux10_1)+aux10_2)+aux10_3)+aux10_4)+aux10_5)+aux10_6)+aux10_7)<=(((aux6_0+aux6_1)+aux6_4)+aux6_5)))"
Reverse transition relation is NOT exact ! Due to transitions t65, t66, t67, t68, t69, t70, t71, t72, t74, t75, t76, t77, t78, t79, t80, t81, t83, t84, t85, t86, t87, t88, t89, t90, t92, t93, t94, t95, t96, t97, t98, t99, t101, t102, t103, t104, t105, t106, t107, t108, t110, t111, t112, t113, t114, t115, t116, t117, t119, t120, t121, t122, t123, t124, t125, t126, t272, t273, t274, t275, t276, t277, t278, t279, t280, t281, t282, t283, t284, t285, t286, t287, t320, t321, t322, t323, t324, t325, t326, t327, t328, t329, t330, t331, t332, t333, t334, t335, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :16/124/88/228
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
68 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.726181,42432,1,0,458,64986,466,211,5456,35644,453
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PermAdmissibility-COL-01-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property PermAdmissibility-COL-01-03 finished in 3644 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 120 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 120/120 places, 480/480 transitions.
Graph (complete) has 999 edges and 120 vertex of which 112 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 98 transition count 354
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 98 transition count 354
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 43 place count 84 transition count 228
Iterating global reduction 0 with 14 rules applied. Total rules applied 57 place count 84 transition count 228
Applied a total of 57 rules in 16 ms. Remains 84 /120 variables (removed 36) and now considering 228/480 (removed 252) transitions.
// Phase 1: matrix 228 rows 84 cols
[2021-05-14 09:36:58] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 09:36:58] [INFO ] Implicit Places using invariants in 69 ms returned [4, 13, 63, 64]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 70 ms to find 4 implicit places.
[2021-05-14 09:36:58] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 228 rows 80 cols
[2021-05-14 09:36:58] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-14 09:36:58] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Starting structural reductions, iteration 1 : 80/120 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 80 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 78 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 78 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 76 transition count 224
Applied a total of 8 rules in 9 ms. Remains 76 /80 variables (removed 4) and now considering 224/228 (removed 4) transitions.
// Phase 1: matrix 224 rows 76 cols
[2021-05-14 09:36:58] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-14 09:36:58] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 224 rows 76 cols
[2021-05-14 09:36:58] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-14 09:36:58] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 76/120 places, 224/480 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-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 s10 s11 s12 s13 s14 s15 s16 s17) (ADD s60 s61 s62 s63 s64 s65 s66 s67)), p1:(LEQ 1 (ADD s68 s69 s70 s71 s72 s73 s74 s75))], 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 0 ms.
FORMULA PermAdmissibility-COL-01-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-05 finished in 495 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 9 out of 120 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 120/120 places, 480/480 transitions.
Graph (complete) has 999 edges and 120 vertex of which 96 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 82 transition count 354
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 82 transition count 354
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 43 place count 68 transition count 228
Iterating global reduction 0 with 14 rules applied. Total rules applied 57 place count 68 transition count 228
Applied a total of 57 rules in 14 ms. Remains 68 /120 variables (removed 52) and now considering 228/480 (removed 252) transitions.
// Phase 1: matrix 228 rows 68 cols
[2021-05-14 09:36:58] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 09:36:58] [INFO ] Implicit Places using invariants in 60 ms returned [12, 21, 54, 56]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
[2021-05-14 09:36:58] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 228 rows 64 cols
[2021-05-14 09:36:58] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-14 09:36:59] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Starting structural reductions, iteration 1 : 64/120 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 64 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 61 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 61 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 60 transition count 224
Applied a total of 8 rules in 15 ms. Remains 60 /64 variables (removed 4) and now considering 224/228 (removed 4) transitions.
// Phase 1: matrix 224 rows 60 cols
[2021-05-14 09:36:59] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 09:36:59] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 224 rows 60 cols
[2021-05-14 09:36:59] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-14 09:36:59] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 60/120 places, 224/480 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s51 s52 s53 s54 s55 s56 s57 s58) s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7692 reset in 284 ms.
Product exploration explored 100000 steps with 7692 reset in 216 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 60 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)))), p0]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7692 reset in 171 ms.
Product exploration explored 100000 steps with 7692 reset in 328 ms.
[2021-05-14 09:37:00] [INFO ] Flatten gal took : 17 ms
[2021-05-14 09:37:00] [INFO ] Flatten gal took : 16 ms
[2021-05-14 09:37:00] [INFO ] Time to serialize gal into /tmp/LTL11641509122975500037.gal : 2 ms
[2021-05-14 09:37:00] [INFO ] Time to serialize properties into /tmp/LTL6032872129954301190.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/LTL11641509122975500037.gal, -t, CGAL, -LTL, /tmp/LTL6032872129954301190.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/LTL11641509122975500037.gal -t CGAL -LTL /tmp/LTL6032872129954301190.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((aux14_0+aux14_1)+aux14_2)+aux14_3)+aux14_4)+aux14_5)+aux14_6)+aux14_7)<=c8_0)"))))
Formula 0 simplified : !FG"((((((((aux14_0+aux14_1)+aux14_2)+aux14_3)+aux14_4)+aux14_5)+aux14_6)+aux14_7)<=c8_0)"
Reverse transition relation is NOT exact ! Due to transitions t193, t194, t195, t196, t197, t198, t199, t200, t202, t203, t204, t205, t206, t207, t208, t209, t211, t212, t213, t214, t215, t216, t217, t218, t220, t221, t222, t223, t224, t225, t226, t227, t229, t230, t231, t232, t233, t234, t235, t236, t238, t239, t240, t241, t242, t243, t244, t245, t247, t248, t249, t250, t251, t252, t253, t254, t288, t289, t290, t291, t292, t293, t294, t295, t296, t297, t298, t299, t300, t301, t302, t303, t304, t305, t306, t307, t308, t309, t310, t311, t312, t313, t314, t315, t316, t317, t318, t319, t344, t345, t346, t347, t348, t349, t350, t351, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :16/112/96/224
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
82 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.856851,49248,1,0,513,93535,462,266,5303,68337,607
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PermAdmissibility-COL-01-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property PermAdmissibility-COL-01-15 finished in 2541 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620985022782

--------------------
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-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-COL-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-162089127900460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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