fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r114-smll-165264477100052
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for GlobalResAllocation-COL-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1466.903 63673.00 172386.00 419.00 TTFFFFFFFFFFFFFT normal

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.r114-smll-165264477100052.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 GlobalResAllocation-COL-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477100052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 7.0K Apr 30 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 30 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 03:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 03:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 29K May 10 09:34 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 GlobalResAllocation-COL-11-LTLFireability-00
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-01
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-02
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-03
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-04
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-05
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-06
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-07
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-08
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-09
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-10
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-11
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-12
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-13
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-14
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652686325208

Running Version 202205111006
[2022-05-16 07:32:07] [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:32:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:32:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 07:32:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 07:32:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1271 ms
[2022-05-16 07:32:09] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 297 PT places and 2705087.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 07:32:09] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 10 ms.
[2022-05-16 07:32:09] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=3 )
[2022-05-16 07:32:09] [INFO ] Flatten gal took : 28 ms
[2022-05-16 07:32:09] [INFO ] Flatten gal took : 5 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Res
Symmetric sort wr.t. initial detected :Res
Symmetric sort wr.t. initial and guards detected :Res
Applying symmetric unfolding of full symmetric sort :Res domain size was 22
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2022-05-16 07:32:09] [INFO ] Unfolded HLPN to a Petri net with 45 places and 77 transitions 319 arcs in 27 ms.
[2022-05-16 07:32:09] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA GlobalResAllocation-COL-11-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-11-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 77/77 transitions.
Reduce isomorphic (modulo) transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 45 transition count 66
Applied a total of 22 rules in 15 ms. Remains 45 /45 variables (removed 0) and now considering 66/77 (removed 11) transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:09] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-16 07:32:10] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:10] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-16 07:32:10] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:10] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-16 07:32:10] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:10] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-16 07:32:10] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 45/45 places, 66/77 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 66/77 transitions.
Support contains 45 out of 45 places after structural reductions.
[2022-05-16 07:32:10] [INFO ] Flatten gal took : 36 ms
[2022-05-16 07:32:10] [INFO ] Flatten gal took : 33 ms
[2022-05-16 07:32:10] [INFO ] Input system was already deterministic with 66 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:11] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-16 07:32:11] [INFO ] After 33ms 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 1 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
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' '!(X(F(p0)))'
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 34 transition count 66
Applied a total of 11 rules in 5 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:11] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 07:32:11] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:11] [INFO ] Computed 12 place invariants in 13 ms
[2022-05-16 07:32:12] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:12] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-16 07:32:12] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:12] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:32:12] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 34/45 places, 66/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s24 4) (GEQ s25 4) (GEQ s27 4) (GEQ s26 4) (GEQ s29 4) (GEQ s28 4) (GEQ s31 4) (GEQ s30 4) (GEQ s33 4) (GEQ s32 4) (GEQ s23 4))], 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 7952 reset in 670 ms.
Product exploration explored 100000 steps with 7935 reset in 502 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 217 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 31 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 137 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:14] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:32:14] [INFO ] [Real]Absence check using 12 positive place invariants in 30 ms returned sat
[2022-05-16 07:32:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:32:14] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-05-16 07:32:14] [INFO ] Computed and/alt/rep : 22/88/22 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 07:32:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:32:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2022-05-16 07:32:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:32:14] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-05-16 07:32:14] [INFO ] Computed and/alt/rep : 22/88/22 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 07:32:14] [INFO ] Added : 18 causal constraints over 4 iterations in 53 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Applied a total of 0 rules in 9 ms. Remains 34 /34 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:14] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:32:14] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:14] [INFO ] Computed 12 place invariants in 10 ms
[2022-05-16 07:32:14] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:14] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 07:32:14] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2022-05-16 07:32:14] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:14] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:32:15] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/34 places, 66/66 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 153 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)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 176 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 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:15] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:32:15] [INFO ] [Real]Absence check using 12 positive place invariants in 32 ms returned sat
[2022-05-16 07:32:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:32:15] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-05-16 07:32:15] [INFO ] Computed and/alt/rep : 22/88/22 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 07:32:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:32:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2022-05-16 07:32:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:32:15] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2022-05-16 07:32:16] [INFO ] Computed and/alt/rep : 22/88/22 causal constraints (skipped 0 transitions) in 26 ms.
[2022-05-16 07:32:16] [INFO ] Added : 18 causal constraints over 4 iterations in 218 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7992 reset in 630 ms.
Product exploration explored 100000 steps with 7989 reset in 394 ms.
Built C files in :
/tmp/ltsmin17394899142085072342
[2022-05-16 07:32:17] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2022-05-16 07:32:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:32:17] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2022-05-16 07:32:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:32:17] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2022-05-16 07:32:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:32:17] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17394899142085072342
Running compilation step : cd /tmp/ltsmin17394899142085072342;'/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 549 ms.
Running link step : cd /tmp/ltsmin17394899142085072342;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin17394899142085072342;'/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/stateBased11145086993590690315.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 11 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Applied a total of 0 rules in 7 ms. Remains 34 /34 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:32] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:32:32] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:32] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 07:32:32] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:32] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 07:32:32] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2022-05-16 07:32:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:32] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 07:32:32] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/34 places, 66/66 transitions.
Built C files in :
/tmp/ltsmin10536279649103372096
[2022-05-16 07:32:32] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2022-05-16 07:32:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:32:32] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2022-05-16 07:32:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:32:32] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2022-05-16 07:32:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:32:32] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10536279649103372096
Running compilation step : cd /tmp/ltsmin10536279649103372096;'/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 268 ms.
Running link step : cd /tmp/ltsmin10536279649103372096;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10536279649103372096;'/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/stateBased17011543551793986248.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 07:32:47] [INFO ] Flatten gal took : 9 ms
[2022-05-16 07:32:47] [INFO ] Flatten gal took : 7 ms
[2022-05-16 07:32:47] [INFO ] Time to serialize gal into /tmp/LTL14748261780580083108.gal : 3 ms
[2022-05-16 07:32:47] [INFO ] Time to serialize properties into /tmp/LTL17348254471134558905.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14748261780580083108.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17348254471134558905.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1474826...268
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((pr_released_1>=4)||(pr_released_2>=4))||((pr_released_4>=4)||(pr_released_3>=4)))||(((pr_released_6>=4)||(pr_released_5>=...273
Formula 0 simplified : !XF"(((((pr_released_1>=4)||(pr_released_2>=4))||((pr_released_4>=4)||(pr_released_3>=4)))||(((pr_released_6>=4)||(pr_released_5>=4)...267
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
158 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.62276,55708,1,0,124,230017,20,12,1477,197588,281
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GlobalResAllocation-COL-11-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GlobalResAllocation-COL-11-LTLFireability-00 finished in 38008 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (!p1 U X((G(p3)||p2)))))'
Support contains 34 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:49] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-16 07:32:49] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:49] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-16 07:32:49] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:49] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:50] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:50] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-16 07:32:50] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s9 1) (GEQ s11 1)) (AND (GEQ s3 1) (GEQ s11 1)) (AND (GEQ s4 1) (GEQ s11 1)) (AND (GEQ s8 1) (GEQ s11 1)) (AND (GEQ s10 1) (GEQ s11 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 352 ms.
Product exploration explored 100000 steps with 50000 reset in 329 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 p1 p0 p2 (NOT p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0 p2 (NOT p3))
Knowledge based reduction with 14 factoid took 673 ms. Reduced automaton from 5 states, 10 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA GlobalResAllocation-COL-11-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-11-LTLFireability-01 finished in 2079 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(F(!(X(p0) U F(X(p1)))))&&X(X(p0))))'
Support contains 23 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 34 transition count 66
Applied a total of 11 rules in 2 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:51] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:32:51] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:51] [INFO ] Computed 12 place invariants in 9 ms
[2022-05-16 07:32:52] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:52] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 07:32:52] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:52] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:32:52] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 34/45 places, 66/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s24 4) (GEQ s25 4) (GEQ s27 4) (GEQ s26 4) (GEQ s29 4) (GEQ s28 4) (GEQ s31 4) (GEQ s30 4) (GEQ s33 4) (GEQ s32 4) (GEQ s23 4)), p1:(OR (AND (...], 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 GlobalResAllocation-COL-11-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-02 finished in 564 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 12 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Applied a total of 0 rules in 5 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:52] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:32:52] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:52] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 07:32:52] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:52] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 07:32:52] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2022-05-16 07:32:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:52] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:32:52] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s9 1) (LT s11 1)) (OR (LT s3 1) (LT s11 1)) (OR (LT s4 1) (LT s11 1)) (OR (LT s8 1) (LT s11 1)) (OR (LT s10 1) (LT s11 1)) (OR (LT s7 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 318 ms.
Stack based approach found an accepted trace after 1148 steps with 0 reset with depth 1149 and stack size 1149 in 6 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-03 finished in 667 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 22 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:53] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:53] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:53] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-16 07:32:53] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:53] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:53] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:53] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:53] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-04 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 (OR (LT s15 1) (LT s26 1)) (OR (LT s19 1) (LT s30 1)) (OR (LT s17 1) (LT s28 1)) (OR (LT s21 1) (LT s32 1)) (OR (LT s13 1) (LT s24 1)) (OR (LT s16...], 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 GlobalResAllocation-COL-11-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-04 finished in 448 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(!F(X(p0)) U X(p1)) U !p0))'
Support contains 34 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:53] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:53] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:53] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:53] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:53] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-16 07:32:53] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:53] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:53] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) p1), true, p0, (OR p1 p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=p1, acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(OR (AND (GEQ s3 1) (GEQ s11 2)) (AND (GEQ s4 1) (GEQ s11 2)) (AND (GEQ s5 1) (GEQ s11 2)) (AND (GEQ s8 1) (GEQ s11 2)) (AND (GEQ s10 1) (GEQ s11 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-06 finished in 495 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((F((p0 U p0))&&G(p1)&&p0)))))'
Support contains 23 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Applied a total of 0 rules in 4 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:54] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 07:32:54] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:54] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:32:54] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:54] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 07:32:54] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2022-05-16 07:32:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:54] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:32:54] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s24 4) (GEQ s25 4) (GEQ s27 4) (GEQ s26 4) (GEQ s29 4) (GEQ s28 4) (GEQ s31 4) (GEQ s30 4) (GEQ s33 4) (GEQ s32 4) (GEQ s23 4)), p1:(OR (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 552 ms.
Stack based approach found an accepted trace after 1415 steps with 0 reset with depth 1416 and stack size 1415 in 11 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-07 finished in 997 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G((X(G(F(G(p1))))&&p0))))))'
Support contains 23 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Applied a total of 0 rules in 4 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:55] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 07:32:55] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:55] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:32:55] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:55] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:32:55] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2022-05-16 07:32:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:32:55] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 07:32:55] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s4 1) (LT s11 3)) (OR (LT s10 1) (LT s11 3)) (OR (LT s3 1) (LT s11 3)) (OR (LT s5 1) (LT s11 3)) (OR (LT s6 1) (LT s11 3)) (OR (LT s9 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 450 ms.
Stack based approach found an accepted trace after 471 steps with 0 reset with depth 472 and stack size 472 in 4 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-08 finished in 840 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(G(X(G(!F(G(p0))))) U !p1))))'
Support contains 45 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:55] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:55] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:55] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:55] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:55] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-16 07:32:56] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2022-05-16 07:32:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:56] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:56] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s15 1) (LT s26 1)) (OR (LT s19 1) (LT s30 1)) (OR (LT s17 1) (LT s28 1)) (OR (LT s21 1) (LT s32 1)) (OR (LT s13 1) (LT s24 1)) (OR (LT s16...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 304 ms.
Stack based approach found an accepted trace after 230 steps with 0 reset with depth 231 and stack size 231 in 1 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-09 finished in 891 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (X(!X(G(p2)))||p1)))'
Support contains 34 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:56] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-16 07:32:56] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:56] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-16 07:32:56] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:56] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:56] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:56] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:57] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND p2 (NOT p0)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p0 p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s11 3)) (AND (GEQ s10 1) (GEQ s11 3)) (AND (GEQ s3 1) (GEQ s11 3)) (AND (GEQ s5 1) (GEQ s11 3)) (AND (GEQ s6 1) (GEQ s11 3)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7126 reset in 651 ms.
Stack based approach found an accepted trace after 33375 steps with 2365 reset with depth 16 and stack size 16 in 208 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-10 finished in 1399 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(F(X(p1)))&&p0))||G(p2)))'
Support contains 34 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:58] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:58] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:58] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:58] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:58] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-16 07:32:58] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:58] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:58] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=p0, acceptance={0} source=5 dest: 4}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p1:(OR (AND (GEQ s20 2) (GEQ s31 2)) (AND (GEQ s22 2) (GEQ s33 2)) (AND (GEQ s21 2) (GEQ s32 2)) (AND (GEQ s12 2) (GEQ s23 2)) (AND (GEQ s13 2) (GEQ s24 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, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 32209 reset in 484 ms.
Stack based approach found an accepted trace after 6641 steps with 2131 reset with depth 5 and stack size 5 in 29 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-11 finished in 953 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||G(F(p2))))'
Support contains 33 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:59] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-16 07:32:59] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:59] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:59] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:59] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:59] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:32:59] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:32:59] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (GEQ s35 4) (GEQ s36 4) (GEQ s38 4) (GEQ s37 4) (GEQ s40 4) (GEQ s39 4) (GEQ s42 4) (GEQ s41 4) (GEQ s44 4) (GEQ s43 4) (GEQ s34 4)), p2:(OR (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 586 reset in 313 ms.
Product exploration explored 100000 steps with 688 reset in 344 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 p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 6 factoid took 1016 ms. Reduced automaton from 7 states, 14 edges and 3 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F p1)]
Knowledge based reduction with 6 factoid took 944 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:33:02] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:33:02] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-16 07:33:02] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 7 ms returned sat
[2022-05-16 07:33:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:03] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-16 07:33:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:33:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2022-05-16 07:33:03] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 8 ms returned sat
[2022-05-16 07:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:03] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-05-16 07:33:03] [INFO ] Computed and/alt/rep : 22/132/22 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-16 07:33:03] [INFO ] Added : 16 causal constraints over 4 iterations in 70 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p1))
Support contains 33 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:33:03] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:33:03] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:33:03] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:33:03] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:33:03] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-16 07:33:03] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:33:03] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:33:03] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 66/66 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 p2) (NOT p1)), true]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 289 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p2) (NOT p1)), true]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (NOT p2))), (X (X p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F p1)]
Knowledge based reduction with 2 factoid took 381 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:33:04] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:33:05] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2022-05-16 07:33:05] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 7 ms returned sat
[2022-05-16 07:33:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:05] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2022-05-16 07:33:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:33:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2022-05-16 07:33:05] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 9 ms returned sat
[2022-05-16 07:33:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:05] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-16 07:33:05] [INFO ] Computed and/alt/rep : 22/132/22 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 07:33:05] [INFO ] Added : 18 causal constraints over 4 iterations in 71 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 746 reset in 548 ms.
Product exploration explored 100000 steps with 760 reset in 620 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 33 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 13 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:33:07] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-16 07:33:07] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
[2022-05-16 07:33:07] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:33:07] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:33:07] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 66/66 transitions.
Product exploration explored 100000 steps with 594 reset in 607 ms.
Stack based approach found an accepted trace after 25309 steps with 68 reset with depth 882 and stack size 879 in 136 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-12 finished in 9278 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 12 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 34 transition count 66
Applied a total of 11 rules in 1 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:33:08] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:33:08] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:33:08] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 07:33:08] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:33:08] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:33:08] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:33:08] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:33:08] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 34/45 places, 66/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-13 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:(OR (AND (GEQ s3 1) (GEQ s11 2)) (AND (GEQ s4 1) (GEQ s11 2)) (AND (GEQ s5 1) (GEQ s11 2)) (AND (GEQ s8 1) (GEQ s11 2)) (AND (GEQ s10 1) (GEQ s11 2)) (...], 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 17 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-13 finished in 295 ms.
All properties solved by simple procedures.
Total runtime 60993 ms.

BK_STOP 1652686388881

--------------------
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="GlobalResAllocation-COL-11"
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 GlobalResAllocation-COL-11, 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 r114-smll-165264477100052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GlobalResAllocation-COL-11.tgz
mv GlobalResAllocation-COL-11 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 ;