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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 7.2K Apr 29 18:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 18:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 18:31 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:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:53 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-C0010N0000000010-LTLFireability-00
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLFireability-01
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLFireability-02
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLFireability-03
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLFireability-04
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLFireability-05
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLFireability-06
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLFireability-07
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLFireability-08
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLFireability-09
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLFireability-10
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLFireability-11
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLFireability-12
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLFireability-13
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLFireability-14
FORMULA_NAME GPPP-PT-C0010N0000000010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652686941522

Running Version 202205111006
[2022-05-16 07:42:23] [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 07:42:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:42:24] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2022-05-16 07:42:24] [INFO ] Transformed 33 places.
[2022-05-16 07:42:24] [INFO ] Transformed 22 transitions.
[2022-05-16 07:42:24] [INFO ] Parsed PT model containing 33 places and 22 transitions in 354 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPPP-PT-C0010N0000000010-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 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 07:42:24] [INFO ] Computed 12 place invariants in 13 ms
[2022-05-16 07:42:25] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 07:42:25] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-16 07:42:25] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 07:42:25] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-16 07:42:25] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 07:42:25] [INFO ] Computed 12 place invariants in 8 ms
[2022-05-16 07:42:25] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 22/22 transitions.
Support contains 31 out of 33 places after structural reductions.
[2022-05-16 07:42:25] [INFO ] Flatten gal took : 45 ms
[2022-05-16 07:42:25] [INFO ] Flatten gal took : 17 ms
[2022-05-16 07:42:25] [INFO ] Input system was already deterministic with 22 transitions.
Support contains 29 out of 33 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10003 steps, including 24 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 23) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 07:42:26] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 07:42:27] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 07:42:27] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-16 07:42:27] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2022-05-16 07:42:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-05-16 07:42:27] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-16 07:42:27] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA GPPP-PT-C0010N0000000010-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(((F(p0) U X(p1))||p0))))'
Support contains 6 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 6 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 07:42:27] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:42:27] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 07:42:27] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-16 07:42:27] [INFO ] Implicit Places using invariants in 82 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 89 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 386 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s16 1), p1:(OR (AND (GEQ s1 70) (GEQ s23 70)) (AND (GEQ s3 2) (GEQ s14 1) (GEQ s26 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 17383 reset in 533 ms.
Product exploration explored 100000 steps with 17388 reset in 238 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)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 22 rows 31 cols
[2022-05-16 07:42:29] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-16 07:42:29] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-16 07:42:29] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 4 ms returned sat
[2022-05-16 07:42:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:29] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-16 07:42:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:42:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-16 07:42:30] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 7 ms returned sat
[2022-05-16 07:42:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:30] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2022-05-16 07:42:30] [INFO ] Computed and/alt/rep : 21/42/21 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 07:42:30] [INFO ] Added : 1 causal constraints over 1 iterations in 34 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2022-05-16 07:42:30] [INFO ] Computed 10 place invariants in 6 ms
[2022-05-16 07:42:30] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
// Phase 1: matrix 22 rows 31 cols
[2022-05-16 07:42:30] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 07:42:30] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2022-05-16 07:42:30] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-16 07:42:30] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 207 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/31 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 : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 22 rows 30 cols
[2022-05-16 07:42:31] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 07:42:31] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 07:42:31] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 5 ms returned sat
[2022-05-16 07:42:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:31] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-05-16 07:42:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:42:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 07:42:32] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 243 ms returned sat
[2022-05-16 07:42:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:32] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-05-16 07:42:32] [INFO ] Computed and/alt/rep : 21/42/21 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 07:42:32] [INFO ] Added : 1 causal constraints over 1 iterations in 36 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17445 reset in 201 ms.
Product exploration explored 100000 steps with 17386 reset in 572 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 30 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 22
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 29 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 29 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 5 rules in 16 ms. Remains 29 /30 variables (removed 1) and now considering 21/22 (removed 1) transitions.
// Phase 1: matrix 21 rows 29 cols
[2022-05-16 07:42:33] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 07:42:33] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2022-05-16 07:42:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 21 rows 29 cols
[2022-05-16 07:42:33] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 07:42:33] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/30 places, 21/22 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 21/22 transitions.
Product exploration explored 100000 steps with 17413 reset in 412 ms.
Product exploration explored 100000 steps with 17420 reset in 350 ms.
Built C files in :
/tmp/ltsmin5091738479199425185
[2022-05-16 07:42:34] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5091738479199425185
Running compilation step : cd /tmp/ltsmin5091738479199425185;'/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 256 ms.
Running link step : cd /tmp/ltsmin5091738479199425185;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin5091738479199425185;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1121441783856281849.hoa' '--buchi-type=spotba'
LTSmin run took 225 ms.
FORMULA GPPP-PT-C0010N0000000010-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0010N0000000010-LTLFireability-01 finished in 7441 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X((F(G(F(p0)))||X(G(!p0))))))))'
Support contains 0 out of 33 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/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 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
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 32 transition count 20
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 31 transition count 20
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 7 place count 29 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 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Applied a total of 10 rules in 12 ms. Remains 27 /33 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 07:42:35] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 07:42:35] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 07:42:35] [INFO ] Computed 10 place invariants in 6 ms
[2022-05-16 07:42:35] [INFO ] Implicit Places using invariants in 69 ms returned [3, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 74 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/33 places, 18/22 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 16
Applied a total of 4 rules in 4 ms. Remains 23 /25 variables (removed 2) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 23 cols
[2022-05-16 07:42:35] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 07:42:35] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2022-05-16 07:42:35] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 07:42:35] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/33 places, 16/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 23/33 places, 16/22 transitions.
Stuttering acceptance computed with spot in 16 ms :[false]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLFireability-02 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000010-LTLFireability-02 TRUE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-LTLFireability-02 finished in 323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((true U false)))'
Support contains 0 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 3 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 32 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 31 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 31 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 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
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 13 place count 25 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 15 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2022-05-16 07:42:35] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 07:42:35] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
// Phase 1: matrix 15 rows 24 cols
[2022-05-16 07:42:35] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 07:42:35] [INFO ] Implicit Places using invariants in 61 ms returned [3, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 15/22 transitions.
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 0 with 7 rules applied. Total rules applied 7 place count 18 transition count 12
Applied a total of 7 rules in 3 ms. Remains 18 /22 variables (removed 4) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 07:42:35] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 07:42:35] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2022-05-16 07:42:35] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 07:42:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 07:42:35] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 170 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/33 places, 12/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 17/33 places, 12/22 transitions.
Stuttering acceptance computed with spot in 16 ms :[true]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}]], initial=0, aps=[], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-LTLFireability-04 finished in 345 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G((G(p0)||F(p1)))))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 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 33 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 32 transition count 21
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 5 place count 30 transition count 20
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 8 place count 28 transition count 19
Applied a total of 8 rules in 7 ms. Remains 28 /33 variables (removed 5) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 28 cols
[2022-05-16 07:42:35] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 07:42:35] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
// Phase 1: matrix 19 rows 28 cols
[2022-05-16 07:42:35] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-16 07:42:35] [INFO ] Implicit Places using invariants in 59 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/33 places, 19/22 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 18
Applied a total of 2 rules in 8 ms. Remains 26 /27 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 26 cols
[2022-05-16 07:42:35] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 07:42:35] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 18 rows 26 cols
[2022-05-16 07:42:35] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 07:42:36] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 181 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/33 places, 18/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 25/33 places, 18/22 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s13 1) (LT s15 1)), p1:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1351 reset in 351 ms.
Stack based approach found an accepted trace after 978 steps with 12 reset with depth 47 and stack size 46 in 5 ms.
FORMULA GPPP-PT-C0010N0000000010-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0010N0000000010-LTLFireability-07 finished in 825 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(X((F(p1)&&p1)))))'
Support contains 3 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 1 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 07:42:36] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 07:42:36] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 07:42:36] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 07:42:36] [INFO ] Implicit Places using invariants in 76 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s14 1) (GEQ s25 30)), p1:(GEQ s6 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 146 ms.
Product exploration explored 100000 steps with 33333 reset in 138 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)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 142 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA GPPP-PT-C0010N0000000010-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0010N0000000010-LTLFireability-08 finished in 706 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 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 0 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 07:42:37] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:42:37] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 07:42:37] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:42:37] [INFO ] Implicit Places using invariants in 52 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s13 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-LTLFireability-09 finished in 213 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(F(p0)))||G(p1))))'
Support contains 3 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 1 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 07:42:37] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:42:37] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 07:42:37] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:42:37] [INFO ] Implicit Places using invariants in 57 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s13 1)), p0:(GEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9668 reset in 179 ms.
Stack based approach found an accepted trace after 28 steps with 4 reset with depth 17 and stack size 17 in 0 ms.
FORMULA GPPP-PT-C0010N0000000010-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0010N0000000010-LTLFireability-10 finished in 455 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||((!p1 U p2)&&G(p3)))))'
Support contains 9 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 1 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 07:42:37] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:42:37] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 07:42:37] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:42:38] [INFO ] Implicit Places using invariants in 57 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2 p3), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2) p1) (AND (NOT p0) (NOT p3))), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (GEQ s22 1) (AND (GEQ s7 1) (GEQ s27 20))), p3:(GEQ s11 1), p2:(AND (GEQ s3 2) (GEQ s14 1) (GEQ s26 1)), p1:(AND (GEQ s1 1) (GEQ s24 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 10873 reset in 111 ms.
Stack based approach found an accepted trace after 14 steps with 1 reset with depth 8 and stack size 8 in 0 ms.
FORMULA GPPP-PT-C0010N0000000010-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0010N0000000010-LTLFireability-11 finished in 523 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(p0)))&&(X(!p1) U X(p1))))'
Support contains 4 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 1 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 07:42:38] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:42:38] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 07:42:38] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:42:38] [INFO ] Implicit Places using invariants in 61 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s9 1)), p0:(OR (LT s1 1) (LT s13 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7551 reset in 289 ms.
Stack based approach found an accepted trace after 57 steps with 5 reset with depth 14 and stack size 14 in 1 ms.
FORMULA GPPP-PT-C0010N0000000010-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0010N0000000010-LTLFireability-13 finished in 547 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G(X((!(!p0 U X(p1))&&p2))))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 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 32 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 31 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 31 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 30 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 29 transition count 18
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 9 place count 28 transition count 17
Applied a total of 9 rules in 6 ms. Remains 28 /33 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 28 cols
[2022-05-16 07:42:38] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-16 07:42:39] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
// Phase 1: matrix 17 rows 28 cols
[2022-05-16 07:42:39] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:42:39] [INFO ] Implicit Places using invariants in 41 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/33 places, 17/22 transitions.
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 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 14
Applied a total of 7 rules in 3 ms. Remains 22 /26 variables (removed 4) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 22 cols
[2022-05-16 07:42:39] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 07:42:39] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 14 rows 22 cols
[2022-05-16 07:42:39] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 07:42:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 07:42:39] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 101 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/33 places, 14/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 21/33 places, 14/22 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (LT s2 1) (LT s3 1)), p1:(GEQ s4 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-LTLFireability-14 finished in 323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((G(p0)||F(p1)))) U G((p2 U p3)))))'
Support contains 8 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 1 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 07:42:39] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:42:39] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 07:42:39] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:42:39] [INFO ] Implicit Places using invariants in 47 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p0)), (NOT p3)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p3 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s7 1) (GEQ s27 20)), p2:(AND (GEQ s7 1) (GEQ s27 20) (GEQ s18 1)), p1:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s29 70)), p0:(AND (GEQ s1 1) (GEQ s13...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3388 reset in 228 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 0 ms.
FORMULA GPPP-PT-C0010N0000000010-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0010N0000000010-LTLFireability-15 finished in 611 ms.
All properties solved by simple procedures.
Total runtime 15880 ms.

BK_STOP 1652686960008

--------------------
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-C0010N0000000010"
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-C0010N0000000010, 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-165260575900212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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