fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r121-tall-162075406900428
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for JoinFreeModules-PT-0050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
293.163 18015.00 28782.00 292.40 FFFFFFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r121-tall-162075406900428.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is JoinFreeModules-PT-0050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406900428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 10K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 26 06:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 06:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 24 10:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 24 10:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 282K May 5 16:51 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 JoinFreeModules-PT-0050-00
FORMULA_NAME JoinFreeModules-PT-0050-01
FORMULA_NAME JoinFreeModules-PT-0050-02
FORMULA_NAME JoinFreeModules-PT-0050-03
FORMULA_NAME JoinFreeModules-PT-0050-04
FORMULA_NAME JoinFreeModules-PT-0050-05
FORMULA_NAME JoinFreeModules-PT-0050-06
FORMULA_NAME JoinFreeModules-PT-0050-07
FORMULA_NAME JoinFreeModules-PT-0050-08
FORMULA_NAME JoinFreeModules-PT-0050-09
FORMULA_NAME JoinFreeModules-PT-0050-10
FORMULA_NAME JoinFreeModules-PT-0050-11
FORMULA_NAME JoinFreeModules-PT-0050-12
FORMULA_NAME JoinFreeModules-PT-0050-13
FORMULA_NAME JoinFreeModules-PT-0050-14
FORMULA_NAME JoinFreeModules-PT-0050-15

=== Now, execution of the tool begins

BK_START 1620842436048

Running Version 0
[2021-05-12 18:00:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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]
[2021-05-12 18:00:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 18:00:38] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2021-05-12 18:00:38] [INFO ] Transformed 251 places.
[2021-05-12 18:00:38] [INFO ] Transformed 401 transitions.
[2021-05-12 18:00:38] [INFO ] Parsed PT model containing 251 places and 401 transitions in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 18:00:38] [INFO ] Initial state test concluded for 1 properties.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0050-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 34 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:38] [INFO ] Computed 50 place invariants in 16 ms
[2021-05-12 18:00:38] [INFO ] Dead Transitions using invariants and state equation in 469 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:38] [INFO ] Computed 50 place invariants in 10 ms
[2021-05-12 18:00:39] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:39] [INFO ] Computed 50 place invariants in 3 ms
[2021-05-12 18:00:39] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:39] [INFO ] Computed 50 place invariants in 3 ms
[2021-05-12 18:00:39] [INFO ] Dead Transitions using invariants and state equation in 249 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
[2021-05-12 18:00:39] [INFO ] Flatten gal took : 70 ms
[2021-05-12 18:00:39] [INFO ] Flatten gal took : 30 ms
[2021-05-12 18:00:39] [INFO ] Input system was already deterministic with 401 transitions.
Incomplete random walk after 100002 steps, including 2 resets, run finished after 617 ms. (steps per millisecond=162 ) properties (out of 28) seen :27
Running SMT prover for 1 properties.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:40] [INFO ] Computed 50 place invariants in 2 ms
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U G((p1&&(G(p1)||X(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 13 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:40] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-12 18:00:40] [INFO ] Dead Transitions using invariants and state equation in 165 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:40] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-12 18:00:40] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:40] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-12 18:00:40] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:40] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:41] [INFO ] Dead Transitions using invariants and state equation in 155 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 436 ms :[(NOT p1), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p2)]
Running random walk in product with property : JoinFreeModules-PT-0050-00 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0, 1, 2} source=0 dest: 0}, { cond=p1, acceptance={0, 2} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={1, 2} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1, 2} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={1} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=3 dest: 10}, { cond=(AND p1 (NOT p2)), acceptance={2} source=3 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0, 1, 2} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=8 dest: 7}, { cond=(AND p1 p0 p2), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=10 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0, 2} source=10 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 1}, { cond=(AND p1 p2), acceptance={} source=10 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1, 2} source=10 dest: 3}, { cond=(AND p1 p2), acceptance={1} source=10 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=10 dest: 10}, { cond=(AND p1 p2), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p1) p2), acceptance={0, 1, 2} source=11 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=11 dest: 1}, { cond=(AND p1 p2), acceptance={1, 2} source=11 dest: 3}, { cond=(AND p1 p2), acceptance={} source=11 dest: 4}, { cond=(AND p1 p2), acceptance={2} source=11 dest: 11}]], initial=0, aps=[p1:(LEQ 2 s94), p0:(LEQ s207 s217), p2:(LEQ s201 s31)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0050-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-00 finished in 1009 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 33 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:41] [INFO ] Computed 50 place invariants in 4 ms
[2021-05-12 18:00:41] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:41] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-12 18:00:41] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:41] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:41] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2021-05-12 18:00:41] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:42] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:42] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 29 ms :[true, (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (GT s44 s109) (LEQ 3 s46))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0050-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-02 finished in 620 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G((p1 U X(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:42] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:42] [INFO ] Dead Transitions using invariants and state equation in 149 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:42] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:42] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:42] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:42] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:42] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:42] [INFO ] Dead Transitions using invariants and state equation in 207 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : JoinFreeModules-PT-0050-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s227 s170), p1:(LEQ s58 s246), p2:(LEQ 2 s99)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0050-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-03 finished in 671 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&F(p1)&&X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:42] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:43] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:43] [INFO ] Computed 50 place invariants in 10 ms
[2021-05-12 18:00:43] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:43] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-12 18:00:43] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:43] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:43] [INFO ] Dead Transitions using invariants and state equation in 142 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0050-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s231 s199), p1:(LEQ 1 s213), p2:(LEQ 3 s88)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-04 finished in 556 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:43] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:43] [INFO ] Dead Transitions using invariants and state equation in 149 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:43] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:43] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:43] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-12 18:00:43] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:43] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:43] [INFO ] Dead Transitions using invariants and state equation in 141 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : JoinFreeModules-PT-0050-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s63 s120)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-05 finished in 517 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(X(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:43] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:44] [INFO ] Dead Transitions using invariants and state equation in 145 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:44] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:44] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:44] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:44] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:44] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:44] [INFO ] Dead Transitions using invariants and state equation in 198 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s38)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null][false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0050-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-06 finished in 533 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 13 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:44] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:44] [INFO ] Dead Transitions using invariants and state equation in 138 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:44] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:44] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:44] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-12 18:00:44] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2021-05-12 18:00:44] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:44] [INFO ] Computed 50 place invariants in 4 ms
[2021-05-12 18:00:44] [INFO ] Dead Transitions using invariants and state equation in 149 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 1 s3) (GT s127 s180))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9 reset in 1961 ms.
Stack based approach found an accepted trace after 10912 steps with 0 reset with depth 10913 and stack size 528 in 249 ms.
FORMULA JoinFreeModules-PT-0050-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-07 finished in 2730 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0) U p1)&&X(X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:47] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:47] [INFO ] Dead Transitions using invariants and state equation in 149 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:47] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:47] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:47] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:47] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:47] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:47] [INFO ] Dead Transitions using invariants and state equation in 164 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : JoinFreeModules-PT-0050-08 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s9 s24), p0:(LEQ s2 s107), p2:(LEQ 1 s141)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 704 steps with 0 reset in 11 ms.
FORMULA JoinFreeModules-PT-0050-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-08 finished in 620 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U p1))], workingDir=/home/mcc/execution]
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:47] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:48] [INFO ] Dead Transitions using invariants and state equation in 162 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:48] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:48] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:48] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:48] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2021-05-12 18:00:48] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:48] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:48] [INFO ] Dead Transitions using invariants and state equation in 160 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0050-09 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ s200 s129), p0:(LEQ s218 s181)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-09 finished in 585 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 22 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:48] [INFO ] Computed 50 place invariants in 0 ms
[2021-05-12 18:00:48] [INFO ] Dead Transitions using invariants and state equation in 145 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:48] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:48] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:48] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:48] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2021-05-12 18:00:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:48] [INFO ] Computed 50 place invariants in 3 ms
[2021-05-12 18:00:48] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s51)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-10 finished in 529 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 1 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:48] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:49] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:49] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:49] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:49] [INFO ] Computed 50 place invariants in 0 ms
[2021-05-12 18:00:49] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:49] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:49] [INFO ] Dead Transitions using invariants and state equation in 138 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : JoinFreeModules-PT-0050-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s218), p0:(LEQ s27 s37)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 168 steps with 0 reset in 4 ms.
FORMULA JoinFreeModules-PT-0050-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-11 finished in 516 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:49] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:49] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:49] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:49] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:49] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:49] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:49] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:49] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-12 automaton TGBA [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:(GT 1 s200)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0050-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-12 finished in 477 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:49] [INFO ] Computed 50 place invariants in 0 ms
[2021-05-12 18:00:50] [INFO ] Dead Transitions using invariants and state equation in 138 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:50] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:50] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:50] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:50] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:50] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:50] [INFO ] Dead Transitions using invariants and state equation in 139 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0050-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, 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:(LEQ 1 s128), p1:(LEQ 3 s110)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-13 finished in 512 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 10 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:50] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:50] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:50] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:50] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:50] [INFO ] Computed 50 place invariants in 0 ms
[2021-05-12 18:00:50] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2021-05-12 18:00:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:50] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:50] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s13)], 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 1615 ms.
Stack based approach found an accepted trace after 2027 steps with 0 reset with depth 2028 and stack size 1949 in 40 ms.
FORMULA JoinFreeModules-PT-0050-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-14 finished in 2144 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 8 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:52] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:52] [INFO ] Dead Transitions using invariants and state equation in 141 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:52] [INFO ] Computed 50 place invariants in 0 ms
[2021-05-12 18:00:52] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:52] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:52] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2021-05-12 18:00:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 18:00:52] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-12 18:00:53] [INFO ] Dead Transitions using invariants and state equation in 139 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0050-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s39 s174), p1:(LEQ 1 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-15 finished in 551 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620842454063

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="JoinFreeModules-PT-0050"
export BK_EXAMINATION="LTLCardinality"
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 JoinFreeModules-PT-0050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075406900428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0050.tgz
mv JoinFreeModules-PT-0050 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;