Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 79K 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 BusinessProcesses-PT-04-00
FORMULA_NAME BusinessProcesses-PT-04-01
FORMULA_NAME BusinessProcesses-PT-04-02
FORMULA_NAME BusinessProcesses-PT-04-03
FORMULA_NAME BusinessProcesses-PT-04-04
FORMULA_NAME BusinessProcesses-PT-04-05
FORMULA_NAME BusinessProcesses-PT-04-06
FORMULA_NAME BusinessProcesses-PT-04-07
FORMULA_NAME BusinessProcesses-PT-04-08
FORMULA_NAME BusinessProcesses-PT-04-09
FORMULA_NAME BusinessProcesses-PT-04-10
FORMULA_NAME BusinessProcesses-PT-04-11
FORMULA_NAME BusinessProcesses-PT-04-12
FORMULA_NAME BusinessProcesses-PT-04-13
FORMULA_NAME BusinessProcesses-PT-04-14
FORMULA_NAME BusinessProcesses-PT-04-15

=== Now, execution of the tool begins

BK_START 1620542624358

Running Version 0
[2021-05-09 06:43:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-09 06:43:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:43:47] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2021-05-09 06:43:47] [INFO ] Transformed 288 places.
[2021-05-09 06:43:47] [INFO ] Transformed 283 transitions.
[2021-05-09 06:43:47] [INFO ] Found NUPN structural information;
[2021-05-09 06:43:47] [INFO ] Parsed PT model containing 288 places and 283 transitions in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 06:43:47] [INFO ] Initial state test concluded for 4 properties.
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 2 transitions.
FORMULA BusinessProcesses-PT-04-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 286 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 283 transition count 281
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 37 place count 249 transition count 247
Iterating global reduction 1 with 34 rules applied. Total rules applied 71 place count 249 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 249 transition count 246
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 85 place count 236 transition count 233
Iterating global reduction 2 with 13 rules applied. Total rules applied 98 place count 236 transition count 233
Applied a total of 98 rules in 107 ms. Remains 236 /286 variables (removed 50) and now considering 233/281 (removed 48) transitions.
// Phase 1: matrix 233 rows 236 cols
[2021-05-09 06:43:47] [INFO ] Computed 41 place invariants in 13 ms
[2021-05-09 06:43:48] [INFO ] Implicit Places using invariants in 404 ms returned []
// Phase 1: matrix 233 rows 236 cols
[2021-05-09 06:43:48] [INFO ] Computed 41 place invariants in 4 ms
[2021-05-09 06:43:48] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
// Phase 1: matrix 233 rows 236 cols
[2021-05-09 06:43:48] [INFO ] Computed 41 place invariants in 5 ms
[2021-05-09 06:43:48] [INFO ] Dead Transitions using invariants and state equation in 219 ms returned []
Finished structural reductions, in 1 iterations. Remains : 236/286 places, 233/281 transitions.
[2021-05-09 06:43:49] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 06:43:49] [INFO ] Flatten gal took : 86 ms
FORMULA BusinessProcesses-PT-04-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 06:43:49] [INFO ] Flatten gal took : 38 ms
[2021-05-09 06:43:49] [INFO ] Input system was already deterministic with 233 transitions.
Incomplete random walk after 100000 steps, including 1123 resets, run finished after 366 ms. (steps per millisecond=273 ) properties (out of 27) seen :20
Running SMT prover for 7 properties.
// Phase 1: matrix 233 rows 236 cols
[2021-05-09 06:43:49] [INFO ] Computed 41 place invariants in 13 ms
[2021-05-09 06:43:49] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2021-05-09 06:43:49] [INFO ] [Real]Absence check using 17 positive and 24 generalized place invariants in 7 ms returned sat
[2021-05-09 06:43:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:43:49] [INFO ] [Real]Absence check using state equation in 80 ms returned unsat
[2021-05-09 06:43:49] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2021-05-09 06:43:49] [INFO ] [Real]Absence check using 17 positive and 24 generalized place invariants in 7 ms returned sat
[2021-05-09 06:43:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:43:49] [INFO ] [Real]Absence check using state equation in 89 ms returned unsat
[2021-05-09 06:43:50] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2021-05-09 06:43:50] [INFO ] [Real]Absence check using 17 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-09 06:43:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:43:50] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-09 06:43:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:43:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned unsat
[2021-05-09 06:43:50] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned unsat
[2021-05-09 06:43:50] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-09 06:43:50] [INFO ] [Real]Absence check using 17 positive and 24 generalized place invariants in 7 ms returned sat
[2021-05-09 06:43:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:43:50] [INFO ] [Real]Absence check using state equation in 139 ms returned unsat
[2021-05-09 06:43:50] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2021-05-09 06:43:50] [INFO ] [Real]Absence check using 17 positive and 24 generalized place invariants in 7 ms returned sat
[2021-05-09 06:43:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:43:50] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2021-05-09 06:43:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:43:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2021-05-09 06:43:50] [INFO ] [Nat]Absence check using 17 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-09 06:43:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:43:50] [INFO ] [Nat]Absence check using state equation in 47 ms returned unsat
[2021-05-09 06:43:50] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2021-05-09 06:43:50] [INFO ] [Real]Absence check using 17 positive and 24 generalized place invariants in 5 ms returned sat
[2021-05-09 06:43:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:43:50] [INFO ] [Real]Absence check using state equation in 118 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
[2021-05-09 06:43:50] [INFO ] Initial state test concluded for 3 properties.
FORMULA BusinessProcesses-PT-04-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(F(p0)) U (p1||F(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 233/233 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 224 transition count 221
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 224 transition count 221
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 221 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 221 transition count 218
Applied a total of 30 rules in 125 ms. Remains 221 /236 variables (removed 15) and now considering 218/233 (removed 15) transitions.
// Phase 1: matrix 218 rows 221 cols
[2021-05-09 06:43:51] [INFO ] Computed 41 place invariants in 6 ms
[2021-05-09 06:43:51] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 218 rows 221 cols
[2021-05-09 06:43:51] [INFO ] Computed 41 place invariants in 4 ms
[2021-05-09 06:43:51] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 221 cols
[2021-05-09 06:43:51] [INFO ] Computed 41 place invariants in 5 ms
[2021-05-09 06:43:51] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 221/236 places, 218/233 transitions.
Stuttering acceptance computed with spot in 447 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-04-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s116 0), p2:(EQ s127 1), p0:(EQ s149 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1825 reset in 326 ms.
Product exploration explored 100000 steps with 1814 reset in 205 ms.
Graph (complete) has 558 edges and 221 vertex of which 220 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Knowledge obtained : [p1, (NOT p2), p0]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1834 reset in 291 ms.
Product exploration explored 100000 steps with 1805 reset in 246 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 221 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 221/221 places, 218/218 transitions.
Graph (trivial) has 89 edges and 221 vertex of which 6 / 221 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 216 transition count 212
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 44 Pre rules applied. Total rules applied 17 place count 216 transition count 306
Deduced a syphon composed of 60 places in 1 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 61 place count 216 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 211 transition count 293
Deduced a syphon composed of 55 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 211 transition count 293
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 105 places in 1 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 121 place count 211 transition count 293
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 133 place count 199 transition count 281
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 145 place count 199 transition count 281
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 199 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 147 place count 198 transition count 294
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 148 place count 198 transition count 294
Deduced a syphon composed of 93 places in 0 ms
Applied a total of 148 rules in 121 ms. Remains 198 /221 variables (removed 23) and now considering 294/218 (removed -76) transitions.
[2021-05-09 06:43:54] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 294 rows 198 cols
[2021-05-09 06:43:54] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:44:08] [INFO ] Dead Transitions using invariants and state equation in 13953 ms returned []
Finished structural reductions, in 1 iterations. Remains : 198/221 places, 294/218 transitions.
Product exploration explored 100000 steps with 15935 reset in 854 ms.
Product exploration explored 100000 steps with 15942 reset in 477 ms.
[2021-05-09 06:44:09] [INFO ] Flatten gal took : 28 ms
[2021-05-09 06:44:09] [INFO ] Flatten gal took : 22 ms
[2021-05-09 06:44:09] [INFO ] Time to serialize gal into /tmp/LTL16922493061498057450.gal : 22 ms
[2021-05-09 06:44:09] [INFO ] Time to serialize properties into /tmp/LTL13350923581714810812.ltl : 2 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/LTL16922493061498057450.gal, -t, CGAL, -LTL, /tmp/LTL13350923581714810812.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/LTL16922493061498057450.gal -t CGAL -LTL /tmp/LTL13350923581714810812.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("(p179==0)")))U(("(p138==0)")||(F(G("(p152==1)"))))))))
Formula 0 simplified : !XG(XF"(p179==0)" U ("(p138==0)" | FG"(p152==1)"))
Detected timeout of ITS tools.
[2021-05-09 06:44:24] [INFO ] Flatten gal took : 43 ms
[2021-05-09 06:44:24] [INFO ] Applying decomposition
[2021-05-09 06:44:24] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph220949074564446936.txt, -o, /tmp/graph220949074564446936.bin, -w, /tmp/graph220949074564446936.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph220949074564446936.bin, -l, -1, -v, -w, /tmp/graph220949074564446936.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 06:44:25] [INFO ] Decomposing Gal with order
[2021-05-09 06:44:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 06:44:25] [INFO ] Removed a total of 233 redundant transitions.
[2021-05-09 06:44:25] [INFO ] Flatten gal took : 62 ms
[2021-05-09 06:44:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 12 ms.
[2021-05-09 06:44:25] [INFO ] Time to serialize gal into /tmp/LTL6036174510400788994.gal : 7 ms
[2021-05-09 06:44:25] [INFO ] Time to serialize properties into /tmp/LTL416242203844354903.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/LTL6036174510400788994.gal, -t, CGAL, -LTL, /tmp/LTL416242203844354903.ltl, -c, -stutter-deadlock], 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/LTL6036174510400788994.gal -t CGAL -LTL /tmp/LTL416242203844354903.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("(i10.i0.u53.p179==0)")))U(("(i9.u43.p138==0)")||(F(G("(i12.i0.u46.p152==1)"))))))))
Formula 0 simplified : !XG(XF"(i10.i0.u53.p179==0)" U ("(i9.u43.p138==0)" | FG"(i12.i0.u46.p152==1)"))
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t101, t126, t135, t214, i0.u15.t125, i0.u32.t100, i1.u5.t144, i2.t134, i4.i1.u47.t73, i6.i0.u54.t53, i6.i1.u34.t96, i6.i1.u38.t89, i7.u36.t92, i8.u49.t67, i8.u50.t64, i9.u48.t70, i10.i0.t57, i10.i0.u17.t105, i10.i0.u17.t121, i10.i0.u53.t58, i12.i0.t77, i12.i0.u45.t78, i12.i1.t0, i12.i1.u7.t137, i12.i1.u7.t141, i12.i1.u44.t80, i13.i0.u51.t60, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :40/141/36/217
Computing Next relation with stutter on 460 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1488 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,14.9469,394412,1,0,840702,663,4400,1.04272e+06,312,2310,1891900
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-04-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-04-01 finished in 49272 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (p1 U X(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 233/233 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 223 transition count 220
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 223 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 220 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 220 transition count 217
Applied a total of 32 rules in 5 ms. Remains 220 /236 variables (removed 16) and now considering 217/233 (removed 16) transitions.
// Phase 1: matrix 217 rows 220 cols
[2021-05-09 06:44:40] [INFO ] Computed 41 place invariants in 5 ms
[2021-05-09 06:44:40] [INFO ] Implicit Places using invariants in 199 ms returned []
// Phase 1: matrix 217 rows 220 cols
[2021-05-09 06:44:40] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:44:40] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 220 cols
[2021-05-09 06:44:40] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:44:41] [INFO ] Dead Transitions using invariants and state equation in 318 ms returned []
Finished structural reductions, in 1 iterations. Remains : 220/236 places, 217/233 transitions.
Stuttering acceptance computed with spot in 405 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s169 0), p0:(EQ s120 1), p2:(EQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 99 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-02 finished in 1252 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 233/233 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 223 transition count 220
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 223 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 220 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 220 transition count 217
Applied a total of 32 rules in 16 ms. Remains 220 /236 variables (removed 16) and now considering 217/233 (removed 16) transitions.
// Phase 1: matrix 217 rows 220 cols
[2021-05-09 06:44:41] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:44:41] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 217 rows 220 cols
[2021-05-09 06:44:41] [INFO ] Computed 41 place invariants in 8 ms
[2021-05-09 06:44:41] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 220 cols
[2021-05-09 06:44:41] [INFO ] Computed 41 place invariants in 4 ms
[2021-05-09 06:44:42] [INFO ] Dead Transitions using invariants and state equation in 210 ms returned []
Finished structural reductions, in 1 iterations. Remains : 220/236 places, 217/233 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s63 0) (EQ s48 0) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-05 finished in 823 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((F(p0)&&F(p1)) U p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 233/233 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 235 transition count 215
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 218 transition count 213
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 216 transition count 213
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 38 place count 216 transition count 163
Deduced a syphon composed of 50 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 144 place count 160 transition count 163
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 155 place count 149 transition count 152
Iterating global reduction 3 with 11 rules applied. Total rules applied 166 place count 149 transition count 152
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 166 place count 149 transition count 148
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 174 place count 145 transition count 148
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 266 place count 99 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 267 place count 99 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 269 place count 98 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 270 place count 97 transition count 103
Applied a total of 270 rules in 87 ms. Remains 97 /236 variables (removed 139) and now considering 103/233 (removed 130) transitions.
// Phase 1: matrix 103 rows 97 cols
[2021-05-09 06:44:42] [INFO ] Computed 35 place invariants in 1 ms
[2021-05-09 06:44:42] [INFO ] Implicit Places using invariants in 91 ms returned [35, 36]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 92 ms to find 2 implicit places.
[2021-05-09 06:44:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 103 rows 95 cols
[2021-05-09 06:44:42] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-09 06:44:42] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Starting structural reductions, iteration 1 : 95/236 places, 103/233 transitions.
Applied a total of 0 rules in 20 ms. Remains 95 /95 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2021-05-09 06:44:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 103 rows 95 cols
[2021-05-09 06:44:42] [INFO ] Computed 33 place invariants in 1 ms
[2021-05-09 06:44:42] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 2 iterations. Remains : 95/236 places, 103/233 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p2), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-04-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s36 0), p0:(AND (EQ s11 1) (EQ s44 1) (EQ s72 1)), p1:(EQ s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 40 steps with 2 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-07 finished in 701 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 233/233 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 224 transition count 221
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 224 transition count 221
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 221 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 221 transition count 218
Applied a total of 30 rules in 7 ms. Remains 221 /236 variables (removed 15) and now considering 218/233 (removed 15) transitions.
// Phase 1: matrix 218 rows 221 cols
[2021-05-09 06:44:43] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-09 06:44:43] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 218 rows 221 cols
[2021-05-09 06:44:43] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-09 06:44:43] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 221 cols
[2021-05-09 06:44:43] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-09 06:44:43] [INFO ] Dead Transitions using invariants and state equation in 500 ms returned []
Finished structural reductions, in 1 iterations. Remains : 221/236 places, 218/233 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-04-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s97 1), p1:(OR (EQ s157 1) (EQ s148 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 162 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-09 finished in 1114 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 233/233 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 223 transition count 220
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 223 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 220 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 220 transition count 217
Applied a total of 32 rules in 7 ms. Remains 220 /236 variables (removed 16) and now considering 217/233 (removed 16) transitions.
// Phase 1: matrix 217 rows 220 cols
[2021-05-09 06:44:44] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-09 06:44:44] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 217 rows 220 cols
[2021-05-09 06:44:44] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-09 06:44:44] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 220 cols
[2021-05-09 06:44:44] [INFO ] Computed 41 place invariants in 5 ms
[2021-05-09 06:44:44] [INFO ] Dead Transitions using invariants and state equation in 136 ms returned []
Finished structural reductions, in 1 iterations. Remains : 220/236 places, 217/233 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-10 finished in 682 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 233/233 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 223 transition count 220
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 223 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 220 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 220 transition count 217
Applied a total of 32 rules in 8 ms. Remains 220 /236 variables (removed 16) and now considering 217/233 (removed 16) transitions.
// Phase 1: matrix 217 rows 220 cols
[2021-05-09 06:44:44] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:44:44] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 217 rows 220 cols
[2021-05-09 06:44:44] [INFO ] Computed 41 place invariants in 5 ms
[2021-05-09 06:44:45] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 220 cols
[2021-05-09 06:44:45] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:44:45] [INFO ] Dead Transitions using invariants and state equation in 125 ms returned []
Finished structural reductions, in 1 iterations. Remains : 220/236 places, 217/233 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1312 steps with 14 reset in 4 ms.
FORMULA BusinessProcesses-PT-04-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-11 finished in 606 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 233/233 transitions.
Graph (trivial) has 107 edges and 236 vertex of which 7 / 236 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 229 transition count 203
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 207 transition count 203
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 45 place count 207 transition count 158
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 141 place count 156 transition count 158
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 151 place count 146 transition count 148
Iterating global reduction 2 with 10 rules applied. Total rules applied 161 place count 146 transition count 148
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 161 place count 146 transition count 144
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 169 place count 142 transition count 144
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 265 place count 94 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 267 place count 93 transition count 99
Applied a total of 267 rules in 44 ms. Remains 93 /236 variables (removed 143) and now considering 99/233 (removed 134) transitions.
// Phase 1: matrix 99 rows 93 cols
[2021-05-09 06:44:45] [INFO ] Computed 35 place invariants in 2 ms
[2021-05-09 06:44:45] [INFO ] Implicit Places using invariants in 144 ms returned [1, 12, 35, 36, 37]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 146 ms to find 5 implicit places.
[2021-05-09 06:44:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 99 rows 88 cols
[2021-05-09 06:44:45] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 06:44:45] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 88/236 places, 99/233 transitions.
Applied a total of 0 rules in 15 ms. Remains 88 /88 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2021-05-09 06:44:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 99 rows 88 cols
[2021-05-09 06:44:45] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 06:44:45] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 2 iterations. Remains : 88/236 places, 99/233 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(NEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 29 steps with 2 reset in 3 ms.
FORMULA BusinessProcesses-PT-04-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-13 finished in 437 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 233/233 transitions.
Graph (trivial) has 107 edges and 236 vertex of which 7 / 236 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 229 transition count 204
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 208 transition count 203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 207 transition count 203
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 45 place count 207 transition count 158
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 141 place count 156 transition count 158
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 152 place count 145 transition count 147
Iterating global reduction 3 with 11 rules applied. Total rules applied 163 place count 145 transition count 147
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 163 place count 145 transition count 142
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 173 place count 140 transition count 142
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 261 place count 96 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 95 transition count 101
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 265 place count 95 transition count 101
Applied a total of 265 rules in 31 ms. Remains 95 /236 variables (removed 141) and now considering 101/233 (removed 132) transitions.
// Phase 1: matrix 101 rows 95 cols
[2021-05-09 06:44:45] [INFO ] Computed 35 place invariants in 1 ms
[2021-05-09 06:44:46] [INFO ] Implicit Places using invariants in 173 ms returned [1, 36, 37, 38]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 175 ms to find 4 implicit places.
[2021-05-09 06:44:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 101 rows 91 cols
[2021-05-09 06:44:46] [INFO ] Computed 31 place invariants in 1 ms
[2021-05-09 06:44:46] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 91/236 places, 101/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 91 /91 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2021-05-09 06:44:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 101 rows 91 cols
[2021-05-09 06:44:46] [INFO ] Computed 31 place invariants in 1 ms
[2021-05-09 06:44:46] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 91/236 places, 101/233 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-04-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s12 1), p1:(EQ s2 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-14 finished in 382 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620542686695

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="BusinessProcesses-PT-04"
export BK_EXAMINATION="LTLFireability"
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 BusinessProcesses-PT-04, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143800349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-04.tgz
mv BusinessProcesses-PT-04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;