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-165251918600524.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-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918600524
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 12K Apr 29 12:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 29 12:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 29 12:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 12:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K 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 4.0K 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 3.8M 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-050-LTLFireability-00
FORMULA_NAME CANConstruction-PT-050-LTLFireability-01
FORMULA_NAME CANConstruction-PT-050-LTLFireability-02
FORMULA_NAME CANConstruction-PT-050-LTLFireability-03
FORMULA_NAME CANConstruction-PT-050-LTLFireability-04
FORMULA_NAME CANConstruction-PT-050-LTLFireability-05
FORMULA_NAME CANConstruction-PT-050-LTLFireability-06
FORMULA_NAME CANConstruction-PT-050-LTLFireability-07
FORMULA_NAME CANConstruction-PT-050-LTLFireability-08
FORMULA_NAME CANConstruction-PT-050-LTLFireability-09
FORMULA_NAME CANConstruction-PT-050-LTLFireability-10
FORMULA_NAME CANConstruction-PT-050-LTLFireability-11
FORMULA_NAME CANConstruction-PT-050-LTLFireability-12
FORMULA_NAME CANConstruction-PT-050-LTLFireability-13
FORMULA_NAME CANConstruction-PT-050-LTLFireability-14
FORMULA_NAME CANConstruction-PT-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652649637763

Running Version 202205111006
[2022-05-15 21:20:38] [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 21:20:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 21:20:39] [INFO ] Load time of PNML (sax parser for PT used): 365 ms
[2022-05-15 21:20:39] [INFO ] Transformed 5602 places.
[2022-05-15 21:20:39] [INFO ] Transformed 10400 transitions.
[2022-05-15 21:20:39] [INFO ] Parsed PT model containing 5602 places and 10400 transitions in 513 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-050-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 5602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Discarding 2386 places :
Symmetric choice reduction at 0 with 2386 rule applications. Total rules 2386 place count 3216 transition count 5628
Iterating global reduction 0 with 2386 rules applied. Total rules applied 4772 place count 3216 transition count 5628
Applied a total of 4772 rules in 1316 ms. Remains 3216 /5602 variables (removed 2386) and now considering 5628/10400 (removed 4772) transitions.
// Phase 1: matrix 5628 rows 3216 cols
[2022-05-15 21:20:41] [INFO ] Computed 101 place invariants in 95 ms
[2022-05-15 21:20:43] [INFO ] Implicit Places using invariants in 3004 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558, 572, 586, 600, 614, 628, 642, 656, 670, 684, 698]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 3054 ms to find 50 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3166/5602 places, 5628/10400 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 3116 transition count 5578
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 3116 transition count 5578
Applied a total of 100 rules in 479 ms. Remains 3116 /3166 variables (removed 50) and now considering 5578/5628 (removed 50) transitions.
// Phase 1: matrix 5578 rows 3116 cols
[2022-05-15 21:20:44] [INFO ] Computed 51 place invariants in 33 ms
[2022-05-15 21:20:46] [INFO ] Implicit Places using invariants in 1974 ms returned []
// Phase 1: matrix 5578 rows 3116 cols
[2022-05-15 21:20:46] [INFO ] Computed 51 place invariants in 36 ms
[2022-05-15 21:20:47] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:21:02] [INFO ] Implicit Places using invariants and state equation in 16481 ms returned []
Implicit Place search using SMT with State Equation took 18457 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3116/5602 places, 5578/10400 transitions.
Finished structural reductions, in 2 iterations. Remains : 3116/5602 places, 5578/10400 transitions.
Support contains 34 out of 3116 places after structural reductions.
[2022-05-15 21:21:03] [INFO ] Flatten gal took : 328 ms
[2022-05-15 21:21:03] [INFO ] Flatten gal took : 178 ms
[2022-05-15 21:21:04] [INFO ] Input system was already deterministic with 5578 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 26) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 5578 rows 3116 cols
[2022-05-15 21:21:05] [INFO ] Computed 51 place invariants in 76 ms
[2022-05-15 21:21:06] [INFO ] [Real]Absence check using 51 positive place invariants in 67 ms returned sat
[2022-05-15 21:21:09] [INFO ] After 2679ms SMT Verify possible using state equation in real domain returned unsat :1 sat :4 real:8
[2022-05-15 21:21:09] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:21:10] [INFO ] After 1106ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :1 sat :0 real:12
[2022-05-15 21:21:10] [INFO ] After 5606ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2022-05-15 21:21:11] [INFO ] [Nat]Absence check using 51 positive place invariants in 58 ms returned sat
[2022-05-15 21:21:15] [INFO ] After 3387ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2022-05-15 21:21:18] [INFO ] After 3055ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :1 sat :12
[2022-05-15 21:21:22] [INFO ] After 6921ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 2330 ms.
[2022-05-15 21:21:24] [INFO ] After 14129ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
Fused 13 Parikh solutions to 8 different solutions.
Parikh walk visited 1 properties in 158 ms.
Support contains 15 out of 3116 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Drop transitions removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 338 place count 3116 transition count 5240
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 1 with 338 rules applied. Total rules applied 676 place count 2778 transition count 5240
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 676 place count 2778 transition count 5190
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 776 place count 2728 transition count 5190
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 783 place count 2721 transition count 5176
Iterating global reduction 2 with 7 rules applied. Total rules applied 790 place count 2721 transition count 5176
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 6 rules applied. Total rules applied 796 place count 2721 transition count 5170
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 802 place count 2715 transition count 5170
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 2 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 906 place count 2663 transition count 5118
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 908 place count 2663 transition count 5116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 910 place count 2661 transition count 5116
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 914 place count 2661 transition count 5116
Applied a total of 914 rules in 1488 ms. Remains 2661 /3116 variables (removed 455) and now considering 5116/5578 (removed 462) transitions.
Finished structural reductions, in 1 iterations. Remains : 2661/3116 places, 5116/5578 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 5116 rows 2661 cols
[2022-05-15 21:21:27] [INFO ] Computed 51 place invariants in 49 ms
[2022-05-15 21:21:27] [INFO ] [Real]Absence check using 51 positive place invariants in 47 ms returned sat
[2022-05-15 21:21:29] [INFO ] After 1853ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2022-05-15 21:21:29] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:21:30] [INFO ] After 953ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 21:21:30] [INFO ] After 3458ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 21:21:30] [INFO ] [Nat]Absence check using 51 positive place invariants in 44 ms returned sat
[2022-05-15 21:21:33] [INFO ] After 1920ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 21:21:34] [INFO ] After 1185ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-15 21:21:35] [INFO ] After 2169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 677 ms.
[2022-05-15 21:21:35] [INFO ] After 5323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 7 ms.
Support contains 3 out of 2661 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2661/2661 places, 5116/5116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2661 transition count 5115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2660 transition count 5115
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 2657 transition count 5109
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 2657 transition count 5109
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 2657 transition count 5108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10 place count 2656 transition count 5108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 11 place count 2655 transition count 5106
Iterating global reduction 4 with 1 rules applied. Total rules applied 12 place count 2655 transition count 5106
Applied a total of 12 rules in 573 ms. Remains 2655 /2661 variables (removed 6) and now considering 5106/5116 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 2655/2661 places, 5106/5116 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5106 rows 2655 cols
[2022-05-15 21:21:36] [INFO ] Computed 51 place invariants in 43 ms
[2022-05-15 21:21:37] [INFO ] [Real]Absence check using 51 positive place invariants in 52 ms returned sat
[2022-05-15 21:21:38] [INFO ] After 1676ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-15 21:21:38] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:21:39] [INFO ] After 705ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 21:21:39] [INFO ] After 2860ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 21:21:40] [INFO ] [Nat]Absence check using 51 positive place invariants in 55 ms returned sat
[2022-05-15 21:21:41] [INFO ] After 1685ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 21:21:42] [INFO ] After 776ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 21:21:43] [INFO ] After 1253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 322 ms.
[2022-05-15 21:21:43] [INFO ] After 3760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 19 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 2 properties in 2 ms.
FORMULA CANConstruction-PT-050-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 151 stabilizing places and 200 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(((p1 U p2)&&p0)))))'
Support contains 4 out of 3116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Drop transitions removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 338 place count 3116 transition count 5240
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 1 with 338 rules applied. Total rules applied 676 place count 2778 transition count 5240
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 676 place count 2778 transition count 5190
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 776 place count 2728 transition count 5190
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 788 place count 2716 transition count 5166
Iterating global reduction 2 with 12 rules applied. Total rules applied 800 place count 2716 transition count 5166
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 810 place count 2716 transition count 5156
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 820 place count 2706 transition count 5156
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 922 place count 2655 transition count 5105
Applied a total of 922 rules in 771 ms. Remains 2655 /3116 variables (removed 461) and now considering 5105/5578 (removed 473) transitions.
// Phase 1: matrix 5105 rows 2655 cols
[2022-05-15 21:21:44] [INFO ] Computed 51 place invariants in 48 ms
[2022-05-15 21:21:46] [INFO ] Implicit Places using invariants in 1678 ms returned []
// Phase 1: matrix 5105 rows 2655 cols
[2022-05-15 21:21:46] [INFO ] Computed 51 place invariants in 41 ms
[2022-05-15 21:21:47] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:21:57] [INFO ] Implicit Places using invariants and state equation in 11358 ms returned []
Implicit Place search using SMT with State Equation took 13039 ms to find 0 implicit places.
[2022-05-15 21:21:57] [INFO ] Redundant transitions in 357 ms returned []
// Phase 1: matrix 5105 rows 2655 cols
[2022-05-15 21:21:57] [INFO ] Computed 51 place invariants in 37 ms
[2022-05-15 21:22:00] [INFO ] Dead Transitions using invariants and state equation in 2191 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2655/3116 places, 5105/5578 transitions.
Finished structural reductions, in 1 iterations. Remains : 2655/3116 places, 5105/5578 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s530 1) (OR (LT s76 1) (LT s1846 1))), p2:(GEQ s530 1), p1:(OR (AND (GEQ s76 1) (GEQ s1846 1)) (LT s1759 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 405 steps with 0 reset in 19 ms.
FORMULA CANConstruction-PT-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-00 finished in 16716 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(F(p0)))&&p1))))'
Support contains 3 out of 3116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 337 place count 3116 transition count 5241
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 1 with 337 rules applied. Total rules applied 674 place count 2779 transition count 5241
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 674 place count 2779 transition count 5191
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 774 place count 2729 transition count 5191
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 787 place count 2716 transition count 5165
Iterating global reduction 2 with 13 rules applied. Total rules applied 800 place count 2716 transition count 5165
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 811 place count 2716 transition count 5154
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 822 place count 2705 transition count 5154
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 4 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 922 place count 2655 transition count 5104
Applied a total of 922 rules in 673 ms. Remains 2655 /3116 variables (removed 461) and now considering 5104/5578 (removed 474) transitions.
// Phase 1: matrix 5104 rows 2655 cols
[2022-05-15 21:22:01] [INFO ] Computed 51 place invariants in 50 ms
[2022-05-15 21:22:02] [INFO ] Implicit Places using invariants in 1654 ms returned []
// Phase 1: matrix 5104 rows 2655 cols
[2022-05-15 21:22:02] [INFO ] Computed 51 place invariants in 45 ms
[2022-05-15 21:22:03] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:22:15] [INFO ] Implicit Places using invariants and state equation in 12665 ms returned []
Implicit Place search using SMT with State Equation took 14322 ms to find 0 implicit places.
[2022-05-15 21:22:15] [INFO ] Redundant transitions in 334 ms returned []
// Phase 1: matrix 5104 rows 2655 cols
[2022-05-15 21:22:15] [INFO ] Computed 51 place invariants in 50 ms
[2022-05-15 21:22:17] [INFO ] Dead Transitions using invariants and state equation in 2198 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2655/3116 places, 5104/5578 transitions.
Finished structural reductions, in 1 iterations. Remains : 2655/3116 places, 5104/5578 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s1162 1), p0:(AND (GEQ s40 1) (GEQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 343 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-01 finished in 17678 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(F((false U p0)))))||G(p1)))'
Support contains 2 out of 3116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3103 transition count 5552
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3103 transition count 5552
Applied a total of 26 rules in 419 ms. Remains 3103 /3116 variables (removed 13) and now considering 5552/5578 (removed 26) transitions.
// Phase 1: matrix 5552 rows 3103 cols
[2022-05-15 21:22:18] [INFO ] Computed 51 place invariants in 36 ms
[2022-05-15 21:22:20] [INFO ] Implicit Places using invariants in 1940 ms returned []
// Phase 1: matrix 5552 rows 3103 cols
[2022-05-15 21:22:20] [INFO ] Computed 51 place invariants in 28 ms
[2022-05-15 21:22:21] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:22:35] [INFO ] Implicit Places using invariants and state equation in 14724 ms returned []
Implicit Place search using SMT with State Equation took 16667 ms to find 0 implicit places.
// Phase 1: matrix 5552 rows 3103 cols
[2022-05-15 21:22:35] [INFO ] Computed 51 place invariants in 29 ms
[2022-05-15 21:22:38] [INFO ] Dead Transitions using invariants and state equation in 2988 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3103/3116 places, 5552/5578 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3116 places, 5552/5578 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GEQ s207 1), p1:(LT s2517 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, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 11773 steps with 12 reset in 105 ms.
FORMULA CANConstruction-PT-050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-02 finished in 20400 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!X(F(X(p0))) U G(p0))))'
Support contains 1 out of 3116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Drop transitions removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 338 place count 3116 transition count 5240
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 1 with 338 rules applied. Total rules applied 676 place count 2778 transition count 5240
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 676 place count 2778 transition count 5190
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 776 place count 2728 transition count 5190
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 789 place count 2715 transition count 5164
Iterating global reduction 2 with 13 rules applied. Total rules applied 802 place count 2715 transition count 5164
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 813 place count 2715 transition count 5153
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 824 place count 2704 transition count 5153
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 926 place count 2653 transition count 5102
Applied a total of 926 rules in 717 ms. Remains 2653 /3116 variables (removed 463) and now considering 5102/5578 (removed 476) transitions.
// Phase 1: matrix 5102 rows 2653 cols
[2022-05-15 21:22:39] [INFO ] Computed 51 place invariants in 36 ms
[2022-05-15 21:22:40] [INFO ] Implicit Places using invariants in 1650 ms returned []
// Phase 1: matrix 5102 rows 2653 cols
[2022-05-15 21:22:40] [INFO ] Computed 51 place invariants in 38 ms
[2022-05-15 21:22:41] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:22:52] [INFO ] Implicit Places using invariants and state equation in 11996 ms returned []
Implicit Place search using SMT with State Equation took 13649 ms to find 0 implicit places.
[2022-05-15 21:22:53] [INFO ] Redundant transitions in 197 ms returned []
// Phase 1: matrix 5102 rows 2653 cols
[2022-05-15 21:22:53] [INFO ] Computed 51 place invariants in 49 ms
[2022-05-15 21:22:55] [INFO ] Dead Transitions using invariants and state equation in 2324 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2653/3116 places, 5102/5578 transitions.
Finished structural reductions, in 1 iterations. Remains : 2653/3116 places, 5102/5578 transitions.
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s360 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-03 finished in 16975 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(F(G(G(X(F(p0))))))))&&F(G(p1))))'
Support contains 3 out of 3116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 337 place count 3116 transition count 5241
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 1 with 337 rules applied. Total rules applied 674 place count 2779 transition count 5241
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 674 place count 2779 transition count 5191
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 774 place count 2729 transition count 5191
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 787 place count 2716 transition count 5165
Iterating global reduction 2 with 13 rules applied. Total rules applied 800 place count 2716 transition count 5165
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 811 place count 2716 transition count 5154
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 822 place count 2705 transition count 5154
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 922 place count 2655 transition count 5104
Applied a total of 922 rules in 697 ms. Remains 2655 /3116 variables (removed 461) and now considering 5104/5578 (removed 474) transitions.
// Phase 1: matrix 5104 rows 2655 cols
[2022-05-15 21:22:56] [INFO ] Computed 51 place invariants in 47 ms
[2022-05-15 21:22:57] [INFO ] Implicit Places using invariants in 1670 ms returned []
// Phase 1: matrix 5104 rows 2655 cols
[2022-05-15 21:22:57] [INFO ] Computed 51 place invariants in 40 ms
[2022-05-15 21:22:58] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:23:10] [INFO ] Implicit Places using invariants and state equation in 12268 ms returned []
Implicit Place search using SMT with State Equation took 13964 ms to find 0 implicit places.
[2022-05-15 21:23:10] [INFO ] Redundant transitions in 190 ms returned []
// Phase 1: matrix 5104 rows 2655 cols
[2022-05-15 21:23:10] [INFO ] Computed 51 place invariants in 45 ms
[2022-05-15 21:23:12] [INFO ] Dead Transitions using invariants and state equation in 2496 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2655/3116 places, 5104/5578 transitions.
Finished structural reductions, in 1 iterations. Remains : 2655/3116 places, 5104/5578 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-050-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:(OR (LT s50 1) (LT s104 1)), p1:(GEQ s2148 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 331 steps with 0 reset in 7 ms.
FORMULA CANConstruction-PT-050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-04 finished in 17521 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(X(F(p0)))&&p1))))'
Support contains 2 out of 3116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3104 transition count 5554
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3104 transition count 5554
Applied a total of 24 rules in 407 ms. Remains 3104 /3116 variables (removed 12) and now considering 5554/5578 (removed 24) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:23:13] [INFO ] Computed 51 place invariants in 40 ms
[2022-05-15 21:23:15] [INFO ] Implicit Places using invariants in 1903 ms returned []
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:23:15] [INFO ] Computed 51 place invariants in 32 ms
[2022-05-15 21:23:16] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:23:30] [INFO ] Implicit Places using invariants and state equation in 14969 ms returned []
Implicit Place search using SMT with State Equation took 16875 ms to find 0 implicit places.
// Phase 1: matrix 5554 rows 3104 cols
[2022-05-15 21:23:30] [INFO ] Computed 51 place invariants in 56 ms
[2022-05-15 21:23:33] [INFO ] Dead Transitions using invariants and state equation in 3191 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3104/3116 places, 5554/5578 transitions.
Finished structural reductions, in 1 iterations. Remains : 3104/3116 places, 5554/5578 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LT s2505 1), p0:(GEQ s856 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 967 steps with 0 reset in 11 ms.
FORMULA CANConstruction-PT-050-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-05 finished in 20729 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Drop transitions removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 338 place count 3116 transition count 5240
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 1 with 338 rules applied. Total rules applied 676 place count 2778 transition count 5240
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 676 place count 2778 transition count 5190
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 776 place count 2728 transition count 5190
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 789 place count 2715 transition count 5164
Iterating global reduction 2 with 13 rules applied. Total rules applied 802 place count 2715 transition count 5164
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 813 place count 2715 transition count 5153
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 824 place count 2704 transition count 5153
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 926 place count 2653 transition count 5102
Applied a total of 926 rules in 658 ms. Remains 2653 /3116 variables (removed 463) and now considering 5102/5578 (removed 476) transitions.
// Phase 1: matrix 5102 rows 2653 cols
[2022-05-15 21:23:34] [INFO ] Computed 51 place invariants in 45 ms
[2022-05-15 21:23:36] [INFO ] Implicit Places using invariants in 1767 ms returned []
// Phase 1: matrix 5102 rows 2653 cols
[2022-05-15 21:23:36] [INFO ] Computed 51 place invariants in 39 ms
[2022-05-15 21:23:36] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:23:48] [INFO ] Implicit Places using invariants and state equation in 12851 ms returned []
Implicit Place search using SMT with State Equation took 14629 ms to find 0 implicit places.
[2022-05-15 21:23:49] [INFO ] Redundant transitions in 195 ms returned []
// Phase 1: matrix 5102 rows 2653 cols
[2022-05-15 21:23:49] [INFO ] Computed 51 place invariants in 42 ms
[2022-05-15 21:23:51] [INFO ] Dead Transitions using invariants and state equation in 2264 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2653/3116 places, 5102/5578 transitions.
Finished structural reductions, in 1 iterations. Remains : 2653/3116 places, 5102/5578 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s759 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 365 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-08 finished in 17838 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(p0))))'
Support contains 1 out of 3116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Drop transitions removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 338 place count 3116 transition count 5240
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 1 with 338 rules applied. Total rules applied 676 place count 2778 transition count 5240
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 676 place count 2778 transition count 5190
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 776 place count 2728 transition count 5190
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 789 place count 2715 transition count 5164
Iterating global reduction 2 with 13 rules applied. Total rules applied 802 place count 2715 transition count 5164
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 813 place count 2715 transition count 5153
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 824 place count 2704 transition count 5153
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 926 place count 2653 transition count 5102
Applied a total of 926 rules in 651 ms. Remains 2653 /3116 variables (removed 463) and now considering 5102/5578 (removed 476) transitions.
// Phase 1: matrix 5102 rows 2653 cols
[2022-05-15 21:23:52] [INFO ] Computed 51 place invariants in 42 ms
[2022-05-15 21:23:53] [INFO ] Implicit Places using invariants in 1648 ms returned []
// Phase 1: matrix 5102 rows 2653 cols
[2022-05-15 21:23:53] [INFO ] Computed 51 place invariants in 37 ms
[2022-05-15 21:23:54] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:24:05] [INFO ] Implicit Places using invariants and state equation in 11961 ms returned []
Implicit Place search using SMT with State Equation took 13611 ms to find 0 implicit places.
[2022-05-15 21:24:05] [INFO ] Redundant transitions in 195 ms returned []
// Phase 1: matrix 5102 rows 2653 cols
[2022-05-15 21:24:06] [INFO ] Computed 51 place invariants in 42 ms
[2022-05-15 21:24:08] [INFO ] Dead Transitions using invariants and state equation in 2283 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2653/3116 places, 5102/5578 transitions.
Finished structural reductions, in 1 iterations. Remains : 2653/3116 places, 5102/5578 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1965 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 350 steps with 0 reset in 7 ms.
FORMULA CANConstruction-PT-050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-09 finished in 16814 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(X(p0)) U (G(X(!p1)) U p2)))'
Support contains 6 out of 3116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3102 transition count 5550
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3102 transition count 5550
Applied a total of 28 rules in 410 ms. Remains 3102 /3116 variables (removed 14) and now considering 5550/5578 (removed 28) transitions.
// Phase 1: matrix 5550 rows 3102 cols
[2022-05-15 21:24:08] [INFO ] Computed 51 place invariants in 46 ms
[2022-05-15 21:24:10] [INFO ] Implicit Places using invariants in 1887 ms returned []
// Phase 1: matrix 5550 rows 3102 cols
[2022-05-15 21:24:10] [INFO ] Computed 51 place invariants in 30 ms
[2022-05-15 21:24:11] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:24:28] [INFO ] Implicit Places using invariants and state equation in 17755 ms returned []
Implicit Place search using SMT with State Equation took 19646 ms to find 0 implicit places.
// Phase 1: matrix 5550 rows 3102 cols
[2022-05-15 21:24:28] [INFO ] Computed 51 place invariants in 45 ms
[2022-05-15 21:24:31] [INFO ] Dead Transitions using invariants and state equation in 3163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3102/3116 places, 5550/5578 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3116 places, 5550/5578 transitions.
Stuttering acceptance computed with spot in 327 ms :[(NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), p0, (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p1 p0), true, p1, (OR (NOT p2) p1)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 7}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s402 1) (GEQ s1125 1)), p1:(AND (GEQ s258 1) (GEQ s539 1)), p0:(AND (GEQ s546 1) (GEQ s1039 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24996 reset in 1298 ms.
Product exploration explored 100000 steps with 24952 reset in 1296 ms.
Computed a total of 151 stabilizing places and 200 stable transitions
Computed a total of 151 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 805 ms. Reduced automaton from 8 states, 17 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 311 ms :[(NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), p0, (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p1 p0), true, p1, (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 11 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5550 rows 3102 cols
[2022-05-15 21:24:35] [INFO ] Computed 51 place invariants in 27 ms
[2022-05-15 21:24:36] [INFO ] [Real]Absence check using 51 positive place invariants in 57 ms returned sat
[2022-05-15 21:24:38] [INFO ] After 1896ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-15 21:24:38] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:24:38] [INFO ] After 542ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 21:24:38] [INFO ] After 2948ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 21:24:39] [INFO ] [Nat]Absence check using 51 positive place invariants in 53 ms returned sat
[2022-05-15 21:24:41] [INFO ] After 2029ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 21:24:42] [INFO ] After 877ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 21:24:42] [INFO ] After 1464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 374 ms.
[2022-05-15 21:24:43] [INFO ] After 4400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 6 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3102/3102 places, 5550/5550 transitions.
Drop transitions removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 349 rules applied. Total rules applied 349 place count 3102 transition count 5201
Reduce places removed 349 places and 0 transitions.
Iterating post reduction 1 with 349 rules applied. Total rules applied 698 place count 2753 transition count 5201
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 698 place count 2753 transition count 5151
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 798 place count 2703 transition count 5151
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 892 place count 2656 transition count 5104
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 895 place count 2656 transition count 5101
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 898 place count 2653 transition count 5101
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 899 place count 2653 transition count 5101
Applied a total of 899 rules in 877 ms. Remains 2653 /3102 variables (removed 449) and now considering 5101/5550 (removed 449) transitions.
Finished structural reductions, in 1 iterations. Remains : 2653/3102 places, 5101/5550 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 69545 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69545 steps, saw 25928 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5101 rows 2653 cols
[2022-05-15 21:24:47] [INFO ] Computed 51 place invariants in 43 ms
[2022-05-15 21:24:47] [INFO ] [Real]Absence check using 51 positive place invariants in 56 ms returned sat
[2022-05-15 21:24:49] [INFO ] After 1647ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-15 21:24:49] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:24:50] [INFO ] After 584ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 21:24:50] [INFO ] After 2693ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 21:24:50] [INFO ] [Nat]Absence check using 51 positive place invariants in 53 ms returned sat
[2022-05-15 21:24:52] [INFO ] After 1714ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 21:24:53] [INFO ] After 805ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 21:24:53] [INFO ] After 1341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 390 ms.
[2022-05-15 21:24:54] [INFO ] After 3910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 2653 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2653/2653 places, 5101/5101 transitions.
Applied a total of 0 rules in 212 ms. Remains 2653 /2653 variables (removed 0) and now considering 5101/5101 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2653/2653 places, 5101/5101 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2653/2653 places, 5101/5101 transitions.
Applied a total of 0 rules in 213 ms. Remains 2653 /2653 variables (removed 0) and now considering 5101/5101 (removed 0) transitions.
// Phase 1: matrix 5101 rows 2653 cols
[2022-05-15 21:24:54] [INFO ] Computed 51 place invariants in 47 ms
[2022-05-15 21:24:56] [INFO ] Implicit Places using invariants in 1661 ms returned []
// Phase 1: matrix 5101 rows 2653 cols
[2022-05-15 21:24:56] [INFO ] Computed 51 place invariants in 37 ms
[2022-05-15 21:24:57] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:25:08] [INFO ] Implicit Places using invariants and state equation in 11829 ms returned []
Implicit Place search using SMT with State Equation took 13497 ms to find 0 implicit places.
[2022-05-15 21:25:08] [INFO ] Redundant transitions in 202 ms returned []
// Phase 1: matrix 5101 rows 2653 cols
[2022-05-15 21:25:08] [INFO ] Computed 51 place invariants in 40 ms
[2022-05-15 21:25:10] [INFO ] Dead Transitions using invariants and state equation in 2240 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2653/2653 places, 5101/5101 transitions.
Graph (trivial) has 4946 edges and 2653 vertex of which 2497 / 2653 are part of one of the 49 SCC in 3 ms
Free SCC test removed 2448 places
Drop transitions removed 4847 transitions
Reduce isomorphic transitions removed 4847 transitions.
Graph (complete) has 405 edges and 205 vertex of which 69 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.0 ms
Discarding 136 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 69 transition count 67
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 198 place count 20 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 198 place count 20 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 place count 19 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 201 place count 18 transition count 17
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 18 transition count 17
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 205 place count 18 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 208 place count 15 transition count 14
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 210 place count 15 transition count 14
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 212 place count 13 transition count 12
Iterating global reduction 3 with 2 rules applied. Total rules applied 214 place count 13 transition count 12
Applied a total of 214 rules in 20 ms. Remains 13 /2653 variables (removed 2640) and now considering 12/5101 (removed 5089) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 13 cols
[2022-05-15 21:25:10] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 21:25:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 21:25:10] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-15 21:25:10] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-15 21:25:10] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2022-05-15 21:25:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 21:25:10] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 21:25:10] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-15 21:25:10] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-15 21:25:10] [INFO ] Flatten gal took : 1 ms
[2022-05-15 21:25:10] [INFO ] Flatten gal took : 0 ms
[2022-05-15 21:25:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15237899248129059321.gal : 1 ms
[2022-05-15 21:25:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17548664136787307278.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3534970095207551571;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15237899248129059321.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17548664136787307278.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality17548664136787307278.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,120,0.019655,3804,2,30,6,146,8,0,62,87,0
Total reachable state count : 120

Verifying 2 reachability properties.
Reachability property apf5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf5,8,0.019943,3804,2,16,6,146,8,0,69,87,0
Reachability property apf6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf6,6,0.020348,3804,2,22,7,146,8,0,76,87,0
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (AND p2 (NOT p1))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F (AND p0 (NOT p1))), (F (AND (NOT p2) p0 (NOT p1)))]
Knowledge based reduction with 14 factoid took 882 ms. Reduced automaton from 8 states, 17 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 317 ms :[(NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), p0, (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p1 p0), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 284 ms :[(NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), p0, (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p1 p0), true, p1, (OR (NOT p2) p1)]
// Phase 1: matrix 5550 rows 3102 cols
[2022-05-15 21:25:12] [INFO ] Computed 51 place invariants in 48 ms
[2022-05-15 21:25:20] [INFO ] [Real]Absence check using 51 positive place invariants in 221 ms returned sat
[2022-05-15 21:25:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:25:27] [INFO ] [Real]Absence check using state equation in 6538 ms returned unknown
Could not prove EG (NOT p2)
Support contains 6 out of 3102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3102/3102 places, 5550/5550 transitions.
Applied a total of 0 rules in 205 ms. Remains 3102 /3102 variables (removed 0) and now considering 5550/5550 (removed 0) transitions.
// Phase 1: matrix 5550 rows 3102 cols
[2022-05-15 21:25:27] [INFO ] Computed 51 place invariants in 37 ms
[2022-05-15 21:25:29] [INFO ] Implicit Places using invariants in 1736 ms returned []
// Phase 1: matrix 5550 rows 3102 cols
[2022-05-15 21:25:29] [INFO ] Computed 51 place invariants in 28 ms
[2022-05-15 21:25:30] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:25:46] [INFO ] Implicit Places using invariants and state equation in 17003 ms returned []
Implicit Place search using SMT with State Equation took 18747 ms to find 0 implicit places.
// Phase 1: matrix 5550 rows 3102 cols
[2022-05-15 21:25:46] [INFO ] Computed 51 place invariants in 32 ms
[2022-05-15 21:25:48] [INFO ] Dead Transitions using invariants and state equation in 2723 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 5550/5550 transitions.
Computed a total of 151 stabilizing places and 200 stable transitions
Computed a total of 151 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 762 ms. Reduced automaton from 8 states, 17 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 284 ms :[(NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), p0, (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p1 p0), true, p1, (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 11 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) 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 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 5550 rows 3102 cols
[2022-05-15 21:25:50] [INFO ] Computed 51 place invariants in 44 ms
[2022-05-15 21:25:51] [INFO ] [Real]Absence check using 51 positive place invariants in 55 ms returned sat
[2022-05-15 21:25:53] [INFO ] After 1812ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2022-05-15 21:25:53] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:25:53] [INFO ] After 535ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 21:25:53] [INFO ] After 3041ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 21:25:54] [INFO ] [Nat]Absence check using 51 positive place invariants in 53 ms returned sat
[2022-05-15 21:25:56] [INFO ] After 2285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 21:25:57] [INFO ] After 1134ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-15 21:25:58] [INFO ] After 2270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 732 ms.
[2022-05-15 21:25:59] [INFO ] After 6021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 2 properties in 21 ms.
Support contains 6 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3102/3102 places, 5550/5550 transitions.
Drop transitions removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 349 rules applied. Total rules applied 349 place count 3102 transition count 5201
Reduce places removed 349 places and 0 transitions.
Iterating post reduction 1 with 349 rules applied. Total rules applied 698 place count 2753 transition count 5201
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 698 place count 2753 transition count 5151
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 798 place count 2703 transition count 5151
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 892 place count 2656 transition count 5104
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 895 place count 2656 transition count 5101
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 898 place count 2653 transition count 5101
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 899 place count 2653 transition count 5101
Applied a total of 899 rules in 1032 ms. Remains 2653 /3102 variables (removed 449) and now considering 5101/5550 (removed 449) transitions.
Finished structural reductions, in 1 iterations. Remains : 2653/3102 places, 5101/5550 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 5101 rows 2653 cols
[2022-05-15 21:26:01] [INFO ] Computed 51 place invariants in 35 ms
[2022-05-15 21:26:01] [INFO ] [Real]Absence check using 51 positive place invariants in 52 ms returned sat
[2022-05-15 21:26:02] [INFO ] After 1523ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 21:26:02] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:26:03] [INFO ] After 527ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:26:03] [INFO ] After 2498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:26:03] [INFO ] [Nat]Absence check using 51 positive place invariants in 48 ms returned sat
[2022-05-15 21:26:05] [INFO ] After 1528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 21:26:06] [INFO ] After 662ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 21:26:06] [INFO ] After 899ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 238 ms.
[2022-05-15 21:26:06] [INFO ] After 3024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 2653 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2653/2653 places, 5101/5101 transitions.
Applied a total of 0 rules in 210 ms. Remains 2653 /2653 variables (removed 0) and now considering 5101/5101 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2653/2653 places, 5101/5101 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Finished Best-First random walk after 8984 steps, including 2 resets, run visited all 1 properties in 12 ms. (steps per millisecond=748 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (AND p2 (NOT p1))), (F (AND p2 p0 (NOT p1))), (F (AND p0 p1)), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F (AND p0 (NOT p1))), (F (AND (NOT p2) p0 (NOT p1)))]
Knowledge based reduction with 14 factoid took 850 ms. Reduced automaton from 8 states, 17 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 351 ms :[(NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), p0, (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p1 p0), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 249 ms :[(NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), p0, (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p1 p0), true, p1, (OR (NOT p2) p1)]
// Phase 1: matrix 5550 rows 3102 cols
[2022-05-15 21:26:08] [INFO ] Computed 51 place invariants in 36 ms
[2022-05-15 21:26:16] [INFO ] [Real]Absence check using 51 positive place invariants in 188 ms returned sat
[2022-05-15 21:26:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:26:23] [INFO ] [Real]Absence check using state equation in 7060 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 307 ms :[(NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), p0, (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p1 p0), true, p1, (OR (NOT p2) p1)]
Product exploration explored 100000 steps with 24953 reset in 1179 ms.
Product exploration explored 100000 steps with 25026 reset in 1167 ms.
Applying partial POR strategy [false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 285 ms :[(NOT p2), (OR (AND p0 (NOT p2)) (AND p0 p1)), p0, (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p1 p0), true, p1, (OR (NOT p2) p1)]
Support contains 6 out of 3102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3102/3102 places, 5550/5550 transitions.
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 3102 transition count 5550
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 51 Pre rules applied. Total rules applied 199 place count 3102 transition count 5550
Deduced a syphon composed of 250 places in 2 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 250 place count 3102 transition count 5550
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 350 place count 3002 transition count 5450
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 450 place count 3002 transition count 5450
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 346 places in 1 ms
Iterating global reduction 1 with 196 rules applied. Total rules applied 646 place count 3002 transition count 5450
Discarding 245 places :
Symmetric choice reduction at 1 with 245 rule applications. Total rules 891 place count 2757 transition count 5205
Deduced a syphon composed of 101 places in 2 ms
Iterating global reduction 1 with 245 rules applied. Total rules applied 1136 place count 2757 transition count 5205
Deduced a syphon composed of 101 places in 1 ms
Applied a total of 1136 rules in 1885 ms. Remains 2757 /3102 variables (removed 345) and now considering 5205/5550 (removed 345) transitions.
[2022-05-15 21:26:28] [INFO ] Redundant transitions in 227 ms returned []
// Phase 1: matrix 5205 rows 2757 cols
[2022-05-15 21:26:28] [INFO ] Computed 51 place invariants in 55 ms
[2022-05-15 21:26:31] [INFO ] Dead Transitions using invariants and state equation in 2612 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2757/3102 places, 5205/5550 transitions.
Finished structural reductions, in 1 iterations. Remains : 2757/3102 places, 5205/5550 transitions.
Product exploration explored 100000 steps with 24996 reset in 8258 ms.
Product exploration explored 100000 steps with 25096 reset in 8196 ms.
Built C files in :
/tmp/ltsmin17493867191279577985
[2022-05-15 21:26:47] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17493867191279577985
Running compilation step : cd /tmp/ltsmin17493867191279577985;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17493867191279577985;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17493867191279577985;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6 out of 3102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3102/3102 places, 5550/5550 transitions.
Applied a total of 0 rules in 214 ms. Remains 3102 /3102 variables (removed 0) and now considering 5550/5550 (removed 0) transitions.
// Phase 1: matrix 5550 rows 3102 cols
[2022-05-15 21:26:51] [INFO ] Computed 51 place invariants in 34 ms
[2022-05-15 21:26:52] [INFO ] Implicit Places using invariants in 1698 ms returned []
// Phase 1: matrix 5550 rows 3102 cols
[2022-05-15 21:26:52] [INFO ] Computed 51 place invariants in 39 ms
[2022-05-15 21:26:53] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:27:10] [INFO ] Implicit Places using invariants and state equation in 17698 ms returned []
Implicit Place search using SMT with State Equation took 19399 ms to find 0 implicit places.
// Phase 1: matrix 5550 rows 3102 cols
[2022-05-15 21:27:10] [INFO ] Computed 51 place invariants in 38 ms
[2022-05-15 21:27:13] [INFO ] Dead Transitions using invariants and state equation in 3131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3102/3102 places, 5550/5550 transitions.
Built C files in :
/tmp/ltsmin9549051443371139316
[2022-05-15 21:27:13] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9549051443371139316
Running compilation step : cd /tmp/ltsmin9549051443371139316;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9549051443371139316;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9549051443371139316;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 21:27:17] [INFO ] Flatten gal took : 192 ms
[2022-05-15 21:27:17] [INFO ] Flatten gal took : 177 ms
[2022-05-15 21:27:17] [INFO ] Time to serialize gal into /tmp/LTL15708441157813674247.gal : 30 ms
[2022-05-15 21:27:17] [INFO ] Time to serialize properties into /tmp/LTL16943011286027077705.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15708441157813674247.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16943011286027077705.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1570844...268
Read 1 LTL properties
Checking formula 0 : !(((!(X(X("((Node45IsInserted>=1)&&(Node7requestsent45>=1))"))))U((G(X(!("((Node21IsInserted>=1)&&(Node44Request>=1))"))))U("((Node33I...199
Formula 0 simplified : !(!XX"((Node45IsInserted>=1)&&(Node7requestsent45>=1))" U (GX!"((Node21IsInserted>=1)&&(Node44Request>=1))" U "((Node33IsInserted>=1...185
Detected timeout of ITS tools.
[2022-05-15 21:27:32] [INFO ] Flatten gal took : 160 ms
[2022-05-15 21:27:32] [INFO ] Applying decomposition
[2022-05-15 21:27:32] [INFO ] Flatten gal took : 164 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8877575304217237579.txt' '-o' '/tmp/graph8877575304217237579.bin' '-w' '/tmp/graph8877575304217237579.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8877575304217237579.bin' '-l' '-1' '-v' '-w' '/tmp/graph8877575304217237579.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:27:33] [INFO ] Decomposing Gal with order
[2022-05-15 21:27:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:27:34] [INFO ] Removed a total of 5045 redundant transitions.
[2022-05-15 21:27:34] [INFO ] Flatten gal took : 954 ms
[2022-05-15 21:27:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 9800 labels/synchronizations in 424 ms.
[2022-05-15 21:27:35] [INFO ] Time to serialize gal into /tmp/LTL10205668629285045542.gal : 68 ms
[2022-05-15 21:27:35] [INFO ] Time to serialize properties into /tmp/LTL16912523879163142596.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10205668629285045542.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16912523879163142596.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1020566...247
Read 1 LTL properties
Checking formula 0 : !(((!(X(X("((i45.u205.Node45IsInserted>=1)&&(i7.u35.Node7requestsent45>=1))"))))U((G(X(!("((i21.u96.Node21IsInserted>=1)&&(i44.u203.No...248
Formula 0 simplified : !(!XX"((i45.u205.Node45IsInserted>=1)&&(i7.u35.Node7requestsent45>=1))" U (GX!"((i21.u96.Node21IsInserted>=1)&&(i44.u203.Node44Reque...234
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7852728476429101087
[2022-05-15 21:27:50] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7852728476429101087
Running compilation step : cd /tmp/ltsmin7852728476429101087;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7852728476429101087;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7852728476429101087;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-050-LTLFireability-10 finished in 224925 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(F(p1)&&p2))))'
Support contains 5 out of 3116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 337 place count 3116 transition count 5241
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 1 with 337 rules applied. Total rules applied 674 place count 2779 transition count 5241
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 674 place count 2779 transition count 5191
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 774 place count 2729 transition count 5191
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 787 place count 2716 transition count 5165
Iterating global reduction 2 with 13 rules applied. Total rules applied 800 place count 2716 transition count 5165
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 811 place count 2716 transition count 5154
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 822 place count 2705 transition count 5154
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 920 place count 2656 transition count 5105
Applied a total of 920 rules in 732 ms. Remains 2656 /3116 variables (removed 460) and now considering 5105/5578 (removed 473) transitions.
// Phase 1: matrix 5105 rows 2656 cols
[2022-05-15 21:27:54] [INFO ] Computed 51 place invariants in 35 ms
[2022-05-15 21:27:55] [INFO ] Implicit Places using invariants in 1806 ms returned []
// Phase 1: matrix 5105 rows 2656 cols
[2022-05-15 21:27:55] [INFO ] Computed 51 place invariants in 39 ms
[2022-05-15 21:27:56] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:28:07] [INFO ] Implicit Places using invariants and state equation in 11239 ms returned []
Implicit Place search using SMT with State Equation took 13049 ms to find 0 implicit places.
[2022-05-15 21:28:07] [INFO ] Redundant transitions in 193 ms returned []
// Phase 1: matrix 5105 rows 2656 cols
[2022-05-15 21:28:07] [INFO ] Computed 51 place invariants in 46 ms
[2022-05-15 21:28:09] [INFO ] Dead Transitions using invariants and state equation in 2383 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2656/3116 places, 5105/5578 transitions.
Finished structural reductions, in 1 iterations. Remains : 2656/3116 places, 5105/5578 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s91 1) (GEQ s148 1)), p2:(OR (LT s122 1) (LT s341 1)), p1:(GEQ s667 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 344 steps with 0 reset in 7 ms.
FORMULA CANConstruction-PT-050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-14 finished in 16481 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)||p1)))'
Support contains 2 out of 3116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3116/3116 places, 5578/5578 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 3116 transition count 5242
Reduce places removed 336 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 337 rules applied. Total rules applied 673 place count 2780 transition count 5241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 674 place count 2779 transition count 5241
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 674 place count 2779 transition count 5192
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 772 place count 2730 transition count 5192
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 785 place count 2717 transition count 5166
Iterating global reduction 3 with 13 rules applied. Total rules applied 798 place count 2717 transition count 5166
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 11 rules applied. Total rules applied 809 place count 2717 transition count 5155
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 820 place count 2706 transition count 5155
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 922 place count 2655 transition count 5104
Applied a total of 922 rules in 712 ms. Remains 2655 /3116 variables (removed 461) and now considering 5104/5578 (removed 474) transitions.
// Phase 1: matrix 5104 rows 2655 cols
[2022-05-15 21:28:10] [INFO ] Computed 51 place invariants in 42 ms
[2022-05-15 21:28:12] [INFO ] Implicit Places using invariants in 1637 ms returned []
// Phase 1: matrix 5104 rows 2655 cols
[2022-05-15 21:28:12] [INFO ] Computed 51 place invariants in 38 ms
[2022-05-15 21:28:12] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-05-15 21:28:25] [INFO ] Implicit Places using invariants and state equation in 12916 ms returned []
Implicit Place search using SMT with State Equation took 14558 ms to find 0 implicit places.
[2022-05-15 21:28:25] [INFO ] Redundant transitions in 196 ms returned []
// Phase 1: matrix 5104 rows 2655 cols
[2022-05-15 21:28:25] [INFO ] Computed 51 place invariants in 50 ms
[2022-05-15 21:28:27] [INFO ] Dead Transitions using invariants and state equation in 2259 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2655/3116 places, 5104/5578 transitions.
Finished structural reductions, in 1 iterations. Remains : 2655/3116 places, 5104/5578 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s56 1), p1:(GEQ s2449 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13571 steps with 121 reset in 184 ms.
FORMULA CANConstruction-PT-050-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-15 finished in 18000 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(X(p0)) U (G(X(!p1)) U p2)))'
[2022-05-15 21:28:28] [INFO ] Flatten gal took : 168 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9770161537378292884
[2022-05-15 21:28:28] [INFO ] Too many transitions (5578) to apply POR reductions. Disabling POR matrices.
[2022-05-15 21:28:28] [INFO ] Applying decomposition
[2022-05-15 21:28:28] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9770161537378292884
Running compilation step : cd /tmp/ltsmin9770161537378292884;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 21:28:28] [INFO ] Flatten gal took : 161 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2647651231506260200.txt' '-o' '/tmp/graph2647651231506260200.bin' '-w' '/tmp/graph2647651231506260200.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2647651231506260200.bin' '-l' '-1' '-v' '-w' '/tmp/graph2647651231506260200.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:28:28] [INFO ] Decomposing Gal with order
[2022-05-15 21:28:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:28:29] [INFO ] Removed a total of 5037 redundant transitions.
[2022-05-15 21:28:29] [INFO ] Flatten gal took : 561 ms
[2022-05-15 21:28:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 9920 labels/synchronizations in 326 ms.
[2022-05-15 21:28:30] [INFO ] Time to serialize gal into /tmp/LTLFireability17834559557731298245.gal : 123 ms
[2022-05-15 21:28:30] [INFO ] Time to serialize properties into /tmp/LTLFireability15957666562488948490.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17834559557731298245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15957666562488948490.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !(((!(X(X("((i39.i1.u177.Node45IsInserted>=1)&&(i7.u34.Node7requestsent45>=1))"))))U((G(X(!("((i21.u92.Node21IsInserted>=1)&&(i44.u198...254
Formula 0 simplified : !(!XX"((i39.i1.u177.Node45IsInserted>=1)&&(i7.u34.Node7requestsent45>=1))" U (GX!"((i21.u92.Node21IsInserted>=1)&&(i44.u198.Node44Re...240
Compilation finished in 19698 ms.
Running link step : cd /tmp/ltsmin9770161537378292884;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin9770161537378292884;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!X(X((LTLAPp0==true))) U ([](X(!(LTLAPp1==true))) U (LTLAPp2==true)))' '--buchi-type=spotba'
LTSmin run took 9978 ms.
FORMULA CANConstruction-PT-050-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 499087 ms.

BK_STOP 1652650138052

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ 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-050"
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-050, 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-165251918600524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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