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-162124156200236.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 GPUForwardProgress-PT-36b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156200236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 2.9K May 11 18:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K 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 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 123K 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 GPUForwardProgress-PT-36b-00
FORMULA_NAME GPUForwardProgress-PT-36b-01
FORMULA_NAME GPUForwardProgress-PT-36b-02
FORMULA_NAME GPUForwardProgress-PT-36b-03
FORMULA_NAME GPUForwardProgress-PT-36b-04
FORMULA_NAME GPUForwardProgress-PT-36b-05
FORMULA_NAME GPUForwardProgress-PT-36b-06
FORMULA_NAME GPUForwardProgress-PT-36b-07
FORMULA_NAME GPUForwardProgress-PT-36b-08
FORMULA_NAME GPUForwardProgress-PT-36b-09
FORMULA_NAME GPUForwardProgress-PT-36b-10
FORMULA_NAME GPUForwardProgress-PT-36b-11
FORMULA_NAME GPUForwardProgress-PT-36b-12
FORMULA_NAME GPUForwardProgress-PT-36b-13
FORMULA_NAME GPUForwardProgress-PT-36b-14
FORMULA_NAME GPUForwardProgress-PT-36b-15

=== Now, execution of the tool begins

BK_START 1621277659161

Running Version 0
[2021-05-17 18:54:20] [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 18:54:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 18:54:20] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2021-05-17 18:54:20] [INFO ] Transformed 720 places.
[2021-05-17 18:54:20] [INFO ] Transformed 757 transitions.
[2021-05-17 18:54:20] [INFO ] Found NUPN structural information;
[2021-05-17 18:54:20] [INFO ] Parsed PT model containing 720 places and 757 transitions in 112 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 18:54:20] [INFO ] Initial state test concluded for 1 properties.
FORMULA GPUForwardProgress-PT-36b-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 720 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 720/720 places, 757/757 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 719 transition count 757
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 76 place count 644 transition count 682
Iterating global reduction 1 with 75 rules applied. Total rules applied 151 place count 644 transition count 682
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 186 place count 609 transition count 647
Iterating global reduction 1 with 35 rules applied. Total rules applied 221 place count 609 transition count 647
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 254 place count 609 transition count 614
Applied a total of 254 rules in 150 ms. Remains 609 /720 variables (removed 111) and now considering 614/757 (removed 143) transitions.
// Phase 1: matrix 614 rows 609 cols
[2021-05-17 18:54:21] [INFO ] Computed 37 place invariants in 14 ms
[2021-05-17 18:54:21] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 614 rows 609 cols
[2021-05-17 18:54:21] [INFO ] Computed 37 place invariants in 9 ms
[2021-05-17 18:54:21] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
// Phase 1: matrix 614 rows 609 cols
[2021-05-17 18:54:21] [INFO ] Computed 37 place invariants in 17 ms
[2021-05-17 18:54:21] [INFO ] Dead Transitions using invariants and state equation in 281 ms returned []
Finished structural reductions, in 1 iterations. Remains : 609/720 places, 614/757 transitions.
[2021-05-17 18:54:22] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-17 18:54:22] [INFO ] Flatten gal took : 71 ms
FORMULA GPUForwardProgress-PT-36b-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 18:54:22] [INFO ] Flatten gal took : 34 ms
[2021-05-17 18:54:22] [INFO ] Input system was already deterministic with 614 transitions.
Incomplete random walk after 100000 steps, including 327 resets, run finished after 361 ms. (steps per millisecond=277 ) properties (out of 11) seen :8
Running SMT prover for 3 properties.
// Phase 1: matrix 614 rows 609 cols
[2021-05-17 18:54:22] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-17 18:54:22] [INFO ] [Real]Absence check using 0 positive and 37 generalized place invariants in 14 ms returned sat
[2021-05-17 18:54:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:54:22] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2021-05-17 18:54:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:54:23] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 14 ms returned sat
[2021-05-17 18:54:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:54:23] [INFO ] [Nat]Absence check using state equation in 55 ms returned unsat
[2021-05-17 18:54:23] [INFO ] [Real]Absence check using 0 positive and 37 generalized place invariants in 15 ms returned sat
[2021-05-17 18:54:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:54:23] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-17 18:54:23] [INFO ] Computed and/alt/rep : 608/797/608 causal constraints (skipped 5 transitions) in 37 ms.
[2021-05-17 18:54:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:54:23] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 15 ms returned sat
[2021-05-17 18:54:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:54:23] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2021-05-17 18:54:23] [INFO ] Computed and/alt/rep : 608/797/608 causal constraints (skipped 5 transitions) in 32 ms.
[2021-05-17 18:54:24] [INFO ] Added : 182 causal constraints over 37 iterations in 1036 ms. Result :sat
[2021-05-17 18:54:24] [INFO ] [Real]Absence check using 0 positive and 37 generalized place invariants in 15 ms returned sat
[2021-05-17 18:54:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:54:25] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2021-05-17 18:54:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:54:25] [INFO ] [Nat]Absence check using 0 positive and 37 generalized place invariants in 15 ms returned sat
[2021-05-17 18:54:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:54:25] [INFO ] [Nat]Absence check using state equation in 64 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
[2021-05-17 18:54:25] [INFO ] Initial state test concluded for 2 properties.
FORMULA GPUForwardProgress-PT-36b-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 609 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 609/609 places, 614/614 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 603 transition count 608
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 603 transition count 608
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 603 transition count 605
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 602 transition count 604
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 602 transition count 604
Applied a total of 17 rules in 74 ms. Remains 602 /609 variables (removed 7) and now considering 604/614 (removed 10) transitions.
// Phase 1: matrix 604 rows 602 cols
[2021-05-17 18:54:25] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:54:25] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 604 rows 602 cols
[2021-05-17 18:54:25] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:54:25] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
// Phase 1: matrix 604 rows 602 cols
[2021-05-17 18:54:25] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-17 18:54:26] [INFO ] Dead Transitions using invariants and state equation in 278 ms returned []
Finished structural reductions, in 1 iterations. Remains : 602/609 places, 604/614 transitions.
Stuttering acceptance computed with spot in 255 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 : GPUForwardProgress-PT-36b-00 automaton TGBA [mat=[[{ cond=(NOT p1), 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: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s156 1), p0:(OR (EQ s321 0) (EQ s582 1))], 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 432 reset in 393 ms.
Product exploration explored 100000 steps with 437 reset in 237 ms.
Graph (complete) has 937 edges and 602 vertex of which 562 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.5 ms
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 435 reset in 188 ms.
Product exploration explored 100000 steps with 432 reset in 271 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 602 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 602/602 places, 604/604 transitions.
Graph (trivial) has 487 edges and 602 vertex of which 6 / 602 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 289 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 289 rules applied. Total rules applied 290 place count 597 transition count 599
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 290 place count 597 transition count 1338
Deduced a syphon composed of 330 places in 2 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 331 place count 597 transition count 1338
Discarding 177 places :
Symmetric choice reduction at 1 with 177 rule applications. Total rules 508 place count 420 transition count 744
Deduced a syphon composed of 153 places in 4 ms
Iterating global reduction 1 with 177 rules applied. Total rules applied 685 place count 420 transition count 744
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 263 places in 0 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 795 place count 420 transition count 744
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 797 place count 420 transition count 742
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 872 place count 345 transition count 667
Deduced a syphon composed of 188 places in 0 ms
Iterating global reduction 2 with 75 rules applied. Total rules applied 947 place count 345 transition count 667
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 189 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 948 place count 345 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 949 place count 344 transition count 666
Deduced a syphon composed of 188 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 950 place count 344 transition count 666
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -320
Deduced a syphon composed of 224 places in 1 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 986 place count 344 transition count 986
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 1022 place count 308 transition count 914
Deduced a syphon composed of 188 places in 1 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 1058 place count 308 transition count 914
Deduced a syphon composed of 188 places in 0 ms
Applied a total of 1058 rules in 226 ms. Remains 308 /602 variables (removed 294) and now considering 914/604 (removed -310) transitions.
[2021-05-17 18:54:28] [INFO ] Redundant transitions in 53 ms returned []
[2021-05-17 18:54:28] [INFO ] Flow matrix only has 778 transitions (discarded 136 similar events)
// Phase 1: matrix 778 rows 308 cols
[2021-05-17 18:54:28] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-17 18:54:28] [INFO ] Dead Transitions using invariants and state equation in 341 ms returned []
Finished structural reductions, in 1 iterations. Remains : 308/602 places, 914/604 transitions.
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-36b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-00 finished in 3175 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)||(p0&&F(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 609 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 609/609 places, 614/614 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 601 transition count 606
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 601 transition count 606
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 601 transition count 603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 600 transition count 602
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 600 transition count 602
Applied a total of 21 rules in 57 ms. Remains 600 /609 variables (removed 9) and now considering 602/614 (removed 12) transitions.
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:54:28] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:54:28] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:54:28] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-17 18:54:28] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 600 cols
[2021-05-17 18:54:28] [INFO ] Computed 37 place invariants in 5 ms
[2021-05-17 18:54:29] [INFO ] Dead Transitions using invariants and state equation in 245 ms returned []
Finished structural reductions, in 1 iterations. Remains : 600/609 places, 602/614 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(OR (NEQ s153 0) (NEQ s570 1)), p0:(OR (NEQ s376 0) (NEQ s507 1))], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 299 ms.
Product exploration explored 100000 steps with 33333 reset in 307 ms.
Graph (complete) has 935 edges and 600 vertex of which 560 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 292 ms.
Product exploration explored 100000 steps with 33333 reset in 303 ms.
Applying partial POR strategy [true, true, true, true, false, false]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 600 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 600/600 places, 602/602 transitions.
Graph (trivial) has 486 edges and 600 vertex of which 6 / 600 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 287 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 287 rules applied. Total rules applied 288 place count 595 transition count 596
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 288 place count 595 transition count 1323
Deduced a syphon composed of 328 places in 2 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 329 place count 595 transition count 1323
Discarding 176 places :
Symmetric choice reduction at 1 with 176 rule applications. Total rules 505 place count 419 transition count 739
Deduced a syphon composed of 152 places in 1 ms
Iterating global reduction 1 with 176 rules applied. Total rules applied 681 place count 419 transition count 739
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 262 places in 1 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 791 place count 419 transition count 739
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 793 place count 419 transition count 737
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 868 place count 344 transition count 662
Deduced a syphon composed of 187 places in 0 ms
Iterating global reduction 2 with 75 rules applied. Total rules applied 943 place count 344 transition count 662
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 188 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 944 place count 344 transition count 662
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 945 place count 343 transition count 661
Deduced a syphon composed of 187 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 946 place count 343 transition count 661
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -309
Deduced a syphon composed of 223 places in 1 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 982 place count 343 transition count 970
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 1018 place count 307 transition count 898
Deduced a syphon composed of 187 places in 0 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 1054 place count 307 transition count 898
Deduced a syphon composed of 187 places in 0 ms
Applied a total of 1054 rules in 127 ms. Remains 307 /600 variables (removed 293) and now considering 898/602 (removed -296) transitions.
[2021-05-17 18:54:31] [INFO ] Redundant transitions in 9 ms returned []
[2021-05-17 18:54:31] [INFO ] Flow matrix only has 770 transitions (discarded 128 similar events)
// Phase 1: matrix 770 rows 307 cols
[2021-05-17 18:54:31] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-17 18:54:31] [INFO ] Dead Transitions using invariants and state equation in 289 ms returned []
Finished structural reductions, in 1 iterations. Remains : 307/600 places, 898/602 transitions.
Product exploration explored 100000 steps with 33333 reset in 1126 ms.
Product exploration explored 100000 steps with 33333 reset in 1097 ms.
[2021-05-17 18:54:33] [INFO ] Flatten gal took : 28 ms
[2021-05-17 18:54:33] [INFO ] Flatten gal took : 27 ms
[2021-05-17 18:54:33] [INFO ] Time to serialize gal into /tmp/LTL16281164426444345881.gal : 12 ms
[2021-05-17 18:54:33] [INFO ] Time to serialize properties into /tmp/LTL6893472341938174110.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/LTL16281164426444345881.gal, -t, CGAL, -LTL, /tmp/LTL6893472341938174110.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/LTL16281164426444345881.gal -t CGAL -LTL /tmp/LTL6893472341938174110.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((p444!=0)||(p600!=1))"))||((F("((p176!=0)||(p677!=1))"))&&("((p444!=0)||(p600!=1))"))))))
Formula 0 simplified : !XX(G"((p444!=0)||(p600!=1))" | ("((p444!=0)||(p600!=1))" & F"((p176!=0)||(p677!=1))"))
Detected timeout of ITS tools.
[2021-05-17 18:54:48] [INFO ] Flatten gal took : 24 ms
[2021-05-17 18:54:48] [INFO ] Applying decomposition
[2021-05-17 18:54:48] [INFO ] Flatten gal took : 23 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/graph9647725487321545228.txt, -o, /tmp/graph9647725487321545228.bin, -w, /tmp/graph9647725487321545228.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/graph9647725487321545228.bin, -l, -1, -v, -w, /tmp/graph9647725487321545228.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:54:48] [INFO ] Decomposing Gal with order
[2021-05-17 18:54:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:54:49] [INFO ] Removed a total of 185 redundant transitions.
[2021-05-17 18:54:49] [INFO ] Flatten gal took : 72 ms
[2021-05-17 18:54:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-17 18:54:49] [INFO ] Time to serialize gal into /tmp/LTL12108432720036533494.gal : 10 ms
[2021-05-17 18:54:49] [INFO ] Time to serialize properties into /tmp/LTL8838279343756924826.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/LTL12108432720036533494.gal, -t, CGAL, -LTL, /tmp/LTL8838279343756924826.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12108432720036533494.gal -t CGAL -LTL /tmp/LTL8838279343756924826.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((i23.u158.p444!=0)||(i32.u215.p600!=1))"))||((F("((i10.u66.p176!=0)||(i36.u239.p677!=1))"))&&("((i23.u158.p444!=0)||(i32.u215.p600!=1))"))))))
Formula 0 simplified : !XX(G"((i23.u158.p444!=0)||(i32.u215.p600!=1))" | ("((i23.u158.p444!=0)||(i32.u215.p600!=1))" & F"((i10.u66.p176!=0)||(i36.u239.p677!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t540, i1.t319, i1.t312, i2.i1.t363, i2.i1.i1.u97.t355, i3.t535, i3.u21.t528, i4.t522, i4.t513, i5.t506, i5.t499, i6.t492, i6.t483, i7.t476, i7.t469, i8.t462, i8.t455, i9.t448, i9.u56.t441, i10.t426, i10.u64.t434, i11.t419, i11.u68.t412, i12.t398, i12.u76.t405, i13.t391, i13.u80.t384, i14.t377, i14.u91.t370, i15.t348, i15.u103.t340, i16.t333, i16.t326, i17.t305, i17.t298, i18.t291, i18.t284, i19.t277, i19.u135.t270, i20.t263, i20.t256, i21.t249, i21.t242, i22.t235, i22.u149.t228, i23.t221, i23.t214, i24.t207, i24.u162.t200, i25.t193, i25.u173.t186, i26.t179, i26.t172, i27.t165, i27.t158, i28.t151, i28.u187.t144, i29.t130, i29.u196.t137, i30.t123, i30.u204.t116, i31.t109, i31.t102, i32.t95, i32.u212.t88, i33.t81, i33.u218.t74, i34.t67, i34.u229.t60, i35.t53, i35.u235.t46, i36.t39, i36.t30, i37.t23, i37.t10, i37.t2, i37.u243.t25, i37.u248.t4, i37.u248.t5, i37.u248.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/522/80/602
Computing Next relation with stutter on 3.00189e+17 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
170 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.75947,70280,1,0,77334,357,4693,118866,149,849,634054
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-36b-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property GPUForwardProgress-PT-36b-04 finished in 22520 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 609 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 609/609 places, 614/614 transitions.
Graph (trivial) has 500 edges and 609 vertex of which 7 / 609 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 292 transitions
Trivial Post-agglo rules discarded 292 transitions
Performed 292 trivial Post agglomeration. Transition count delta: 292
Iterating post reduction 0 with 292 rules applied. Total rules applied 293 place count 602 transition count 314
Reduce places removed 292 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 298 rules applied. Total rules applied 591 place count 310 transition count 308
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 595 place count 307 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 596 place count 306 transition count 307
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 77 Pre rules applied. Total rules applied 596 place count 306 transition count 230
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 750 place count 229 transition count 230
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 751 place count 228 transition count 229
Iterating global reduction 4 with 1 rules applied. Total rules applied 752 place count 228 transition count 229
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 966 place count 121 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 967 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 968 place count 120 transition count 120
Iterating global reduction 5 with 1 rules applied. Total rules applied 969 place count 120 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 971 place count 119 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 972 place count 118 transition count 118
Applied a total of 972 rules in 38 ms. Remains 118 /609 variables (removed 491) and now considering 118/614 (removed 496) transitions.
[2021-05-17 18:54:51] [INFO ] Flow matrix only has 84 transitions (discarded 34 similar events)
// Phase 1: matrix 84 rows 118 cols
[2021-05-17 18:54:51] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-17 18:54:51] [INFO ] Implicit Places using invariants in 89 ms returned []
[2021-05-17 18:54:51] [INFO ] Flow matrix only has 84 transitions (discarded 34 similar events)
// Phase 1: matrix 84 rows 118 cols
[2021-05-17 18:54:51] [INFO ] Computed 37 place invariants in 4 ms
[2021-05-17 18:54:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 18:54:51] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2021-05-17 18:54:51] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-17 18:54:51] [INFO ] Flow matrix only has 84 transitions (discarded 34 similar events)
// Phase 1: matrix 84 rows 118 cols
[2021-05-17 18:54:51] [INFO ] Computed 37 place invariants in 0 ms
[2021-05-17 18:54:51] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 118/609 places, 118/614 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s40 0) (NEQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-10 finished in 342 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 609 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 609/609 places, 614/614 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 602 transition count 607
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 602 transition count 607
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 602 transition count 605
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 601 transition count 604
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 601 transition count 604
Applied a total of 18 rules in 36 ms. Remains 601 /609 variables (removed 8) and now considering 604/614 (removed 10) transitions.
// Phase 1: matrix 604 rows 601 cols
[2021-05-17 18:54:51] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:54:51] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 604 rows 601 cols
[2021-05-17 18:54:51] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:54:51] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
// Phase 1: matrix 604 rows 601 cols
[2021-05-17 18:54:51] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:54:52] [INFO ] Dead Transitions using invariants and state equation in 249 ms returned []
Finished structural reductions, in 1 iterations. Remains : 601/609 places, 604/614 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s60 1)], 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]]
Stuttering criterion allowed to conclude after 297 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-12 finished in 849 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 609 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 609/609 places, 614/614 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 603 transition count 608
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 603 transition count 608
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 603 transition count 606
Applied a total of 14 rules in 26 ms. Remains 603 /609 variables (removed 6) and now considering 606/614 (removed 8) transitions.
// Phase 1: matrix 606 rows 603 cols
[2021-05-17 18:54:52] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:54:52] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 606 rows 603 cols
[2021-05-17 18:54:52] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-17 18:54:52] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
// Phase 1: matrix 606 rows 603 cols
[2021-05-17 18:54:52] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-17 18:54:52] [INFO ] Dead Transitions using invariants and state equation in 254 ms returned []
Finished structural reductions, in 1 iterations. Remains : 603/609 places, 606/614 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : GPUForwardProgress-PT-36b-13 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s24 0) (EQ s375 1)), p0:(AND (NEQ s581 0) (NEQ s84 1) (NEQ s76 0) (NEQ s540 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 141 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-36b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-13 finished in 824 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621277693902

--------------------
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="GPUForwardProgress-PT-36b"
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 GPUForwardProgress-PT-36b, 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-162124156200236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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