Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156400420.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HirschbergSinclair-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156400420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 34K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 164K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.8K May 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 11 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 11 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 687K May 12 08:13 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 HirschbergSinclair-PT-20-00
FORMULA_NAME HirschbergSinclair-PT-20-01
FORMULA_NAME HirschbergSinclair-PT-20-02
FORMULA_NAME HirschbergSinclair-PT-20-03
FORMULA_NAME HirschbergSinclair-PT-20-04
FORMULA_NAME HirschbergSinclair-PT-20-05
FORMULA_NAME HirschbergSinclair-PT-20-06
FORMULA_NAME HirschbergSinclair-PT-20-07
FORMULA_NAME HirschbergSinclair-PT-20-08
FORMULA_NAME HirschbergSinclair-PT-20-09
FORMULA_NAME HirschbergSinclair-PT-20-10
FORMULA_NAME HirschbergSinclair-PT-20-11
FORMULA_NAME HirschbergSinclair-PT-20-12
FORMULA_NAME HirschbergSinclair-PT-20-13
FORMULA_NAME HirschbergSinclair-PT-20-14
FORMULA_NAME HirschbergSinclair-PT-20-15

=== Now, execution of the tool begins

BK_START 1621287145264

Running Version 0
[2021-05-17 21:32: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-17 21:32:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 21:32:29] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2021-05-17 21:32:29] [INFO ] Transformed 530 places.
[2021-05-17 21:32:29] [INFO ] Transformed 485 transitions.
[2021-05-17 21:32:29] [INFO ] Parsed PT model containing 530 places and 485 transitions in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 21:32:29] [INFO ] Initial state test concluded for 1 properties.
FORMULA HirschbergSinclair-PT-20-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 530 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 530/530 places, 485/485 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 511 transition count 485
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 32 place count 498 transition count 472
Iterating global reduction 1 with 13 rules applied. Total rules applied 45 place count 498 transition count 472
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 487 transition count 461
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 487 transition count 461
Applied a total of 67 rules in 130 ms. Remains 487 /530 variables (removed 43) and now considering 461/485 (removed 24) transitions.
// Phase 1: matrix 461 rows 487 cols
[2021-05-17 21:32:29] [INFO ] Computed 26 place invariants in 27 ms
[2021-05-17 21:32:29] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 461 rows 487 cols
[2021-05-17 21:32:29] [INFO ] Computed 26 place invariants in 6 ms
[2021-05-17 21:32:30] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 1347 ms to find 0 implicit places.
// Phase 1: matrix 461 rows 487 cols
[2021-05-17 21:32:30] [INFO ] Computed 26 place invariants in 5 ms
[2021-05-17 21:32:31] [INFO ] Dead Transitions using invariants and state equation in 231 ms returned []
Finished structural reductions, in 1 iterations. Remains : 487/530 places, 461/485 transitions.
[2021-05-17 21:32:31] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 21:32:31] [INFO ] Flatten gal took : 73 ms
FORMULA HirschbergSinclair-PT-20-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 21:32:31] [INFO ] Flatten gal took : 32 ms
[2021-05-17 21:32:31] [INFO ] Input system was already deterministic with 461 transitions.
Incomplete random walk after 100000 steps, including 206 resets, run finished after 413 ms. (steps per millisecond=242 ) properties (out of 23) seen :16
Running SMT prover for 7 properties.
// Phase 1: matrix 461 rows 487 cols
[2021-05-17 21:32:33] [INFO ] Computed 26 place invariants in 3 ms
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using 1 positive and 25 generalized place invariants in 35 ms returned sat
[2021-05-17 21:32:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using state equation in 78 ms returned unsat
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using 1 positive and 25 generalized place invariants in 34 ms returned sat
[2021-05-17 21:32:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using state equation in 84 ms returned unsat
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using 1 positive and 25 generalized place invariants in 34 ms returned sat
[2021-05-17 21:32:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using state equation in 61 ms returned unsat
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using 1 positive and 25 generalized place invariants in 33 ms returned sat
[2021-05-17 21:32:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using state equation in 59 ms returned unsat
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using 1 positive and 25 generalized place invariants in 34 ms returned sat
[2021-05-17 21:32:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using state equation in 120 ms returned unsat
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using 1 positive and 25 generalized place invariants in 35 ms returned sat
[2021-05-17 21:32:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:32:34] [INFO ] [Real]Absence check using state equation in 65 ms returned unsat
[2021-05-17 21:32:35] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2021-05-17 21:32:35] [INFO ] [Real]Absence check using 1 positive and 25 generalized place invariants in 37 ms returned sat
[2021-05-17 21:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 21:32:35] [INFO ] [Real]Absence check using state equation in 102 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
[2021-05-17 21:32:35] [INFO ] Initial state test concluded for 5 properties.
FORMULA HirschbergSinclair-PT-20-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 487 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 487/487 places, 461/461 transitions.
Graph (complete) has 924 edges and 487 vertex of which 486 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 202 place count 485 transition count 259
Reduce places removed 201 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 202 rules applied. Total rules applied 404 place count 284 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 405 place count 283 transition count 258
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 413 place count 275 transition count 250
Iterating global reduction 3 with 8 rules applied. Total rules applied 421 place count 275 transition count 250
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 423 place count 275 transition count 248
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 425 place count 273 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 426 place count 272 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 427 place count 271 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 428 place count 270 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 429 place count 269 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 430 place count 268 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 431 place count 267 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 432 place count 266 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 433 place count 265 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 434 place count 264 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 435 place count 263 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 436 place count 262 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 437 place count 261 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 438 place count 260 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 439 place count 259 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 440 place count 258 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 441 place count 257 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 442 place count 256 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 443 place count 255 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 444 place count 254 transition count 229
Applied a total of 444 rules in 278 ms. Remains 254 /487 variables (removed 233) and now considering 229/461 (removed 232) transitions.
// Phase 1: matrix 229 rows 254 cols
[2021-05-17 21:32:35] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 21:32:35] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 229 rows 254 cols
[2021-05-17 21:32:35] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-17 21:32:35] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2021-05-17 21:32:35] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 229 rows 254 cols
[2021-05-17 21:32:35] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-17 21:32:36] [INFO ] Dead Transitions using invariants and state equation in 124 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/487 places, 229/461 transitions.
Stuttering acceptance computed with spot in 3019 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : HirschbergSinclair-PT-20-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (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=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GT s170 s74), p0:(GT 1 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 33261 reset in 492 ms.
Product exploration explored 100000 steps with 33264 reset in 476 ms.
Graph (complete) has 645 edges and 254 vertex of which 234 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 33307 reset in 391 ms.
Product exploration explored 100000 steps with 33320 reset in 427 ms.
[2021-05-17 21:32:41] [INFO ] Flatten gal took : 13 ms
[2021-05-17 21:32:41] [INFO ] Flatten gal took : 12 ms
[2021-05-17 21:32:41] [INFO ] Time to serialize gal into /tmp/LTL8667063809427405149.gal : 6 ms
[2021-05-17 21:32:41] [INFO ] Time to serialize properties into /tmp/LTL6158363535683039066.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/LTL8667063809427405149.gal, -t, CGAL, -LTL, /tmp/LTL6158363535683039066.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/LTL8667063809427405149.gal -t CGAL -LTL /tmp/LTL6158363535683039066.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G(F("(rcv_left_reply_2_0_2<1)")))U(G("(rcv_left_election_20_4_9_9>reply_20_1_to_left_1)"))))
Formula 0 simplified : !(GF"(rcv_left_reply_2_0_2<1)" U G"(rcv_left_election_20_4_9_9>reply_20_1_to_left_1)")
Reverse transition relation is NOT exact ! Due to transitions t27, t28.t29, t32.t33, t36.t37, t42.t43, t46.t47, t51.t52, t55.t56, t60.t61, t66.t67, t72.t73, t76.t77, t80.t81, t84.t85, t88.t89, t92.t93, t96.t97, t102.t103, t397.t398, t437.t438, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/209/20/229
Computing Next relation with stutter on 5.49316e+14 deadlock states
Detected timeout of ITS tools.
[2021-05-17 21:32:56] [INFO ] Flatten gal took : 13 ms
[2021-05-17 21:32:56] [INFO ] Applying decomposition
[2021-05-17 21:32:56] [INFO ] Flatten gal took : 11 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/graph7940110540802083856.txt, -o, /tmp/graph7940110540802083856.bin, -w, /tmp/graph7940110540802083856.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/graph7940110540802083856.bin, -l, -1, -v, -w, /tmp/graph7940110540802083856.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 21:32:56] [INFO ] Decomposing Gal with order
[2021-05-17 21:32:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 21:32:56] [INFO ] Removed a total of 161 redundant transitions.
[2021-05-17 21:32:56] [INFO ] Flatten gal took : 52 ms
[2021-05-17 21:32:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 11 ms.
[2021-05-17 21:32:56] [INFO ] Time to serialize gal into /tmp/LTL4472404247297796526.gal : 6 ms
[2021-05-17 21:32:56] [INFO ] Time to serialize properties into /tmp/LTL11108052913577695413.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/LTL4472404247297796526.gal, -t, CGAL, -LTL, /tmp/LTL11108052913577695413.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/LTL4472404247297796526.gal -t CGAL -LTL /tmp/LTL11108052913577695413.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G(F("(gi2.gi1.gi0.gu1.rcv_left_reply_2_0_2<1)")))U(G("(gu28.rcv_left_election_20_4_9_9>gu28.reply_20_1_to_left_1)"))))
Formula 0 simplified : !(GF"(gi2.gi1.gi0.gu1.rcv_left_reply_2_0_2<1)" U G"(gu28.rcv_left_election_20_4_9_9>gu28.reply_20_1_to_left_1)")
Reverse transition relation is NOT exact ! Due to transitions gi2.gi0.t60_t61, gi2.gi0.t66_t67, gi2.gi1.gi0.gu1.t27, gi2.gi1.gi0.t437_t438, gi2.gi1.gi0.t397_t398, gi2.gi1.gi0.t102_t103, gi2.gi1.gi0.t28_t29, gi2.gi1.gi1.t51_t52, gi2.gi1.gi2.t42_t43, gi2.gi1.gi2.t36_t37, gi2.gi1.t32_t33, gi2.gi1.t46_t47, gi2.gi2.t76_t77, gi2.gi2.t84_t85, gi2.gi2.t88_t89, gi2.gi2.t92_t93, gi2.gi2.t242_t243, gi2.t278_t279, gi2.t96_t97, gi2.t55_t56, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/203/20/223
Computing Next relation with stutter on 5.49316e+14 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15256520489744347962
[2021-05-17 21:33:11] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15256520489744347962
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15256520489744347962]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15256520489744347962] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15256520489744347962] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property HirschbergSinclair-PT-20-01 finished in 37583 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 487/487 places, 461/461 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 486 transition count 461
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 477 transition count 452
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 477 transition count 452
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 470 transition count 445
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 470 transition count 445
Applied a total of 33 rules in 27 ms. Remains 470 /487 variables (removed 17) and now considering 445/461 (removed 16) transitions.
// Phase 1: matrix 445 rows 470 cols
[2021-05-17 21:33:12] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-17 21:33:12] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 445 rows 470 cols
[2021-05-17 21:33:12] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-17 21:33:14] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
// Phase 1: matrix 445 rows 470 cols
[2021-05-17 21:33:14] [INFO ] Computed 25 place invariants in 11 ms
[2021-05-17 21:33:14] [INFO ] Dead Transitions using invariants and state equation in 220 ms returned []
Finished structural reductions, in 1 iterations. Remains : 470/487 places, 445/461 transitions.
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-03 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:(GT s123 s260)], 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 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-20-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-03 finished in 1520 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||(X(X(F(p1)))&&(G(p2) U !p0))))], workingDir=/home/mcc/execution]
Support contains 7 out of 487 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 487/487 places, 461/461 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 486 transition count 461
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 478 transition count 453
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 478 transition count 453
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 473 transition count 448
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 473 transition count 448
Applied a total of 27 rules in 27 ms. Remains 473 /487 variables (removed 14) and now considering 448/461 (removed 13) transitions.
// Phase 1: matrix 448 rows 473 cols
[2021-05-17 21:33:14] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-17 21:33:14] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 448 rows 473 cols
[2021-05-17 21:33:14] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:33:15] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
// Phase 1: matrix 448 rows 473 cols
[2021-05-17 21:33:15] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:33:15] [INFO ] Dead Transitions using invariants and state equation in 220 ms returned []
Finished structural reductions, in 1 iterations. Remains : 473/487 places, 448/461 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-20-04 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 5}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(GT s362 s112), p2:(LEQ s460 s141), p1:(AND (LEQ 1 s233) (LEQ s248 s42))], 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, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 427 reset in 284 ms.
Product exploration explored 100000 steps with 427 reset in 304 ms.
Graph (complete) has 903 edges and 473 vertex of which 453 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0), p2, (NOT p1)]
Adopting property with smaller alphabet thanks to knowledge :(NOT p0)
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 473 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 473/473 places, 448/448 transitions.
Applied a total of 0 rules in 7 ms. Remains 473 /473 variables (removed 0) and now considering 448/448 (removed 0) transitions.
// Phase 1: matrix 448 rows 473 cols
[2021-05-17 21:33:16] [INFO ] Computed 25 place invariants in 6 ms
[2021-05-17 21:33:16] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 448 rows 473 cols
[2021-05-17 21:33:16] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:33:18] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1267 ms to find 0 implicit places.
// Phase 1: matrix 448 rows 473 cols
[2021-05-17 21:33:18] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-17 21:33:18] [INFO ] Dead Transitions using invariants and state equation in 219 ms returned []
Finished structural reductions, in 1 iterations. Remains : 473/473 places, 448/448 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 428 reset in 257 ms.
Product exploration explored 100000 steps with 427 reset in 271 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 473 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 473/473 places, 448/448 transitions.
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 473 transition count 448
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 197 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 197 place count 473 transition count 448
Deduced a syphon composed of 197 places in 2 ms
Applied a total of 197 rules in 58 ms. Remains 473 /473 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2021-05-17 21:33:19] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 448 rows 473 cols
[2021-05-17 21:33:19] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:33:19] [INFO ] Dead Transitions using invariants and state equation in 208 ms returned []
Finished structural reductions, in 1 iterations. Remains : 473/473 places, 448/448 transitions.
Product exploration explored 100000 steps with 766 reset in 342 ms.
Product exploration explored 100000 steps with 766 reset in 302 ms.
Starting structural reductions, iteration 0 : 473/473 places, 448/448 transitions.
Applied a total of 0 rules in 24 ms. Remains 473 /473 variables (removed 0) and now considering 448/448 (removed 0) transitions.
// Phase 1: matrix 448 rows 473 cols
[2021-05-17 21:33:19] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:33:20] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 448 rows 473 cols
[2021-05-17 21:33:20] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:33:21] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
// Phase 1: matrix 448 rows 473 cols
[2021-05-17 21:33:21] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-17 21:33:21] [INFO ] Dead Transitions using invariants and state equation in 219 ms returned []
Finished structural reductions, in 1 iterations. Remains : 473/473 places, 448/448 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:789)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1621287202311

--------------------
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="HirschbergSinclair-PT-20"
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 HirschbergSinclair-PT-20, 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 r292-tall-162124156400420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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