Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918600500.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CANConstruction-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918600500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 6.6K Apr 29 11:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 29 11:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 29 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 641K May 10 09:33 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 CANConstruction-PT-020-LTLFireability-00
FORMULA_NAME CANConstruction-PT-020-LTLFireability-01
FORMULA_NAME CANConstruction-PT-020-LTLFireability-02
FORMULA_NAME CANConstruction-PT-020-LTLFireability-03
FORMULA_NAME CANConstruction-PT-020-LTLFireability-04
FORMULA_NAME CANConstruction-PT-020-LTLFireability-05
FORMULA_NAME CANConstruction-PT-020-LTLFireability-06
FORMULA_NAME CANConstruction-PT-020-LTLFireability-07
FORMULA_NAME CANConstruction-PT-020-LTLFireability-08
FORMULA_NAME CANConstruction-PT-020-LTLFireability-09
FORMULA_NAME CANConstruction-PT-020-LTLFireability-10
FORMULA_NAME CANConstruction-PT-020-LTLFireability-11
FORMULA_NAME CANConstruction-PT-020-LTLFireability-12
FORMULA_NAME CANConstruction-PT-020-LTLFireability-13
FORMULA_NAME CANConstruction-PT-020-LTLFireability-14
FORMULA_NAME CANConstruction-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652644661619

Running Version 202205111006
[2022-05-15 19:57:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 19:57:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 19:57:43] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2022-05-15 19:57:43] [INFO ] Transformed 1042 places.
[2022-05-15 19:57:43] [INFO ] Transformed 1760 transitions.
[2022-05-15 19:57:43] [INFO ] Parsed PT model containing 1042 places and 1760 transitions in 265 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANConstruction-PT-020-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Discarding 343 places :
Symmetric choice reduction at 0 with 343 rule applications. Total rules 343 place count 699 transition count 1074
Iterating global reduction 0 with 343 rules applied. Total rules applied 686 place count 699 transition count 1074
Applied a total of 686 rules in 131 ms. Remains 699 /1042 variables (removed 343) and now considering 1074/1760 (removed 686) transitions.
// Phase 1: matrix 1074 rows 699 cols
[2022-05-15 19:57:43] [INFO ] Computed 41 place invariants in 30 ms
[2022-05-15 19:57:43] [INFO ] Implicit Places using invariants in 586 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 166, 180, 194, 208, 236, 250, 264, 278]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 615 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 681/1042 places, 1074/1760 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 663 transition count 1056
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 663 transition count 1056
Applied a total of 36 rules in 97 ms. Remains 663 /681 variables (removed 18) and now considering 1056/1074 (removed 18) transitions.
// Phase 1: matrix 1056 rows 663 cols
[2022-05-15 19:57:44] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-15 19:57:44] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 1056 rows 663 cols
[2022-05-15 19:57:44] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-15 19:57:44] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-05-15 19:57:46] [INFO ] Implicit Places using invariants and state equation in 1865 ms returned []
Implicit Place search using SMT with State Equation took 2140 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 663/1042 places, 1056/1760 transitions.
Finished structural reductions, in 2 iterations. Remains : 663/1042 places, 1056/1760 transitions.
Support contains 51 out of 663 places after structural reductions.
[2022-05-15 19:57:46] [INFO ] Flatten gal took : 97 ms
[2022-05-15 19:57:46] [INFO ] Flatten gal took : 55 ms
[2022-05-15 19:57:46] [INFO ] Input system was already deterministic with 1056 transitions.
Support contains 48 out of 663 places (down from 51) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 529 ms. (steps per millisecond=18 ) properties (out of 34) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1056 rows 663 cols
[2022-05-15 19:57:47] [INFO ] Computed 23 place invariants in 24 ms
[2022-05-15 19:57:47] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2022-05-15 19:57:47] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 19:57:47] [INFO ] After 322ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:1
[2022-05-15 19:57:47] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-05-15 19:57:47] [INFO ] After 134ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-15 19:57:47] [INFO ] After 681ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-15 19:57:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2022-05-15 19:57:48] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 19:57:48] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-15 19:57:48] [INFO ] After 192ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2022-05-15 19:57:48] [INFO ] After 409ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 127 ms.
[2022-05-15 19:57:49] [INFO ] After 1039ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 7 out of 663 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 663/663 places, 1056/1056 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 663 transition count 928
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 1 with 128 rules applied. Total rules applied 256 place count 535 transition count 928
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 256 place count 535 transition count 910
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 292 place count 517 transition count 910
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 306 place count 503 transition count 882
Iterating global reduction 2 with 14 rules applied. Total rules applied 320 place count 503 transition count 882
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 7 rules applied. Total rules applied 327 place count 503 transition count 875
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 334 place count 496 transition count 875
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 378 place count 474 transition count 853
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 382 place count 474 transition count 849
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 386 place count 470 transition count 849
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 388 place count 470 transition count 847
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 390 place count 468 transition count 847
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 391 place count 468 transition count 847
Applied a total of 391 rules in 217 ms. Remains 468 /663 variables (removed 195) and now considering 847/1056 (removed 209) transitions.
Finished structural reductions, in 1 iterations. Remains : 468/663 places, 847/1056 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 847 rows 468 cols
[2022-05-15 19:57:49] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-15 19:57:49] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2022-05-15 19:57:49] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 4 ms returned sat
[2022-05-15 19:57:49] [INFO ] After 190ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 19:57:49] [INFO ] State equation strengthened by 782 read => feed constraints.
[2022-05-15 19:57:49] [INFO ] After 88ms SMT Verify possible using 782 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:57:49] [INFO ] After 407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:57:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2022-05-15 19:57:49] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 19:57:50] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:57:50] [INFO ] After 99ms SMT Verify possible using 782 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:57:50] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-05-15 19:57:50] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 468 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 468/468 places, 847/847 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 466 transition count 843
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 466 transition count 843
Applied a total of 4 rules in 64 ms. Remains 466 /468 variables (removed 2) and now considering 843/847 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 466/468 places, 843/847 transitions.
Finished random walk after 9472 steps, including 69 resets, run visited all 1 properties in 41 ms. (steps per millisecond=231 )
FORMULA CANConstruction-PT-020-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 63 stabilizing places and 82 stable transitions
FORMULA CANConstruction-PT-020-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(X(p0))))))'
Support contains 1 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 1056/1056 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 663 transition count 926
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 1 with 130 rules applied. Total rules applied 260 place count 533 transition count 926
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 260 place count 533 transition count 908
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 296 place count 515 transition count 908
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 312 place count 499 transition count 876
Iterating global reduction 2 with 16 rules applied. Total rules applied 328 place count 499 transition count 876
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 337 place count 499 transition count 867
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 346 place count 490 transition count 867
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 388 place count 469 transition count 846
Applied a total of 388 rules in 92 ms. Remains 469 /663 variables (removed 194) and now considering 846/1056 (removed 210) transitions.
// Phase 1: matrix 846 rows 469 cols
[2022-05-15 19:57:50] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-15 19:57:51] [INFO ] Implicit Places using invariants in 253 ms returned [35, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 260 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 467/663 places, 846/1056 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 467 transition count 842
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 463 transition count 842
Applied a total of 8 rules in 30 ms. Remains 463 /467 variables (removed 4) and now considering 842/846 (removed 4) transitions.
// Phase 1: matrix 842 rows 463 cols
[2022-05-15 19:57:51] [INFO ] Computed 21 place invariants in 6 ms
[2022-05-15 19:57:51] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 842 rows 463 cols
[2022-05-15 19:57:51] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-15 19:57:51] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-05-15 19:57:53] [INFO ] Implicit Places using invariants and state equation in 1571 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 463/663 places, 842/1056 transitions.
Finished structural reductions, in 2 iterations. Remains : 463/663 places, 842/1056 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s129 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 742 reset in 650 ms.
Stack based approach found an accepted trace after 6193 steps with 45 reset with depth 113 and stack size 112 in 47 ms.
FORMULA CANConstruction-PT-020-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-00 finished in 3095 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(X((F(p0)||(p0 U F(G(p1)))))))&&X(p2))))'
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1056/1056 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 647 transition count 1024
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 647 transition count 1024
Applied a total of 32 rules in 29 ms. Remains 647 /663 variables (removed 16) and now considering 1024/1056 (removed 32) transitions.
// Phase 1: matrix 1024 rows 647 cols
[2022-05-15 19:57:54] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-15 19:57:54] [INFO ] Implicit Places using invariants in 291 ms returned [132, 194]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 292 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 645/663 places, 1024/1056 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 643 transition count 1022
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 643 transition count 1022
Applied a total of 4 rules in 23 ms. Remains 643 /645 variables (removed 2) and now considering 1022/1024 (removed 2) transitions.
// Phase 1: matrix 1022 rows 643 cols
[2022-05-15 19:57:54] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-15 19:57:54] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 1022 rows 643 cols
[2022-05-15 19:57:54] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-15 19:57:54] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-05-15 19:57:56] [INFO ] Implicit Places using invariants and state equation in 1923 ms returned []
Implicit Place search using SMT with State Equation took 2193 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 643/663 places, 1022/1056 transitions.
Finished structural reductions, in 2 iterations. Remains : 643/663 places, 1022/1056 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s61 1), p0:(GEQ s607 1), p1:(AND (GEQ s18 1) (GEQ s586 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-01 finished in 2737 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||(F(G(F(p1)))&&F(p2))))'
Support contains 5 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1056/1056 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 647 transition count 1024
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 647 transition count 1024
Applied a total of 32 rules in 56 ms. Remains 647 /663 variables (removed 16) and now considering 1024/1056 (removed 32) transitions.
// Phase 1: matrix 1024 rows 647 cols
[2022-05-15 19:57:56] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-15 19:57:57] [INFO ] Implicit Places using invariants in 247 ms returned [132, 194]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 248 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 645/663 places, 1024/1056 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 643 transition count 1022
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 643 transition count 1022
Applied a total of 4 rules in 33 ms. Remains 643 /645 variables (removed 2) and now considering 1022/1024 (removed 2) transitions.
// Phase 1: matrix 1022 rows 643 cols
[2022-05-15 19:57:57] [INFO ] Computed 21 place invariants in 8 ms
[2022-05-15 19:57:57] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 1022 rows 643 cols
[2022-05-15 19:57:57] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-15 19:57:57] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-05-15 19:57:59] [INFO ] Implicit Places using invariants and state equation in 1911 ms returned []
Implicit Place search using SMT with State Equation took 2179 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 643/663 places, 1022/1056 transitions.
Finished structural reductions, in 2 iterations. Remains : 643/663 places, 1022/1056 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s179 1) (GEQ s210 1)), p2:(GEQ s331 1), p0:(AND (GEQ s107 1) (GEQ s150 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 283 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-02 finished in 2709 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 1056/1056 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 663 transition count 929
Reduce places removed 127 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 128 rules applied. Total rules applied 255 place count 536 transition count 928
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 535 transition count 928
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 256 place count 535 transition count 910
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 292 place count 517 transition count 910
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 309 place count 500 transition count 876
Iterating global reduction 3 with 17 rules applied. Total rules applied 326 place count 500 transition count 876
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 10 rules applied. Total rules applied 336 place count 500 transition count 866
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 346 place count 490 transition count 866
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 350 place count 488 transition count 864
Applied a total of 350 rules in 76 ms. Remains 488 /663 variables (removed 175) and now considering 864/1056 (removed 192) transitions.
// Phase 1: matrix 864 rows 488 cols
[2022-05-15 19:57:59] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-15 19:57:59] [INFO ] Implicit Places using invariants in 259 ms returned [46, 69]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 269 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 486/663 places, 864/1056 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 486 transition count 862
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 484 transition count 862
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 482 transition count 860
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 482 transition count 860
Applied a total of 8 rules in 38 ms. Remains 482 /486 variables (removed 4) and now considering 860/864 (removed 4) transitions.
// Phase 1: matrix 860 rows 482 cols
[2022-05-15 19:57:59] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-15 19:58:00] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 860 rows 482 cols
[2022-05-15 19:58:00] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-15 19:58:00] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-05-15 19:58:01] [INFO ] Implicit Places using invariants and state equation in 1687 ms returned []
Implicit Place search using SMT with State Equation took 1949 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 482/663 places, 860/1056 transitions.
Finished structural reductions, in 2 iterations. Remains : 482/663 places, 860/1056 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 640 reset in 357 ms.
Stack based approach found an accepted trace after 3062 steps with 20 reset with depth 32 and stack size 32 in 12 ms.
FORMULA CANConstruction-PT-020-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-03 finished in 2752 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 1056/1056 transitions.
Drop transitions removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 663 transition count 927
Reduce places removed 129 places and 0 transitions.
Iterating post reduction 1 with 129 rules applied. Total rules applied 258 place count 534 transition count 927
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 258 place count 534 transition count 909
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 294 place count 516 transition count 909
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 310 place count 500 transition count 877
Iterating global reduction 2 with 16 rules applied. Total rules applied 326 place count 500 transition count 877
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 335 place count 500 transition count 868
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 344 place count 491 transition count 868
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 386 place count 470 transition count 847
Applied a total of 386 rules in 63 ms. Remains 470 /663 variables (removed 193) and now considering 847/1056 (removed 209) transitions.
// Phase 1: matrix 847 rows 470 cols
[2022-05-15 19:58:02] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-15 19:58:02] [INFO ] Implicit Places using invariants in 235 ms returned [36, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 238 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 468/663 places, 847/1056 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 468 transition count 844
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 465 transition count 844
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 464 transition count 843
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 464 transition count 843
Applied a total of 8 rules in 30 ms. Remains 464 /468 variables (removed 4) and now considering 843/847 (removed 4) transitions.
// Phase 1: matrix 843 rows 464 cols
[2022-05-15 19:58:02] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-15 19:58:02] [INFO ] Implicit Places using invariants in 217 ms returned []
// Phase 1: matrix 843 rows 464 cols
[2022-05-15 19:58:02] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-15 19:58:02] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-05-15 19:58:04] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 1877 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 464/663 places, 843/1056 transitions.
Finished structural reductions, in 2 iterations. Remains : 464/663 places, 843/1056 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s34 1) (GEQ s264 1)), p1:(AND (GEQ s34 1) (GEQ s81 1) (GEQ s203 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 132 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-04 finished in 2346 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1056/1056 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 648 transition count 1026
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 648 transition count 1026
Applied a total of 30 rules in 29 ms. Remains 648 /663 variables (removed 15) and now considering 1026/1056 (removed 30) transitions.
// Phase 1: matrix 1026 rows 648 cols
[2022-05-15 19:58:04] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-15 19:58:04] [INFO ] Implicit Places using invariants in 263 ms returned [132, 194]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 264 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/663 places, 1026/1056 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 644 transition count 1024
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 644 transition count 1024
Applied a total of 4 rules in 26 ms. Remains 644 /646 variables (removed 2) and now considering 1024/1026 (removed 2) transitions.
// Phase 1: matrix 1024 rows 644 cols
[2022-05-15 19:58:04] [INFO ] Computed 21 place invariants in 5 ms
[2022-05-15 19:58:05] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 1024 rows 644 cols
[2022-05-15 19:58:05] [INFO ] Computed 21 place invariants in 8 ms
[2022-05-15 19:58:05] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-05-15 19:58:07] [INFO ] Implicit Places using invariants and state equation in 1953 ms returned []
Implicit Place search using SMT with State Equation took 2240 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 644/663 places, 1024/1056 transitions.
Finished structural reductions, in 2 iterations. Remains : 644/663 places, 1024/1056 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GEQ s482 1), p1:(GEQ s322 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 337 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-05 finished in 2692 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(p0)&&G(p1)))||X(p2))))'
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1056/1056 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 647 transition count 1024
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 647 transition count 1024
Applied a total of 32 rules in 33 ms. Remains 647 /663 variables (removed 16) and now considering 1024/1056 (removed 32) transitions.
// Phase 1: matrix 1024 rows 647 cols
[2022-05-15 19:58:07] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-15 19:58:07] [INFO ] Implicit Places using invariants in 278 ms returned [132, 194]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 279 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 645/663 places, 1024/1056 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 643 transition count 1022
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 643 transition count 1022
Applied a total of 4 rules in 27 ms. Remains 643 /645 variables (removed 2) and now considering 1022/1024 (removed 2) transitions.
// Phase 1: matrix 1022 rows 643 cols
[2022-05-15 19:58:07] [INFO ] Computed 21 place invariants in 9 ms
[2022-05-15 19:58:07] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 1022 rows 643 cols
[2022-05-15 19:58:07] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-15 19:58:08] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-05-15 19:58:09] [INFO ] Implicit Places using invariants and state equation in 1770 ms returned []
Implicit Place search using SMT with State Equation took 2033 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 643/663 places, 1022/1056 transitions.
Finished structural reductions, in 2 iterations. Remains : 643/663 places, 1022/1056 transitions.
Stuttering acceptance computed with spot in 415 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LT s92 1), p2:(AND (GEQ s114 1) (GEQ s258 1)), p0:(LT s414 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-07 finished in 2819 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0)&&(p1 U p2)))))'
Support contains 5 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1056/1056 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 647 transition count 1024
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 647 transition count 1024
Applied a total of 32 rules in 39 ms. Remains 647 /663 variables (removed 16) and now considering 1024/1056 (removed 32) transitions.
// Phase 1: matrix 1024 rows 647 cols
[2022-05-15 19:58:10] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-15 19:58:10] [INFO ] Implicit Places using invariants in 250 ms returned [194]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 251 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/663 places, 1024/1056 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 645 transition count 1023
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 645 transition count 1023
Applied a total of 2 rules in 25 ms. Remains 645 /646 variables (removed 1) and now considering 1023/1024 (removed 1) transitions.
// Phase 1: matrix 1023 rows 645 cols
[2022-05-15 19:58:10] [INFO ] Computed 22 place invariants in 6 ms
[2022-05-15 19:58:10] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 1023 rows 645 cols
[2022-05-15 19:58:10] [INFO ] Computed 22 place invariants in 7 ms
[2022-05-15 19:58:10] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-05-15 19:58:12] [INFO ] Implicit Places using invariants and state equation in 1962 ms returned []
Implicit Place search using SMT with State Equation took 2249 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 645/663 places, 1023/1056 transitions.
Finished structural reductions, in 2 iterations. Remains : 645/663 places, 1023/1056 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s493 1)), p1:(AND (GEQ s132 1) (GEQ s134 1)), p0:(LT s478 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-08 finished in 2785 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((X(G(p0))&&p1) U p2))'
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1056/1056 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 647 transition count 1024
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 647 transition count 1024
Applied a total of 32 rules in 35 ms. Remains 647 /663 variables (removed 16) and now considering 1024/1056 (removed 32) transitions.
// Phase 1: matrix 1024 rows 647 cols
[2022-05-15 19:58:12] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-15 19:58:13] [INFO ] Implicit Places using invariants in 257 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 258 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/663 places, 1024/1056 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 645 transition count 1023
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 645 transition count 1023
Applied a total of 2 rules in 26 ms. Remains 645 /646 variables (removed 1) and now considering 1023/1024 (removed 1) transitions.
// Phase 1: matrix 1023 rows 645 cols
[2022-05-15 19:58:13] [INFO ] Computed 22 place invariants in 6 ms
[2022-05-15 19:58:13] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 1023 rows 645 cols
[2022-05-15 19:58:13] [INFO ] Computed 22 place invariants in 9 ms
[2022-05-15 19:58:13] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-05-15 19:58:15] [INFO ] Implicit Places using invariants and state equation in 2002 ms returned []
Implicit Place search using SMT with State Equation took 2271 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 645/663 places, 1023/1056 transitions.
Finished structural reductions, in 2 iterations. Remains : 645/663 places, 1023/1056 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, p0, p2, (AND p0 p2)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s133 1), p2:(AND (GEQ s192 1) (GEQ s193 1)), p1:(LT s577 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 587 ms.
Product exploration explored 100000 steps with 50000 reset in 527 ms.
Computed a total of 62 stabilizing places and 81 stable transitions
Computed a total of 62 stabilizing places and 81 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), true, (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 7 factoid took 194 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA CANConstruction-PT-020-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-020-LTLFireability-09 finished in 4061 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1056/1056 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 648 transition count 1026
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 648 transition count 1026
Applied a total of 30 rules in 29 ms. Remains 648 /663 variables (removed 15) and now considering 1026/1056 (removed 30) transitions.
// Phase 1: matrix 1026 rows 648 cols
[2022-05-15 19:58:16] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-15 19:58:17] [INFO ] Implicit Places using invariants in 270 ms returned [132, 194]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 273 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/663 places, 1026/1056 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 644 transition count 1024
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 644 transition count 1024
Applied a total of 4 rules in 26 ms. Remains 644 /646 variables (removed 2) and now considering 1024/1026 (removed 2) transitions.
// Phase 1: matrix 1024 rows 644 cols
[2022-05-15 19:58:17] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-15 19:58:17] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 1024 rows 644 cols
[2022-05-15 19:58:17] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-15 19:58:17] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-05-15 19:58:19] [INFO ] Implicit Places using invariants and state equation in 1926 ms returned []
Implicit Place search using SMT with State Equation took 2191 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 644/663 places, 1024/1056 transitions.
Finished structural reductions, in 2 iterations. Remains : 644/663 places, 1024/1056 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s313 1), p1:(GEQ s462 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 373 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-10 finished in 2659 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(X(G(p0)))))&&X(p1)&&F(p2)))'
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1056/1056 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 648 transition count 1026
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 648 transition count 1026
Applied a total of 30 rules in 33 ms. Remains 648 /663 variables (removed 15) and now considering 1026/1056 (removed 30) transitions.
// Phase 1: matrix 1026 rows 648 cols
[2022-05-15 19:58:19] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-15 19:58:19] [INFO ] Implicit Places using invariants in 273 ms returned [132, 194]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 275 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/663 places, 1026/1056 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 644 transition count 1024
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 644 transition count 1024
Applied a total of 4 rules in 26 ms. Remains 644 /646 variables (removed 2) and now considering 1024/1026 (removed 2) transitions.
// Phase 1: matrix 1024 rows 644 cols
[2022-05-15 19:58:19] [INFO ] Computed 21 place invariants in 6 ms
[2022-05-15 19:58:20] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 1024 rows 644 cols
[2022-05-15 19:58:20] [INFO ] Computed 21 place invariants in 7 ms
[2022-05-15 19:58:20] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-05-15 19:58:22] [INFO ] Implicit Places using invariants and state equation in 1957 ms returned []
Implicit Place search using SMT with State Equation took 2228 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 644/663 places, 1024/1056 transitions.
Finished structural reductions, in 2 iterations. Remains : 644/663 places, 1024/1056 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s587 1), p1:(AND (GEQ s126 1) (GEQ s167 1)), p0:(GEQ s353 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 346 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-11 finished in 2794 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(X(F(p1))))))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1056/1056 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 647 transition count 1024
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 647 transition count 1024
Applied a total of 32 rules in 31 ms. Remains 647 /663 variables (removed 16) and now considering 1024/1056 (removed 32) transitions.
// Phase 1: matrix 1024 rows 647 cols
[2022-05-15 19:58:22] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-15 19:58:22] [INFO ] Implicit Places using invariants in 296 ms returned [132, 194]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 298 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 645/663 places, 1024/1056 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 643 transition count 1022
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 643 transition count 1022
Applied a total of 4 rules in 27 ms. Remains 643 /645 variables (removed 2) and now considering 1022/1024 (removed 2) transitions.
// Phase 1: matrix 1022 rows 643 cols
[2022-05-15 19:58:22] [INFO ] Computed 21 place invariants in 6 ms
[2022-05-15 19:58:22] [INFO ] Implicit Places using invariants in 267 ms returned []
// Phase 1: matrix 1022 rows 643 cols
[2022-05-15 19:58:22] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-15 19:58:23] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-05-15 19:58:24] [INFO ] Implicit Places using invariants and state equation in 1942 ms returned []
Implicit Place search using SMT with State Equation took 2212 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 643/663 places, 1022/1056 transitions.
Finished structural reductions, in 2 iterations. Remains : 643/663 places, 1022/1056 transitions.
Stuttering acceptance computed with spot in 860 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s198 1) (GEQ s563 1)), p1:(GEQ s557 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 418 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-13 finished in 3452 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(F(p0))||X((p1 U p2)))))'
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1056/1056 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 648 transition count 1026
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 648 transition count 1026
Applied a total of 30 rules in 29 ms. Remains 648 /663 variables (removed 15) and now considering 1026/1056 (removed 30) transitions.
// Phase 1: matrix 1026 rows 648 cols
[2022-05-15 19:58:25] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-15 19:58:26] [INFO ] Implicit Places using invariants in 267 ms returned [132, 194]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 275 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/663 places, 1026/1056 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 644 transition count 1024
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 644 transition count 1024
Applied a total of 4 rules in 26 ms. Remains 644 /646 variables (removed 2) and now considering 1024/1026 (removed 2) transitions.
// Phase 1: matrix 1024 rows 644 cols
[2022-05-15 19:58:26] [INFO ] Computed 21 place invariants in 7 ms
[2022-05-15 19:58:26] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 1024 rows 644 cols
[2022-05-15 19:58:26] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-15 19:58:26] [INFO ] State equation strengthened by 780 read => feed constraints.
[2022-05-15 19:58:28] [INFO ] Implicit Places using invariants and state equation in 2035 ms returned []
Implicit Place search using SMT with State Equation took 2309 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 644/663 places, 1024/1056 transitions.
Finished structural reductions, in 2 iterations. Remains : 644/663 places, 1024/1056 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s366 1), p2:(AND (GEQ s642 1) (GEQ s23 1) (GEQ s102 1)), p1:(AND (GEQ s23 1) (GEQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 490 ms.
Product exploration explored 100000 steps with 50000 reset in 501 ms.
Computed a total of 61 stabilizing places and 80 stable transitions
Computed a total of 61 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA CANConstruction-PT-020-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-020-LTLFireability-14 finished in 3974 ms.
All properties solved by simple procedures.
Total runtime 46960 ms.

BK_STOP 1652644709821

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="CANConstruction-PT-020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918600500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-020.tgz
mv CANConstruction-PT-020 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;