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-162038144000492.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 CSRepetitions-COL-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038144000492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 22 12:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:10 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 14K 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 CSRepetitions-COL-03-00
FORMULA_NAME CSRepetitions-COL-03-01
FORMULA_NAME CSRepetitions-COL-03-02
FORMULA_NAME CSRepetitions-COL-03-03
FORMULA_NAME CSRepetitions-COL-03-04
FORMULA_NAME CSRepetitions-COL-03-05
FORMULA_NAME CSRepetitions-COL-03-06
FORMULA_NAME CSRepetitions-COL-03-07
FORMULA_NAME CSRepetitions-COL-03-08
FORMULA_NAME CSRepetitions-COL-03-09
FORMULA_NAME CSRepetitions-COL-03-10
FORMULA_NAME CSRepetitions-COL-03-11
FORMULA_NAME CSRepetitions-COL-03-12
FORMULA_NAME CSRepetitions-COL-03-13
FORMULA_NAME CSRepetitions-COL-03-14
FORMULA_NAME CSRepetitions-COL-03-15

=== Now, execution of the tool begins

BK_START 1620549087578

Running Version 0
[2021-05-09 08:31:29] [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-09 08:31:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:31:29] [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-09 08:31:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-09 08:31:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 512 ms
[2021-05-09 08:31:29] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 58 PT places and 81.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
[2021-05-09 08:31:29] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions in 11 ms.
[2021-05-09 08:31:29] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_11818010959899804457.dot
[2021-05-09 08:31:29] [INFO ] Initial state test concluded for 3 properties.
FORMULA CSRepetitions-COL-03-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 12758 steps, including 396 resets, run visited all 22 properties in 30 ms. (steps per millisecond=425 )
[2021-05-09 08:31:29] [INFO ] Flatten gal took : 15 ms
[2021-05-09 08:31:29] [INFO ] Flatten gal took : 1 ms
[2021-05-09 08:31:29] [INFO ] Unfolded HLPN to a Petri net with 58 places and 81 transitions in 3 ms.
[2021-05-09 08:31:29] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_5677896425156200201.dot
Support contains 49 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 13 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:30] [INFO ] Computed 12 place invariants in 8 ms
[2021-05-09 08:31:30] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:30] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-09 08:31:30] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 08:31:30] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:30] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 08:31:30] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
[2021-05-09 08:31:30] [INFO ] Flatten gal took : 10 ms
[2021-05-09 08:31:30] [INFO ] Flatten gal took : 32 ms
[2021-05-09 08:31:30] [INFO ] Input system was already deterministic with 81 transitions.
Finished random walk after 2616 steps, including 86 resets, run visited all 22 properties in 14 ms. (steps per millisecond=186 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:31] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 08:31:31] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:31] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 08:31:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 08:31:31] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:31] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 08:31:31] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s19 s20 s21) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9))], 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 22629 reset in 304 ms.
Stack based approach found an accepted trace after 13979 steps with 3156 reset with depth 5 and stack size 5 in 33 ms.
FORMULA CSRepetitions-COL-03-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-00 finished in 1513 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 45 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:32] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:32] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:32] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:32] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 08:31:32] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:32] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:32] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-03-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GT (ADD s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9)), p0:(LEQ 2 (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-03-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-02 finished in 345 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:32] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 08:31:32] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:32] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 08:31:32] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 08:31:32] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:32] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:32] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30) (ADD s19 s20 s21))], 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 6096 reset in 248 ms.
Stack based approach found an accepted trace after 18 steps with 2 reset with depth 5 and stack size 5 in 0 ms.
FORMULA CSRepetitions-COL-03-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-03 finished in 480 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 13 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:32] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-09 08:31:32] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:32] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:32] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 08:31:33] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:33] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 08:31:33] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-03-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GT s0 (ADD s19 s20 s21)), p0:(GT 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 13 out of 58 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2021-05-09 08:31:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:34] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 08:31:34] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Product exploration explored 100000 steps with 50000 reset in 476 ms.
Product exploration explored 100000 steps with 50000 reset in 715 ms.
[2021-05-09 08:31:35] [INFO ] Flatten gal took : 34 ms
[2021-05-09 08:31:35] [INFO ] Flatten gal took : 10 ms
[2021-05-09 08:31:35] [INFO ] Time to serialize gal into /tmp/LTL7480359347418318879.gal : 15 ms
[2021-05-09 08:31:35] [INFO ] Time to serialize properties into /tmp/LTL2219623032454621082.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7480359347418318879.gal, -t, CGAL, -LTL, /tmp/LTL2219623032454621082.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/LTL7480359347418318879.gal -t CGAL -LTL /tmp/LTL2219623032454621082.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((((((((Client_Sending_0+Client_Sending_1)+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)+Client_Sending_5)+Client_Sending_6)+Client_Sending_7)+Client_Sending_8)<3)")||(G("(RequestBufferSlots_0>((Server_Waiting_0+Server_Waiting_1)+Server_Waiting_2))"))))))
Formula 0 simplified : !XF("(((((((((Client_Sending_0+Client_Sending_1)+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)+Client_Sending_5)+Client_Sending_6)+Client_Sending_7)+Client_Sending_8)<3)" | G"(RequestBufferSlots_0>((Server_Waiting_0+Server_Waiting_1)+Server_Waiting_2))")
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, t72, t73, t74, t75, t76, t77, t78, t79, t80, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/36/45/81
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
238 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,2.42795,74964,1,0,220,376983,198,86,2282,317003,179
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-03-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CSRepetitions-COL-03-04 finished in 6159 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0 U X(X(X(G(p1))))))&&(X(p2)||G(p0))))], workingDir=/home/mcc/execution]
Support contains 46 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 10 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:39] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:39] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:39] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 08:31:39] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 08:31:39] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:39] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 08:31:39] [INFO ] Dead Transitions using invariants and state equation in 179 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 518 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-03-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 8}], [{ cond=(NOT p2), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(LEQ 1 s0), p2:(LEQ 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9)), p1:(GT (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30) (ADD s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-03-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-05 finished in 1232 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 13 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:40] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:40] [INFO ] Implicit Places using invariants in 497 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:40] [INFO ] Computed 12 place invariants in 13 ms
[2021-05-09 08:31:40] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 08:31:40] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:40] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:40] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-03-06 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(LEQ (ADD s19 s20 s21) s0), p0:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 27697 reset in 296 ms.
Product exploration explored 100000 steps with 27573 reset in 237 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 27726 reset in 193 ms.
Product exploration explored 100000 steps with 27891 reset in 192 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 13 out of 58 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2021-05-09 08:31:42] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:42] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:42] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Product exploration explored 100000 steps with 27447 reset in 423 ms.
Product exploration explored 100000 steps with 27706 reset in 339 ms.
[2021-05-09 08:31:43] [INFO ] Flatten gal took : 7 ms
[2021-05-09 08:31:43] [INFO ] Flatten gal took : 6 ms
[2021-05-09 08:31:43] [INFO ] Time to serialize gal into /tmp/LTL15430741962624932590.gal : 1 ms
[2021-05-09 08:31:43] [INFO ] Time to serialize properties into /tmp/LTL5061355644906164163.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15430741962624932590.gal, -t, CGAL, -LTL, /tmp/LTL5061355644906164163.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/LTL15430741962624932590.gal -t CGAL -LTL /tmp/LTL5061355644906164163.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(((((((((Client_Sending_0+Client_Sending_1)+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)+Client_Sending_5)+Client_Sending_6)+Client_Sending_7)+Client_Sending_8)>=1)"))||(F("(((Server_Waiting_0+Server_Waiting_1)+Server_Waiting_2)<=RequestBufferSlots_0)"))))))
Formula 0 simplified : !XX(G"(((((((((Client_Sending_0+Client_Sending_1)+Client_Sending_2)+Client_Sending_3)+Client_Sending_4)+Client_Sending_5)+Client_Sending_6)+Client_Sending_7)+Client_Sending_8)>=1)" | F"(((Server_Waiting_0+Server_Waiting_1)+Server_Waiting_2)<=RequestBufferSlots_0)")
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, t72, t73, t74, t75, t76, t77, t78, t79, t80, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/36/45/81
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
611 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,6.12949,193672,1,0,320,976812,198,174,2358,1.17702e+06,368
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-COL-03-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CSRepetitions-COL-03-06 finished in 10458 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(G(p0))&&G((p1&&F(p2))))))], workingDir=/home/mcc/execution]
Support contains 40 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:50] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 08:31:50] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:50] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 08:31:50] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:50] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:50] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CSRepetitions-COL-03-07 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 1}, { cond=p1, acceptance={1} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 (ADD s19 s20 s21)), p2:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9) (ADD s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57)), p0:(LEQ s0 (ADD s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-03-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-07 finished in 332 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0) U (p1||X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 31 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:51] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:51] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:51] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 08:31:51] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:51] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:51] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 (ADD s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57)), p0:(LEQ (ADD s19 s20 s21) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 592 steps with 49 reset in 2 ms.
FORMULA CSRepetitions-COL-03-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-08 finished in 207 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 39 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 7 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:51] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:51] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:51] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 08:31:51] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2021-05-09 08:31:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:51] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 08:31:51] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-03-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9) (ADD s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57)), p1:(LEQ 3 (ADD s19 s20 s21))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-03-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-09 finished in 208 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(p0)||F(p1))))], workingDir=/home/mcc/execution]
Support contains 19 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:51] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:51] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:51] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 08:31:51] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:51] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 08:31:51] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-03-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s0 (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30)), p0:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9) (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30))], nbAcceptance=1, 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 35 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-03-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-10 finished in 231 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)&&((p1 U p0)||X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 22 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:51] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:51] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:51] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-09 08:31:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 08:31:51] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:51] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-09 08:31:51] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p2), true]
Running random walk in product with property : CSRepetitions-COL-03-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s19 s20 s21) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9)), p1:(LEQ 1 (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30)), p2:(GT (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-03-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-11 finished in 256 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((!p0&&X(p1))))))], workingDir=/home/mcc/execution]
Support contains 37 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:51] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:51] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:51] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 08:31:52] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:52] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:52] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : CSRepetitions-COL-03-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(GT s0 (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30)), p1:(GT (ADD s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57) (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-03-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-12 finished in 417 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 9 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:52] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:52] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:52] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 08:31:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-09 08:31:52] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 58 cols
[2021-05-09 08:31:52] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-09 08:31:52] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 3 (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30))], 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 CSRepetitions-COL-03-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-13 finished in 409 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620549113214

--------------------
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="CSRepetitions-COL-03"
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 CSRepetitions-COL-03, 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 r026-tajo-162038144000492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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