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.r096-smll-165260575900180.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 GPPP-PT-C0001N0000000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575900180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 5.8K Apr 29 18:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 29 18:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 18:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 29 18:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 17 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1 May 10 09:33 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000100-LTLFireability-00
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-01
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-02
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-03
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-04
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-05
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-06
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-07
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-08
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-09
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000000100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652676443540

Running Version 202205111006
[2022-05-16 04:47:25] [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-16 04:47:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 04:47:26] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2022-05-16 04:47:26] [INFO ] Transformed 33 places.
[2022-05-16 04:47:26] [INFO ] Transformed 22 transitions.
[2022-05-16 04:47:26] [INFO ] Parsed PT model containing 33 places and 22 transitions in 345 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 20 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 04:47:26] [INFO ] Computed 13 place invariants in 12 ms
[2022-05-16 04:47:27] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 04:47:27] [INFO ] Computed 13 place invariants in 5 ms
[2022-05-16 04:47:27] [INFO ] Implicit Places using invariants in 94 ms returned [0, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 99 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Support contains 23 out of 30 places after structural reductions.
[2022-05-16 04:47:27] [INFO ] Flatten gal took : 42 ms
[2022-05-16 04:47:27] [INFO ] Flatten gal took : 15 ms
[2022-05-16 04:47:27] [INFO ] Input system was already deterministic with 22 transitions.
Finished random walk after 61 steps, including 0 resets, run visited all 20 properties in 39 ms. (steps per millisecond=1 )
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||X(F((G(p2)&&p1)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:28] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-16 04:47:28] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:28] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-16 04:47:28] [INFO ] Implicit Places using invariants in 74 ms returned [0, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/30 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 28/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s13 1), p1:(AND (GEQ s13 1) (GEQ s1 1) (GEQ s2 1)), p2:(OR (LT s4 1) (LT s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8886 reset in 543 ms.
Product exploration explored 100000 steps with 8941 reset in 389 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 408 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 28 cols
[2022-05-16 04:47:30] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-16 04:47:30] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 8 factoid took 360 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 22 rows 28 cols
[2022-05-16 04:47:31] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-16 04:47:31] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-16 04:47:31] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-16 04:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:47:31] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-16 04:47:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:47:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-16 04:47:31] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 9 ms returned sat
[2022-05-16 04:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:47:31] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-16 04:47:31] [INFO ] Computed and/alt/rep : 21/39/21 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 04:47:31] [INFO ] Added : 20 causal constraints over 4 iterations in 64 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2022-05-16 04:47:31] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 04:47:31] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
// Phase 1: matrix 22 rows 28 cols
[2022-05-16 04:47:31] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 04:47:31] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 22 rows 28 cols
[2022-05-16 04:47:31] [INFO ] Computed 8 place invariants in 5 ms
[2022-05-16 04:47:31] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2022-05-16 04:47:31] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-16 04:47:31] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
// Phase 1: matrix 22 rows 28 cols
[2022-05-16 04:47:32] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 04:47:32] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-16 04:47:32] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 4 ms returned sat
[2022-05-16 04:47:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:47:32] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-16 04:47:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:47:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 04:47:32] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 8 ms returned sat
[2022-05-16 04:47:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:47:32] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-05-16 04:47:32] [INFO ] Computed and/alt/rep : 21/39/21 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 04:47:32] [INFO ] Added : 20 causal constraints over 4 iterations in 60 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8812 reset in 329 ms.
Product exploration explored 100000 steps with 8922 reset in 263 ms.
Built C files in :
/tmp/ltsmin14367453634861116577
[2022-05-16 04:47:33] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2022-05-16 04:47:33] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 04:47:33] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2022-05-16 04:47:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 04:47:33] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2022-05-16 04:47:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 04:47:33] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14367453634861116577
Running compilation step : cd /tmp/ltsmin14367453634861116577;'/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'
Compilation finished in 328 ms.
Running link step : cd /tmp/ltsmin14367453634861116577;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14367453634861116577;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13128744923019221252.hoa' '--buchi-type=spotba'
LTSmin run took 77 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-00 finished in 5419 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(F(p0)))) U (G(!p0)||!p1)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 30 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 26 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 24 transition count 18
Applied a total of 10 rules in 13 ms. Remains 24 /30 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 04:47:33] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 04:47:33] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 04:47:33] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 04:47:33] [INFO ] Implicit Places using invariants in 47 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 18/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 23/30 places, 18/22 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND p1 p0), (NOT p0), false, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (NOT (AND (GEQ s11 1) (GEQ s13 1))) (GEQ s9 1)), p0:(AND (GEQ s11 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1932 reset in 221 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 36 in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-01 finished in 512 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((!p0&&X(G((G(p2)||p1)))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:34] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 04:47:34] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:34] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 04:47:34] [INFO ] Implicit Places using invariants in 64 ms returned [0, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 28/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p0 (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(OR p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s26 7)), p1:(OR (LT s7 1) (LT s8 1) (LT s26 7)), p2:(LT s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 186 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 48 in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-02 finished in 572 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0) U G(X(p1))))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:34] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 04:47:34] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:34] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 04:47:34] [INFO ] Implicit Places using invariants in 92 ms returned [0, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 93 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/30 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 28/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s3 2), p0:(AND (GEQ s5 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-03 finished in 422 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:35] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 04:47:35] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:35] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 04:47:35] [INFO ] Implicit Places using invariants in 57 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 29/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s23 3)), p1:(AND (GEQ s0 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 2 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-04 finished in 372 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(X(X(F(X((G(p0)&&F(p1))))))))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:35] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 04:47:35] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:35] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 04:47:35] [INFO ] Implicit Places using invariants in 85 ms returned [0, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 87 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 28/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 429 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}, { cond=p0, acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s12 1), p1:(GEQ s8 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 1235 reset in 185 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 1 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-05 finished in 814 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(!((p0 U p1)&&p2) U (F(G(p2))||p1)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:36] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 04:47:36] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:36] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 04:47:36] [INFO ] Implicit Places using invariants in 60 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 29/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR p2 p1), (OR p2 p1), p2, p2, (AND (NOT p1) p2), (AND p2 (NOT p1) p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p1) (NOT p0))), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s17 1), p1:(AND (GEQ s0 1) (GEQ s11 1)), p0:(AND (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1670 reset in 261 ms.
Stack based approach found an accepted trace after 113 steps with 1 reset with depth 60 and stack size 58 in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-07 finished in 757 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:37] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 04:47:37] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:37] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 04:47:37] [INFO ] Implicit Places using invariants in 92 ms returned [0, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 94 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/30 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 28/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s15 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][false, false]]
Product exploration explored 100000 steps with 2403 reset in 179 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-08 finished in 450 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(G(F(p0)))))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 5 edges and 30 vertex of which 2 / 30 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 28 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 28 transition count 19
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 5 place count 27 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 23 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 21 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 20 transition count 14
Applied a total of 17 rules in 23 ms. Remains 20 /30 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 20 cols
[2022-05-16 04:47:37] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 04:47:37] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
// Phase 1: matrix 14 rows 20 cols
[2022-05-16 04:47:37] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 04:47:37] [INFO ] Implicit Places using invariants in 67 ms returned [0, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/30 places, 14/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 17 transition count 12
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 4 place count 16 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 14 transition count 10
Applied a total of 8 rules in 6 ms. Remains 14 /18 variables (removed 4) and now considering 10/14 (removed 4) transitions.
// Phase 1: matrix 10 rows 14 cols
[2022-05-16 04:47:37] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 04:47:37] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 10 rows 14 cols
[2022-05-16 04:47:37] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 04:47:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 04:47:37] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/30 places, 10/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 14/30 places, 10/22 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-09 finished in 363 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((((X(p0) U !p0) U p1)&&p2))))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:37] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 04:47:37] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:37] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-16 04:47:38] [INFO ] Implicit Places using invariants in 54 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 29/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(OR (NOT p2) (AND (NOT p1) p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s10 1)), p0:(AND (GEQ s0 1) (GEQ s22 1)), p2:(OR (LT s8 1) (LT s9 1) (LT s27 7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3084 reset in 368 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 1 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-10 finished in 680 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((X(!p0)||F(p1)))) U G((!X(p2) U p0))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:38] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 04:47:38] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:38] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 04:47:38] [INFO ] Implicit Places using invariants in 54 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 29/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 537 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) p2)), false, (AND (NOT p1) p0), (AND (NOT p1) p0 p2), (AND (NOT p1) p0), false, (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s3 1)), p2:(AND (GEQ s0 1) (GEQ s11 1)), p1:(GEQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14758 reset in 191 ms.
Stack based approach found an accepted trace after 118 steps with 22 reset with depth 30 and stack size 30 in 1 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-11 finished in 900 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(X(p0))&&F(X(p1))))||F(X(F(!p1)))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:39] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 04:47:39] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:39] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 04:47:39] [INFO ] Implicit Places using invariants in 40 ms returned [0, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 28/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 136 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (LT s5 1) (LT s9 1)), p0:(OR (LT s1 1) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3054 reset in 146 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-13 finished in 381 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:39] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 04:47:39] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 04:47:39] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 04:47:40] [INFO ] Implicit Places using invariants in 73 ms returned [0, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 74 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 28/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-LTLFireability-15 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s4 1) (LT s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-LTLFireability-15 finished in 317 ms.
All properties solved by simple procedures.
Total runtime 14226 ms.

BK_STOP 1652676460376

--------------------
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="GPPP-PT-C0001N0000000100"
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 GPPP-PT-C0001N0000000100, 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 r096-smll-165260575900180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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