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

About the Execution of ITS-Tools for ShieldPPPt-PT-010B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1120.252 127936.00 141021.00 16657.80 FTFFFFTFFTFFTFFT 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.r216-tall-162098205600780.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 ShieldPPPt-PT-010B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205600780
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 122K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 12:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 12:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 18:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 18:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 185K May 5 16:52 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 ShieldPPPt-PT-010B-00
FORMULA_NAME ShieldPPPt-PT-010B-01
FORMULA_NAME ShieldPPPt-PT-010B-02
FORMULA_NAME ShieldPPPt-PT-010B-03
FORMULA_NAME ShieldPPPt-PT-010B-04
FORMULA_NAME ShieldPPPt-PT-010B-05
FORMULA_NAME ShieldPPPt-PT-010B-06
FORMULA_NAME ShieldPPPt-PT-010B-07
FORMULA_NAME ShieldPPPt-PT-010B-08
FORMULA_NAME ShieldPPPt-PT-010B-09
FORMULA_NAME ShieldPPPt-PT-010B-10
FORMULA_NAME ShieldPPPt-PT-010B-11
FORMULA_NAME ShieldPPPt-PT-010B-12
FORMULA_NAME ShieldPPPt-PT-010B-13
FORMULA_NAME ShieldPPPt-PT-010B-14
FORMULA_NAME ShieldPPPt-PT-010B-15

=== Now, execution of the tool begins

BK_START 1621174967695

Running Version 0
[2021-05-16 14:23:05] [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-16 14:23:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 14:23:05] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2021-05-16 14:23:05] [INFO ] Transformed 783 places.
[2021-05-16 14:23:05] [INFO ] Transformed 713 transitions.
[2021-05-16 14:23:05] [INFO ] Found NUPN structural information;
[2021-05-16 14:23:05] [INFO ] Parsed PT model containing 783 places and 713 transitions in 163 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 14:23:05] [INFO ] Initial state test concluded for 1 properties.
FORMULA ShieldPPPt-PT-010B-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 783 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 783/783 places, 713/713 transitions.
Discarding 102 places :
Symmetric choice reduction at 0 with 102 rule applications. Total rules 102 place count 681 transition count 611
Iterating global reduction 0 with 102 rules applied. Total rules applied 204 place count 681 transition count 611
Applied a total of 204 rules in 137 ms. Remains 681 /783 variables (removed 102) and now considering 611/713 (removed 102) transitions.
// Phase 1: matrix 611 rows 681 cols
[2021-05-16 14:23:05] [INFO ] Computed 111 place invariants in 26 ms
[2021-05-16 14:23:06] [INFO ] Implicit Places using invariants in 373 ms returned []
// Phase 1: matrix 611 rows 681 cols
[2021-05-16 14:23:06] [INFO ] Computed 111 place invariants in 5 ms
[2021-05-16 14:23:06] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
// Phase 1: matrix 611 rows 681 cols
[2021-05-16 14:23:06] [INFO ] Computed 111 place invariants in 16 ms
[2021-05-16 14:23:07] [INFO ] Dead Transitions using invariants and state equation in 300 ms returned []
Finished structural reductions, in 1 iterations. Remains : 681/783 places, 611/713 transitions.
[2021-05-16 14:23:07] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 14:23:07] [INFO ] Flatten gal took : 105 ms
FORMULA ShieldPPPt-PT-010B-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 14:23:07] [INFO ] Flatten gal took : 37 ms
[2021-05-16 14:23:07] [INFO ] Input system was already deterministic with 611 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 496 ms. (steps per millisecond=201 ) properties (out of 20) seen :18
Running SMT prover for 2 properties.
// Phase 1: matrix 611 rows 681 cols
[2021-05-16 14:23:08] [INFO ] Computed 111 place invariants in 9 ms
[2021-05-16 14:23:08] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2021-05-16 14:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:23:08] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2021-05-16 14:23:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:23:08] [INFO ] [Nat]Absence check using 111 positive place invariants in 24 ms returned unsat
[2021-05-16 14:23:08] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2021-05-16 14:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:23:08] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2021-05-16 14:23:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:23:08] [INFO ] [Nat]Absence check using 111 positive place invariants in 25 ms returned sat
[2021-05-16 14:23:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:23:09] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2021-05-16 14:23:09] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 4 ms to minimize.
[2021-05-16 14:23:09] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2021-05-16 14:23:09] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2021-05-16 14:23:09] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2021-05-16 14:23:09] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2021-05-16 14:23:09] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2021-05-16 14:23:10] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2021-05-16 14:23:10] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 1 ms to minimize.
[2021-05-16 14:23:10] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2021-05-16 14:23:10] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 0 ms to minimize.
[2021-05-16 14:23:10] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2021-05-16 14:23:10] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2021-05-16 14:23:10] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2021-05-16 14:23:10] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2021-05-16 14:23:10] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2021-05-16 14:23:10] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2021-05-16 14:23:11] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2021-05-16 14:23:11] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2021-05-16 14:23:11] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2021-05-16 14:23:11] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2085 ms
[2021-05-16 14:23:11] [INFO ] Computed and/alt/rep : 610/904/610 causal constraints (skipped 0 transitions) in 38 ms.
[2021-05-16 14:23:15] [INFO ] Added : 597 causal constraints over 120 iterations in 4691 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2021-05-16 14:23:15] [INFO ] Initial state test concluded for 1 properties.
FORMULA ShieldPPPt-PT-010B-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X((p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 611/611 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 672 transition count 602
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 672 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 671 transition count 601
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 671 transition count 601
Applied a total of 20 rules in 462 ms. Remains 671 /681 variables (removed 10) and now considering 601/611 (removed 10) transitions.
// Phase 1: matrix 601 rows 671 cols
[2021-05-16 14:23:24] [INFO ] Computed 111 place invariants in 6 ms
[2021-05-16 14:23:24] [INFO ] Implicit Places using invariants in 247 ms returned []
// Phase 1: matrix 601 rows 671 cols
[2021-05-16 14:23:24] [INFO ] Computed 111 place invariants in 3 ms
[2021-05-16 14:23:24] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
// Phase 1: matrix 601 rows 671 cols
[2021-05-16 14:23:24] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:23:25] [INFO ] Dead Transitions using invariants and state equation in 310 ms returned []
Finished structural reductions, in 1 iterations. Remains : 671/681 places, 601/611 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-010B-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(EQ s191 1), p2:(AND (NEQ s45 0) (NEQ s290 1) (EQ s191 1)), p1:(AND (NEQ s45 0) (NEQ s290 1))], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ShieldPPPt-PT-010B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-02 finished in 2142 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(G((F(p1)||X(G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 611/611 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 672 transition count 602
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 672 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 671 transition count 601
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 671 transition count 601
Applied a total of 20 rules in 40 ms. Remains 671 /681 variables (removed 10) and now considering 601/611 (removed 10) transitions.
// Phase 1: matrix 601 rows 671 cols
[2021-05-16 14:23:25] [INFO ] Computed 111 place invariants in 3 ms
[2021-05-16 14:23:25] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 601 rows 671 cols
[2021-05-16 14:23:25] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:23:26] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
// Phase 1: matrix 601 rows 671 cols
[2021-05-16 14:23:26] [INFO ] Computed 111 place invariants in 3 ms
[2021-05-16 14:23:26] [INFO ] Dead Transitions using invariants and state equation in 330 ms returned []
Finished structural reductions, in 1 iterations. Remains : 671/681 places, 601/611 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-010B-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s513 0) (EQ s490 1)), p1:(OR (EQ s258 0) (EQ s6 1)), p2:(AND (NEQ s608 0) (NEQ s479 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 42 reset in 417 ms.
Stack based approach found an accepted trace after 1272 steps with 0 reset with depth 1273 and stack size 1273 in 9 ms.
FORMULA ShieldPPPt-PT-010B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-03 finished in 1573 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((F(p0) U p1) U X(p2))&&X(G(p3))))], workingDir=/home/mcc/execution]
Support contains 8 out of 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 611/611 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 675 transition count 605
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 675 transition count 605
Applied a total of 12 rules in 25 ms. Remains 675 /681 variables (removed 6) and now considering 605/611 (removed 6) transitions.
// Phase 1: matrix 605 rows 675 cols
[2021-05-16 14:23:26] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:23:27] [INFO ] Implicit Places using invariants in 187 ms returned []
// Phase 1: matrix 605 rows 675 cols
[2021-05-16 14:23:27] [INFO ] Computed 111 place invariants in 1 ms
[2021-05-16 14:23:27] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
// Phase 1: matrix 605 rows 675 cols
[2021-05-16 14:23:27] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:23:27] [INFO ] Dead Transitions using invariants and state equation in 317 ms returned []
Finished structural reductions, in 1 iterations. Remains : 675/681 places, 605/611 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p2) (NOT p3)), (NOT p3), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-010B-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 6}, { cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(OR (EQ s14 0) (EQ s317 1)), p0:(OR (EQ s204 0) (EQ s110 1)), p3:(OR (EQ s119 0) (EQ s153 1)), p2:(OR (EQ s649 0) (EQ s209 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 305 ms.
Entered a terminal (fully accepting) state of product in 221 steps with 1 reset in 1 ms.
FORMULA ShieldPPPt-PT-010B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-04 finished in 1560 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 611/611 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 673 transition count 603
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 673 transition count 603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 672 transition count 602
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 672 transition count 602
Applied a total of 18 rules in 37 ms. Remains 672 /681 variables (removed 9) and now considering 602/611 (removed 9) transitions.
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:23:28] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:23:28] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:23:28] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:23:29] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:23:29] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:23:29] [INFO ] Dead Transitions using invariants and state equation in 411 ms returned []
Finished structural reductions, in 1 iterations. Remains : 672/681 places, 602/611 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-06 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}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (EQ s69 0) (EQ s517 1))], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 405 ms.
Product exploration explored 100000 steps with 33333 reset in 299 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 284 ms.
Product exploration explored 100000 steps with 33333 reset in 292 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Support contains 2 out of 672 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 672/672 places, 602/602 transitions.
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 672 transition count 602
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 140 place count 672 transition count 641
Deduced a syphon composed of 188 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 188 place count 672 transition count 641
Performed 191 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 379 places in 1 ms
Iterating global reduction 1 with 191 rules applied. Total rules applied 379 place count 672 transition count 641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 380 place count 672 transition count 640
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 453 place count 599 transition count 567
Deduced a syphon composed of 306 places in 1 ms
Iterating global reduction 2 with 73 rules applied. Total rules applied 526 place count 599 transition count 567
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 307 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 527 place count 599 transition count 567
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 529 place count 597 transition count 565
Deduced a syphon composed of 305 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 531 place count 597 transition count 565
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -161
Deduced a syphon composed of 343 places in 1 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 569 place count 597 transition count 726
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 607 place count 559 transition count 650
Deduced a syphon composed of 305 places in 2 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 645 place count 559 transition count 650
Deduced a syphon composed of 305 places in 0 ms
Applied a total of 645 rules in 222 ms. Remains 559 /672 variables (removed 113) and now considering 650/602 (removed -48) transitions.
[2021-05-16 14:23:31] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 650 rows 559 cols
[2021-05-16 14:23:31] [INFO ] Computed 111 place invariants in 3 ms
[2021-05-16 14:23:31] [INFO ] Dead Transitions using invariants and state equation in 322 ms returned []
Finished structural reductions, in 1 iterations. Remains : 559/672 places, 650/602 transitions.
Product exploration explored 100000 steps with 33333 reset in 1644 ms.
Product exploration explored 100000 steps with 33333 reset in 1555 ms.
[2021-05-16 14:23:35] [INFO ] Flatten gal took : 51 ms
[2021-05-16 14:23:35] [INFO ] Flatten gal took : 59 ms
[2021-05-16 14:23:35] [INFO ] Time to serialize gal into /tmp/LTL1070294555401245408.gal : 26 ms
[2021-05-16 14:23:35] [INFO ] Time to serialize properties into /tmp/LTL17453180737364254798.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1070294555401245408.gal, -t, CGAL, -LTL, /tmp/LTL17453180737364254798.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1070294555401245408.gal -t CGAL -LTL /tmp/LTL17453180737364254798.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X("((p76==0)||(p597==1))"))))
Formula 0 simplified : !XX"((p76==0)||(p597==1))"
Detected timeout of ITS tools.
[2021-05-16 14:23:50] [INFO ] Flatten gal took : 24 ms
[2021-05-16 14:23:50] [INFO ] Applying decomposition
[2021-05-16 14:23:50] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph18224020591465703425.txt, -o, /tmp/graph18224020591465703425.bin, -w, /tmp/graph18224020591465703425.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph18224020591465703425.bin, -l, -1, -v, -w, /tmp/graph18224020591465703425.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 14:23:50] [INFO ] Decomposing Gal with order
[2021-05-16 14:23:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 14:23:50] [INFO ] Removed a total of 99 redundant transitions.
[2021-05-16 14:23:50] [INFO ] Flatten gal took : 80 ms
[2021-05-16 14:23:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2021-05-16 14:23:50] [INFO ] Time to serialize gal into /tmp/LTL13052223883276788804.gal : 13 ms
[2021-05-16 14:23:50] [INFO ] Time to serialize properties into /tmp/LTL1526937857608702223.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13052223883276788804.gal, -t, CGAL, -LTL, /tmp/LTL1526937857608702223.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13052223883276788804.gal -t CGAL -LTL /tmp/LTL1526937857608702223.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X("((i0.i1.i4.u23.p76==0)||(i9.u182.p597==1))"))))
Formula 0 simplified : !XX"((i0.i1.i4.u23.p76==0)||(i9.u182.p597==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14336780068471304388
[2021-05-16 14:24:06] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14336780068471304388
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14336780068471304388]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14336780068471304388] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14336780068471304388] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldPPPt-PT-010B-06 finished in 38504 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 611/611 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 680 transition count 472
Reduce places removed 138 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 140 rules applied. Total rules applied 278 place count 542 transition count 470
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 280 place count 541 transition count 469
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 281 place count 540 transition count 469
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 77 Pre rules applied. Total rules applied 281 place count 540 transition count 392
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 435 place count 463 transition count 392
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 441 place count 457 transition count 386
Iterating global reduction 4 with 6 rules applied. Total rules applied 447 place count 457 transition count 386
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 447 place count 457 transition count 380
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 459 place count 451 transition count 380
Performed 164 Post agglomeration using F-continuation condition.Transition count delta: 164
Deduced a syphon composed of 164 places in 0 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 4 with 328 rules applied. Total rules applied 787 place count 287 transition count 216
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 843 place count 259 transition count 216
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 844 place count 258 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 845 place count 257 transition count 215
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 845 place count 257 transition count 213
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 849 place count 255 transition count 213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 850 place count 254 transition count 212
Applied a total of 850 rules in 142 ms. Remains 254 /681 variables (removed 427) and now considering 212/611 (removed 399) transitions.
// Phase 1: matrix 212 rows 254 cols
[2021-05-16 14:24:07] [INFO ] Computed 110 place invariants in 1 ms
[2021-05-16 14:24:07] [INFO ] Implicit Places using invariants in 128 ms returned [236, 240]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 129 ms to find 2 implicit places.
[2021-05-16 14:24:07] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 212 rows 252 cols
[2021-05-16 14:24:07] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:24:07] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Starting structural reductions, iteration 1 : 252/681 places, 212/611 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 250 transition count 210
Applied a total of 4 rules in 12 ms. Remains 250 /252 variables (removed 2) and now considering 210/212 (removed 2) transitions.
// Phase 1: matrix 210 rows 250 cols
[2021-05-16 14:24:07] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:24:07] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 210 rows 250 cols
[2021-05-16 14:24:07] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:24:07] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-16 14:24:07] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 250/681 places, 210/611 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (NEQ s203 0) (NEQ s207 1)) (AND (NEQ s242 0) (NEQ s28 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19135 reset in 310 ms.
Stack based approach found an accepted trace after 702 steps with 145 reset with depth 5 and stack size 5 in 2 ms.
FORMULA ShieldPPPt-PT-010B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-07 finished in 1067 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 611/611 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 673 transition count 603
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 673 transition count 603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 672 transition count 602
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 672 transition count 602
Applied a total of 18 rules in 40 ms. Remains 672 /681 variables (removed 9) and now considering 602/611 (removed 9) transitions.
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:24:08] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:24:08] [INFO ] Implicit Places using invariants in 196 ms returned []
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:24:08] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:24:08] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:24:08] [INFO ] Computed 111 place invariants in 3 ms
[2021-05-16 14:24:09] [INFO ] Dead Transitions using invariants and state equation in 291 ms returned []
Finished structural reductions, in 1 iterations. Remains : 672/681 places, 602/611 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s184 0) (EQ s248 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 346 ms.
Product exploration explored 100000 steps with 50000 reset in 353 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 365 ms.
Product exploration explored 100000 steps with 50000 reset in 364 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 672 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 672/672 places, 602/602 transitions.
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 672 transition count 602
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 51 Pre rules applied. Total rules applied 138 place count 672 transition count 643
Deduced a syphon composed of 189 places in 0 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 189 place count 672 transition count 643
Performed 190 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 379 places in 0 ms
Iterating global reduction 1 with 190 rules applied. Total rules applied 379 place count 672 transition count 643
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 380 place count 672 transition count 642
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 451 place count 601 transition count 571
Deduced a syphon composed of 308 places in 1 ms
Iterating global reduction 2 with 71 rules applied. Total rules applied 522 place count 601 transition count 571
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 309 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 523 place count 601 transition count 571
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 525 place count 599 transition count 569
Deduced a syphon composed of 307 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 527 place count 599 transition count 569
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -159
Deduced a syphon composed of 345 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 565 place count 599 transition count 728
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 604 place count 560 transition count 650
Deduced a syphon composed of 306 places in 0 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 643 place count 560 transition count 650
Deduced a syphon composed of 306 places in 1 ms
Applied a total of 643 rules in 110 ms. Remains 560 /672 variables (removed 112) and now considering 650/602 (removed -48) transitions.
[2021-05-16 14:24:10] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 650 rows 560 cols
[2021-05-16 14:24:10] [INFO ] Computed 111 place invariants in 4 ms
[2021-05-16 14:24:11] [INFO ] Dead Transitions using invariants and state equation in 338 ms returned []
Finished structural reductions, in 1 iterations. Remains : 560/672 places, 650/602 transitions.
Product exploration explored 100000 steps with 50000 reset in 2090 ms.
Product exploration explored 100000 steps with 50000 reset in 2150 ms.
[2021-05-16 14:24:15] [INFO ] Flatten gal took : 19 ms
[2021-05-16 14:24:15] [INFO ] Flatten gal took : 21 ms
[2021-05-16 14:24:15] [INFO ] Time to serialize gal into /tmp/LTL4715711363527455952.gal : 4 ms
[2021-05-16 14:24:15] [INFO ] Time to serialize properties into /tmp/LTL151977494952059118.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4715711363527455952.gal, -t, CGAL, -LTL, /tmp/LTL151977494952059118.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4715711363527455952.gal -t CGAL -LTL /tmp/LTL151977494952059118.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p207==0)||(p281==1))"))))
Formula 0 simplified : !XF"((p207==0)||(p281==1))"
Detected timeout of ITS tools.
[2021-05-16 14:24:30] [INFO ] Flatten gal took : 18 ms
[2021-05-16 14:24:30] [INFO ] Applying decomposition
[2021-05-16 14:24:30] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13282326171015716153.txt, -o, /tmp/graph13282326171015716153.bin, -w, /tmp/graph13282326171015716153.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13282326171015716153.bin, -l, -1, -v, -w, /tmp/graph13282326171015716153.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 14:24:30] [INFO ] Decomposing Gal with order
[2021-05-16 14:24:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 14:24:30] [INFO ] Removed a total of 102 redundant transitions.
[2021-05-16 14:24:30] [INFO ] Flatten gal took : 37 ms
[2021-05-16 14:24:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-16 14:24:30] [INFO ] Time to serialize gal into /tmp/LTL4782599611784610028.gal : 5 ms
[2021-05-16 14:24:30] [INFO ] Time to serialize properties into /tmp/LTL9207418791737954209.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4782599611784610028.gal, -t, CGAL, -LTL, /tmp/LTL9207418791737954209.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4782599611784610028.gal -t CGAL -LTL /tmp/LTL9207418791737954209.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i8.u65.p207==0)||(i6.u88.p281==1))"))))
Formula 0 simplified : !XF"((i8.u65.p207==0)||(i6.u88.p281==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin280153401242890468
[2021-05-16 14:24:45] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin280153401242890468
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin280153401242890468]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin280153401242890468] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin280153401242890468] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldPPPt-PT-010B-09 finished in 38666 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 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 611/611 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 680 transition count 469
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 143 rules applied. Total rules applied 284 place count 539 transition count 467
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 286 place count 538 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 287 place count 537 transition count 466
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 287 place count 537 transition count 391
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 437 place count 462 transition count 391
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 442 place count 457 transition count 386
Iterating global reduction 4 with 5 rules applied. Total rules applied 447 place count 457 transition count 386
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 447 place count 457 transition count 381
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 457 place count 452 transition count 381
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 4 with 340 rules applied. Total rules applied 797 place count 282 transition count 211
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 855 place count 253 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 856 place count 252 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 857 place count 251 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 857 place count 251 transition count 208
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 861 place count 249 transition count 208
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 862 place count 248 transition count 207
Applied a total of 862 rules in 55 ms. Remains 248 /681 variables (removed 433) and now considering 207/611 (removed 404) transitions.
// Phase 1: matrix 207 rows 248 cols
[2021-05-16 14:24:46] [INFO ] Computed 110 place invariants in 0 ms
[2021-05-16 14:24:46] [INFO ] Implicit Places using invariants in 131 ms returned [231, 235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 132 ms to find 2 implicit places.
[2021-05-16 14:24:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 207 rows 246 cols
[2021-05-16 14:24:46] [INFO ] Computed 108 place invariants in 0 ms
[2021-05-16 14:24:47] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Starting structural reductions, iteration 1 : 246/681 places, 207/611 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 244 transition count 205
Applied a total of 4 rules in 6 ms. Remains 244 /246 variables (removed 2) and now considering 205/207 (removed 2) transitions.
// Phase 1: matrix 205 rows 244 cols
[2021-05-16 14:24:47] [INFO ] Computed 108 place invariants in 0 ms
[2021-05-16 14:24:47] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 205 rows 244 cols
[2021-05-16 14:24:47] [INFO ] Computed 108 place invariants in 0 ms
[2021-05-16 14:24:47] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 244/681 places, 205/611 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s168 0) (NEQ s223 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 333 ms.
Stack based approach found an accepted trace after 553 steps with 0 reset with depth 554 and stack size 554 in 3 ms.
FORMULA ShieldPPPt-PT-010B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-10 finished in 973 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((p1 U (p2||G(p1))))&&p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 611/611 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 673 transition count 603
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 673 transition count 603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 672 transition count 602
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 672 transition count 602
Applied a total of 18 rules in 31 ms. Remains 672 /681 variables (removed 9) and now considering 602/611 (removed 9) transitions.
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:24:47] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:24:47] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:24:47] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:24:48] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:24:48] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:24:48] [INFO ] Dead Transitions using invariants and state equation in 314 ms returned []
Finished structural reductions, in 1 iterations. Remains : 672/681 places, 602/611 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-010B-13 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: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (NEQ s670 0) (OR (NEQ s262 0) (NEQ s224 1))), p2:(AND (NEQ s133 0) (NEQ s515 1)), p1:(NEQ s670 0)], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-010B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-13 finished in 1150 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 681 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 681/681 places, 611/611 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 680 transition count 469
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 143 rules applied. Total rules applied 284 place count 539 transition count 467
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 286 place count 538 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 287 place count 537 transition count 466
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 287 place count 537 transition count 391
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 437 place count 462 transition count 391
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 442 place count 457 transition count 386
Iterating global reduction 4 with 5 rules applied. Total rules applied 447 place count 457 transition count 386
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 447 place count 457 transition count 381
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 457 place count 452 transition count 381
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 4 with 340 rules applied. Total rules applied 797 place count 282 transition count 211
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 855 place count 253 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 856 place count 252 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 857 place count 251 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 857 place count 251 transition count 208
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 861 place count 249 transition count 208
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 862 place count 248 transition count 207
Applied a total of 862 rules in 52 ms. Remains 248 /681 variables (removed 433) and now considering 207/611 (removed 404) transitions.
// Phase 1: matrix 207 rows 248 cols
[2021-05-16 14:24:48] [INFO ] Computed 110 place invariants in 0 ms
[2021-05-16 14:24:49] [INFO ] Implicit Places using invariants in 116 ms returned [231, 235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 118 ms to find 2 implicit places.
[2021-05-16 14:24:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 207 rows 246 cols
[2021-05-16 14:24:49] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:24:49] [INFO ] Dead Transitions using invariants and state equation in 111 ms returned []
Starting structural reductions, iteration 1 : 246/681 places, 207/611 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 244 transition count 205
Applied a total of 4 rules in 5 ms. Remains 244 /246 variables (removed 2) and now considering 205/207 (removed 2) transitions.
// Phase 1: matrix 205 rows 244 cols
[2021-05-16 14:24:49] [INFO ] Computed 108 place invariants in 0 ms
[2021-05-16 14:24:49] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 205 rows 244 cols
[2021-05-16 14:24:49] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:24:49] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 244/681 places, 205/611 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s173 0) (NEQ s237 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 328 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldPPPt-PT-010B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-14 finished in 949 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10442605918651412384
[2021-05-16 14:24:49] [INFO ] Computing symmetric may disable matrix : 611 transitions.
[2021-05-16 14:24:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 14:24:49] [INFO ] Computing symmetric may enable matrix : 611 transitions.
[2021-05-16 14:24:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 14:24:49] [INFO ] Applying decomposition
[2021-05-16 14:24:49] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5554102440450101696.txt, -o, /tmp/graph5554102440450101696.bin, -w, /tmp/graph5554102440450101696.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5554102440450101696.bin, -l, -1, -v, -w, /tmp/graph5554102440450101696.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 14:24:49] [INFO ] Decomposing Gal with order
[2021-05-16 14:24:49] [INFO ] Computing Do-Not-Accords matrix : 611 transitions.
[2021-05-16 14:24:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 14:24:49] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 14:24:49] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10442605918651412384
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10442605918651412384]
[2021-05-16 14:24:49] [INFO ] Removed a total of 92 redundant transitions.
[2021-05-16 14:24:49] [INFO ] Flatten gal took : 32 ms
[2021-05-16 14:24:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-16 14:24:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality16232391450253798444.gal : 5 ms
[2021-05-16 14:24:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality18012911737573576193.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality16232391450253798444.gal, -t, CGAL, -LTL, /tmp/LTLCardinality18012911737573576193.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality16232391450253798444.gal -t CGAL -LTL /tmp/LTLCardinality18012911737573576193.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X(X("((i1.i0.i5.u24.p76==0)||(i14.u192.p597==1))"))))
Formula 0 simplified : !XX"((i1.i0.i5.u24.p76==0)||(i14.u192.p597==1))"
Compilation finished in 3738 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10442605918651412384]
Link finished in 63 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin10442605918651412384]
LTSmin run took 412 ms.
FORMULA ShieldPPPt-PT-010B-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin10442605918651412384]
LTSmin run took 355 ms.
FORMULA ShieldPPPt-PT-010B-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621175095631

--------------------
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="ShieldPPPt-PT-010B"
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 ShieldPPPt-PT-010B, 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 r216-tall-162098205600780"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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