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-162098205100484.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 ShieldIIPt-PT-050A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205100484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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.6K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 12:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 12:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 18:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 18:12 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 265K 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 ShieldIIPt-PT-050A-00
FORMULA_NAME ShieldIIPt-PT-050A-01
FORMULA_NAME ShieldIIPt-PT-050A-02
FORMULA_NAME ShieldIIPt-PT-050A-03
FORMULA_NAME ShieldIIPt-PT-050A-04
FORMULA_NAME ShieldIIPt-PT-050A-05
FORMULA_NAME ShieldIIPt-PT-050A-06
FORMULA_NAME ShieldIIPt-PT-050A-07
FORMULA_NAME ShieldIIPt-PT-050A-08
FORMULA_NAME ShieldIIPt-PT-050A-09
FORMULA_NAME ShieldIIPt-PT-050A-10
FORMULA_NAME ShieldIIPt-PT-050A-11
FORMULA_NAME ShieldIIPt-PT-050A-12
FORMULA_NAME ShieldIIPt-PT-050A-13
FORMULA_NAME ShieldIIPt-PT-050A-14
FORMULA_NAME ShieldIIPt-PT-050A-15

=== Now, execution of the tool begins

BK_START 1621111669082

Running Version 0
[2021-05-15 20:47:50] [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-15 20:47:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 20:47:50] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2021-05-15 20:47:50] [INFO ] Transformed 953 places.
[2021-05-15 20:47:50] [INFO ] Transformed 703 transitions.
[2021-05-15 20:47:50] [INFO ] Found NUPN structural information;
[2021-05-15 20:47:50] [INFO ] Parsed PT model containing 953 places and 703 transitions in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7961 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 20:47:58] [INFO ] Initial state test concluded for 3 properties.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-050A-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 91 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:47:58] [INFO ] Computed 451 place invariants in 18 ms
[2021-05-15 20:47:59] [INFO ] Implicit Places using invariants in 711 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:47:59] [INFO ] Computed 451 place invariants in 7 ms
[2021-05-15 20:48:00] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1690 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:48:00] [INFO ] Computed 451 place invariants in 4 ms
[2021-05-15 20:48:00] [INFO ] Dead Transitions using invariants and state equation in 438 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
[2021-05-15 20:48:01] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-15 20:48:01] [INFO ] Flatten gal took : 193 ms
FORMULA ShieldIIPt-PT-050A-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 20:48:01] [INFO ] Flatten gal took : 117 ms
[2021-05-15 20:48:01] [INFO ] Input system was already deterministic with 702 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1194 ms. (steps per millisecond=83 ) properties (out of 17) seen :5
Running SMT prover for 12 properties.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:48:02] [INFO ] Computed 451 place invariants in 5 ms
[2021-05-15 20:48:02] [INFO ] [Real]Absence check using 451 positive place invariants in 69 ms returned sat
[2021-05-15 20:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:48:03] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2021-05-15 20:48:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:48:03] [INFO ] [Nat]Absence check using 451 positive place invariants in 73 ms returned sat
[2021-05-15 20:48:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:48:03] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2021-05-15 20:48:12] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints (skipped 0 transitions) in 53 ms.
[2021-05-15 20:48:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-15 20:48:23] [INFO ] [Real]Absence check using 451 positive place invariants in 73 ms returned sat
[2021-05-15 20:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:48:23] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2021-05-15 20:48:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:48:23] [INFO ] [Nat]Absence check using 451 positive place invariants in 68 ms returned sat
[2021-05-15 20:48:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:48:24] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2021-05-15 20:48:24] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints (skipped 0 transitions) in 41 ms.
[2021-05-15 20:48:39] [INFO ] Added : 692 causal constraints over 141 iterations in 14926 ms. Result :sat
[2021-05-15 20:48:39] [INFO ] [Real]Absence check using 451 positive place invariants in 68 ms returned sat
[2021-05-15 20:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:48:39] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2021-05-15 20:48:39] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-15 20:48:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:48:39] [INFO ] [Nat]Absence check using 451 positive place invariants in 74 ms returned sat
[2021-05-15 20:48:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:48:40] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2021-05-15 20:48:40] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints (skipped 0 transitions) in 37 ms.
[2021-05-15 20:48:55] [INFO ] Added : 697 causal constraints over 142 iterations in 15579 ms. Result :sat
[2021-05-15 20:48:56] [INFO ] [Real]Absence check using 451 positive place invariants in 67 ms returned sat
[2021-05-15 20:48:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:48:56] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2021-05-15 20:48:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:48:56] [INFO ] [Nat]Absence check using 451 positive place invariants in 68 ms returned sat
[2021-05-15 20:48:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:48:56] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2021-05-15 20:48:56] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints (skipped 0 transitions) in 38 ms.
[2021-05-15 20:49:10] [INFO ] Added : 681 causal constraints over 141 iterations in 13998 ms. Result :sat
[2021-05-15 20:49:10] [INFO ] [Real]Absence check using 451 positive place invariants in 67 ms returned sat
[2021-05-15 20:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:49:11] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2021-05-15 20:49:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:49:11] [INFO ] [Nat]Absence check using 451 positive place invariants in 68 ms returned sat
[2021-05-15 20:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:49:11] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2021-05-15 20:49:11] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints (skipped 0 transitions) in 35 ms.
[2021-05-15 20:49:24] [INFO ] Added : 684 causal constraints over 138 iterations in 12642 ms. Result :sat
[2021-05-15 20:49:24] [INFO ] [Real]Absence check using 451 positive place invariants in 67 ms returned sat
[2021-05-15 20:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:49:24] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2021-05-15 20:49:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:49:25] [INFO ] [Nat]Absence check using 451 positive place invariants in 72 ms returned sat
[2021-05-15 20:49:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:49:25] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2021-05-15 20:49:25] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints (skipped 0 transitions) in 36 ms.
[2021-05-15 20:49:39] [INFO ] Added : 693 causal constraints over 140 iterations in 14099 ms. Result :sat
[2021-05-15 20:49:39] [INFO ] [Real]Absence check using 451 positive place invariants in 67 ms returned sat
[2021-05-15 20:49:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:49:39] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2021-05-15 20:49:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:49:40] [INFO ] [Nat]Absence check using 451 positive place invariants in 70 ms returned sat
[2021-05-15 20:49:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:49:40] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2021-05-15 20:49:40] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints (skipped 0 transitions) in 37 ms.
[2021-05-15 20:49:54] [INFO ] Added : 700 causal constraints over 141 iterations in 14364 ms. Result :sat
[2021-05-15 20:49:54] [INFO ] [Real]Absence check using 451 positive place invariants in 67 ms returned sat
[2021-05-15 20:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:49:55] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2021-05-15 20:49:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:49:55] [INFO ] [Nat]Absence check using 451 positive place invariants in 69 ms returned sat
[2021-05-15 20:49:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:49:55] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2021-05-15 20:49:55] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints (skipped 0 transitions) in 36 ms.
[2021-05-15 20:50:11] [INFO ] Added : 694 causal constraints over 141 iterations in 16005 ms. Result :sat
[2021-05-15 20:50:11] [INFO ] [Real]Absence check using 451 positive place invariants in 68 ms returned sat
[2021-05-15 20:50:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:50:12] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2021-05-15 20:50:12] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints (skipped 0 transitions) in 36 ms.
[2021-05-15 20:50:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:50:12] [INFO ] [Nat]Absence check using 451 positive place invariants in 71 ms returned sat
[2021-05-15 20:50:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:50:12] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2021-05-15 20:50:12] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints (skipped 0 transitions) in 37 ms.
[2021-05-15 20:50:26] [INFO ] Added : 679 causal constraints over 136 iterations in 13235 ms. Result :sat
[2021-05-15 20:50:26] [INFO ] [Real]Absence check using 451 positive place invariants in 66 ms returned sat
[2021-05-15 20:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:50:26] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2021-05-15 20:50:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:50:26] [INFO ] [Real]Absence check using 451 positive place invariants in 70 ms returned sat
[2021-05-15 20:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:50:27] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2021-05-15 20:50:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:50:27] [INFO ] [Nat]Absence check using 451 positive place invariants in 69 ms returned sat
[2021-05-15 20:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:50:27] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2021-05-15 20:50:27] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints (skipped 0 transitions) in 36 ms.
[2021-05-15 20:50:40] [INFO ] Added : 694 causal constraints over 140 iterations in 13246 ms. Result :sat
[2021-05-15 20:50:41] [INFO ] [Real]Absence check using 451 positive place invariants in 68 ms returned sat
[2021-05-15 20:50:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:50:41] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2021-05-15 20:50:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:50:41] [INFO ] [Nat]Absence check using 451 positive place invariants in 71 ms returned sat
[2021-05-15 20:50:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:50:41] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2021-05-15 20:50:41] [INFO ] Computed and/alt/rep : 701/2499/701 causal constraints (skipped 0 transitions) in 36 ms.
[2021-05-15 20:50:56] [INFO ] Added : 694 causal constraints over 141 iterations in 14282 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 128 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2021-05-15 20:50:56] [INFO ] Computed 451 place invariants in 3 ms
[2021-05-15 20:50:56] [INFO ] Implicit Places using invariants in 519 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 522 ms to find 2 implicit places.
[2021-05-15 20:50:56] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 700 rows 949 cols
[2021-05-15 20:50:56] [INFO ] Computed 449 place invariants in 3 ms
[2021-05-15 20:50:57] [INFO ] Dead Transitions using invariants and state equation in 423 ms returned []
Starting structural reductions, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 52 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2021-05-15 20:50:57] [INFO ] Computed 449 place invariants in 3 ms
[2021-05-15 20:50:57] [INFO ] Implicit Places using invariants in 495 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 496 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 56 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:50:57] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 20:50:58] [INFO ] Implicit Places using invariants in 501 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:50:58] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 20:50:59] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1408 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-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 (NEQ s431 1) (EQ s31 0))], 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]]
Product exploration explored 100000 steps with 0 reset in 929 ms.
Product exploration explored 100000 steps with 0 reset in 1134 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 32 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 818 ms.
Product exploration explored 100000 steps with 0 reset in 1039 ms.
[2021-05-15 20:51:03] [INFO ] Flatten gal took : 56 ms
[2021-05-15 20:51:03] [INFO ] Flatten gal took : 57 ms
[2021-05-15 20:51:03] [INFO ] Time to serialize gal into /tmp/LTL9898385082590375685.gal : 17 ms
[2021-05-15 20:51:03] [INFO ] Time to serialize properties into /tmp/LTL7708828352266140903.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/LTL9898385082590375685.gal, -t, CGAL, -LTL, /tmp/LTL7708828352266140903.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/LTL9898385082590375685.gal -t CGAL -LTL /tmp/LTL7708828352266140903.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("((p431==0)||(p31==0))")))
Formula 0 simplified : !G"((p431==0)||(p31==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-15 20:51:18] [INFO ] Flatten gal took : 51 ms
[2021-05-15 20:51:18] [INFO ] Applying decomposition
[2021-05-15 20:51:18] [INFO ] Flatten gal took : 49 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/graph18031987815409480157.txt, -o, /tmp/graph18031987815409480157.bin, -w, /tmp/graph18031987815409480157.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/graph18031987815409480157.bin, -l, -1, -v, -w, /tmp/graph18031987815409480157.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 20:51:18] [INFO ] Decomposing Gal with order
[2021-05-15 20:51:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:51:19] [INFO ] Removed a total of 149 redundant transitions.
[2021-05-15 20:51:19] [INFO ] Flatten gal took : 99 ms
[2021-05-15 20:51:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 46 ms.
[2021-05-15 20:51:19] [INFO ] Time to serialize gal into /tmp/LTL123642159581497294.gal : 17 ms
[2021-05-15 20:51:19] [INFO ] Time to serialize properties into /tmp/LTL1520138022378072591.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/LTL123642159581497294.gal, -t, CGAL, -LTL, /tmp/LTL1520138022378072591.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/LTL123642159581497294.gal -t CGAL -LTL /tmp/LTL1520138022378072591.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G("((i13.i1.i2.u180.p431==0)||(i1.u12.p31==0))")))
Formula 0 simplified : !G"((i13.i1.i2.u180.p431==0)||(i1.u12.p31==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
112 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.22823,40784,1,0,48684,461,4300,85245,120,2407,106747
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-050A-02 finished in 24434 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 13 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:51:20] [INFO ] Computed 451 place invariants in 3 ms
[2021-05-15 20:51:21] [INFO ] Implicit Places using invariants in 494 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:51:21] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:51:22] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1417 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:51:22] [INFO ] Computed 451 place invariants in 4 ms
[2021-05-15 20:51:22] [INFO ] Dead Transitions using invariants and state equation in 455 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s488 0) (EQ s492 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 1795 ms.
Product exploration explored 100000 steps with 20000 reset in 1900 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 1738 ms.
Product exploration explored 100000 steps with 20000 reset in 1892 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 953 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 702
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 702
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 953 transition count 702
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 123 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2021-05-15 20:51:31] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:51:31] [INFO ] Computed 451 place invariants in 4 ms
[2021-05-15 20:51:32] [INFO ] Dead Transitions using invariants and state equation in 467 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Product exploration explored 100000 steps with 20000 reset in 4418 ms.
Product exploration explored 100000 steps with 20000 reset in 4511 ms.
[2021-05-15 20:51:41] [INFO ] Flatten gal took : 43 ms
[2021-05-15 20:51:41] [INFO ] Flatten gal took : 42 ms
[2021-05-15 20:51:41] [INFO ] Time to serialize gal into /tmp/LTL14075807717730406186.gal : 5 ms
[2021-05-15 20:51:41] [INFO ] Time to serialize properties into /tmp/LTL6128294439670705528.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/LTL14075807717730406186.gal, -t, CGAL, -LTL, /tmp/LTL6128294439670705528.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/LTL14075807717730406186.gal -t CGAL -LTL /tmp/LTL6128294439670705528.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("((p488==0)||(p492==1))")))))))
Formula 0 simplified : !XXXXF"((p488==0)||(p492==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 items max in DFS search stack
932 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.39636,157708,1,0,9,757409,20,0,23561,320911,18
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-050A-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-050A-03 finished in 30596 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((F(p0)&&G(p1)&&X(F(p2)))||G((F(p0)&&p3)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 22 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:51:52] [INFO ] Computed 451 place invariants in 1 ms
[2021-05-15 20:51:52] [INFO ] Implicit Places using invariants in 501 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:51:52] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:51:53] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1407 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:51:53] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:51:54] [INFO ] Dead Transitions using invariants and state equation in 463 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (NOT p2), (OR (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-050A-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p3)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p3), acceptance={} source=1 dest: 6}, { cond=(AND p1 p3), acceptance={} source=1 dest: 7}, { cond=(AND p1 p3), acceptance={} source=1 dest: 8}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={} source=6 dest: 3}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=7 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={} source=7 dest: 6}, { cond=(AND p1 p3), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(AND (NEQ s729 0) (NEQ s714 1)), p3:(AND (NEQ s729 0) (NEQ s714 1)), p0:(NEQ s555 1), p2:(OR (AND (NEQ s17 0) (NEQ s166 1)) (AND (NEQ s729 0) (NEQ s714 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, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050A-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-04 finished in 3548 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 66 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2021-05-15 20:51:54] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:51:55] [INFO ] Implicit Places using invariants in 520 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 522 ms to find 2 implicit places.
[2021-05-15 20:51:55] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 700 rows 949 cols
[2021-05-15 20:51:55] [INFO ] Computed 449 place invariants in 2 ms
[2021-05-15 20:51:55] [INFO ] Dead Transitions using invariants and state equation in 459 ms returned []
Starting structural reductions, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 30 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2021-05-15 20:51:55] [INFO ] Computed 449 place invariants in 1 ms
[2021-05-15 20:51:56] [INFO ] Implicit Places using invariants in 498 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 499 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 36 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:51:56] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 20:51:56] [INFO ] Implicit Places using invariants in 513 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:51:56] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 20:51:58] [INFO ] Implicit Places using invariants and state equation in 1874 ms returned []
Implicit Place search using SMT with State Equation took 2388 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-050A-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s28 0) (EQ s119 1)), p0:(OR (EQ s388 0) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 810 ms.
Product exploration explored 100000 steps with 0 reset in 1042 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 816 ms.
Product exploration explored 100000 steps with 0 reset in 1041 ms.
[2021-05-15 20:52:04] [INFO ] Flatten gal took : 40 ms
[2021-05-15 20:52:04] [INFO ] Flatten gal took : 40 ms
[2021-05-15 20:52:04] [INFO ] Time to serialize gal into /tmp/LTL15421844033020639682.gal : 5 ms
[2021-05-15 20:52:04] [INFO ] Time to serialize properties into /tmp/LTL12256278507706377582.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/LTL15421844033020639682.gal, -t, CGAL, -LTL, /tmp/LTL12256278507706377582.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/LTL15421844033020639682.gal -t CGAL -LTL /tmp/LTL12256278507706377582.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((p388==0)||(p38==1))")))||(G("((p28==0)||(p119==1))")))))
Formula 0 simplified : !F(GF"((p388==0)||(p38==1))" | G"((p28==0)||(p119==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1347 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.5573,256048,1,0,53,1.32767e+06,34,32,24051,949066,136
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-050A-05 finished in 24328 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 43 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2021-05-15 20:52:19] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:52:19] [INFO ] Implicit Places using invariants in 519 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 521 ms to find 2 implicit places.
[2021-05-15 20:52:19] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 700 rows 949 cols
[2021-05-15 20:52:19] [INFO ] Computed 449 place invariants in 1 ms
[2021-05-15 20:52:20] [INFO ] Dead Transitions using invariants and state equation in 443 ms returned []
Starting structural reductions, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 25 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2021-05-15 20:52:20] [INFO ] Computed 449 place invariants in 2 ms
[2021-05-15 20:52:20] [INFO ] Implicit Places using invariants in 496 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 497 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 34 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:52:20] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 20:52:21] [INFO ] Implicit Places using invariants in 502 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:52:21] [INFO ] Computed 448 place invariants in 6 ms
[2021-05-15 20:52:22] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1397 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 2460 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-06 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 (EQ s230 0) (EQ s213 1) (EQ s180 0) (EQ s491 1))], 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]]
Product exploration explored 100000 steps with 0 reset in 831 ms.
Product exploration explored 100000 steps with 0 reset in 1047 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 28 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 818 ms.
Product exploration explored 100000 steps with 0 reset in 1050 ms.
[2021-05-15 20:52:28] [INFO ] Flatten gal took : 43 ms
[2021-05-15 20:52:28] [INFO ] Flatten gal took : 42 ms
[2021-05-15 20:52:30] [INFO ] Time to serialize gal into /tmp/LTL14311257126947450103.gal : 3 ms
[2021-05-15 20:52:30] [INFO ] Time to serialize properties into /tmp/LTL8729758187579010152.ltl : 371 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/LTL14311257126947450103.gal, -t, CGAL, -LTL, /tmp/LTL8729758187579010152.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/LTL14311257126947450103.gal -t CGAL -LTL /tmp/LTL8729758187579010152.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("((((p230==0)||(p213==1))||(p180==0))||(p491==1))")))
Formula 0 simplified : !G"((((p230==0)||(p213==1))||(p180==0))||(p491==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-15 20:52:45] [INFO ] Flatten gal took : 41 ms
[2021-05-15 20:52:45] [INFO ] Applying decomposition
[2021-05-15 20:52:45] [INFO ] Flatten gal took : 41 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/graph8557973117237303374.txt, -o, /tmp/graph8557973117237303374.bin, -w, /tmp/graph8557973117237303374.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/graph8557973117237303374.bin, -l, -1, -v, -w, /tmp/graph8557973117237303374.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 20:52:45] [INFO ] Decomposing Gal with order
[2021-05-15 20:52:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:52:45] [INFO ] Removed a total of 149 redundant transitions.
[2021-05-15 20:52:45] [INFO ] Flatten gal took : 54 ms
[2021-05-15 20:52:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2021-05-15 20:52:45] [INFO ] Time to serialize gal into /tmp/LTL6449879860602842028.gal : 14 ms
[2021-05-15 20:52:45] [INFO ] Time to serialize properties into /tmp/LTL1123753564852456585.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/LTL6449879860602842028.gal, -t, CGAL, -LTL, /tmp/LTL1123753564852456585.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/LTL6449879860602842028.gal -t CGAL -LTL /tmp/LTL1123753564852456585.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G("((((i6.i0.i1.u96.p230==0)||(i6.i0.i1.u89.p213==1))||(i5.i1.i2.u74.p180==0))||(i14.i1.i1.u206.p491==1))")))
Formula 0 simplified : !G"((((i6.i0.i1.u96.p230==0)||(i6.i0.i1.u89.p213==1))||(i5.i1.i2.u74.p180==0))||(i14.i1.i1.u206.p491==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1765626082895566985
[2021-05-15 20:53:00] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1765626082895566985
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/ltsmin1765626082895566985]
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/ltsmin1765626082895566985] 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/ltsmin1765626082895566985] 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 ShieldIIPt-PT-050A-06 finished in 42761 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 11 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:53:01] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:53:02] [INFO ] Implicit Places using invariants in 506 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:53:02] [INFO ] Computed 451 place invariants in 11 ms
[2021-05-15 20:53:03] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1427 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:53:03] [INFO ] Computed 451 place invariants in 9 ms
[2021-05-15 20:53:03] [INFO ] Dead Transitions using invariants and state equation in 470 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 8353 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-08 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:(AND (NEQ s126 0) (NEQ s141 1) (NEQ s672 0) (NEQ s527 1))], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050A-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-08 finished in 10275 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 952 transition count 700
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 950 transition count 700
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 948 transition count 699
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 948 transition count 698
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 947 transition count 698
Applied a total of 8 rules in 57 ms. Remains 947 /953 variables (removed 6) and now considering 698/702 (removed 4) transitions.
// Phase 1: matrix 698 rows 947 cols
[2021-05-15 20:53:12] [INFO ] Computed 449 place invariants in 1 ms
[2021-05-15 20:53:12] [INFO ] Implicit Places using invariants in 485 ms returned [936]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 487 ms to find 1 implicit places.
[2021-05-15 20:53:12] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:53:12] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 20:53:13] [INFO ] Dead Transitions using invariants and state equation in 449 ms returned []
Starting structural reductions, iteration 1 : 946/953 places, 698/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 945 transition count 697
Applied a total of 2 rules in 33 ms. Remains 945 /946 variables (removed 1) and now considering 697/698 (removed 1) transitions.
// Phase 1: matrix 697 rows 945 cols
[2021-05-15 20:53:13] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 20:53:13] [INFO ] Implicit Places using invariants in 489 ms returned []
// Phase 1: matrix 697 rows 945 cols
[2021-05-15 20:53:13] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 20:53:14] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1335 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 945/953 places, 697/702 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s753 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 39 reset in 803 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 1 ms.
FORMULA ShieldIIPt-PT-050A-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-12 finished in 3209 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&(F(p2)||p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 11 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:53:15] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:53:15] [INFO ] Implicit Places using invariants in 505 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:53:15] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:53:16] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1430 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:53:16] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:53:17] [INFO ] Dead Transitions using invariants and state equation in 472 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 9801 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : ShieldIIPt-PT-050A-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (EQ s513 0) (EQ s918 1)), p1:(OR (EQ s535 0) (EQ s416 1)), p2:(AND (EQ s416 0) (EQ s535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050A-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-13 finished in 11732 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p1||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 38 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2021-05-15 20:53:27] [INFO ] Computed 451 place invariants in 1 ms
[2021-05-15 20:53:27] [INFO ] Implicit Places using invariants in 516 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 517 ms to find 2 implicit places.
[2021-05-15 20:53:27] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 700 rows 949 cols
[2021-05-15 20:53:27] [INFO ] Computed 449 place invariants in 2 ms
[2021-05-15 20:53:28] [INFO ] Dead Transitions using invariants and state equation in 454 ms returned []
Starting structural reductions, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 30 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2021-05-15 20:53:28] [INFO ] Computed 449 place invariants in 2 ms
[2021-05-15 20:53:28] [INFO ] Implicit Places using invariants in 500 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 501 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 31 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:53:28] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 20:53:29] [INFO ] Implicit Places using invariants in 504 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:53:29] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 20:53:30] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1407 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldIIPt-PT-050A-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (NEQ s812 0) (NEQ s604 1)) (AND (NEQ s812 0) (NEQ s604 1))), p1:(AND (NEQ s812 0) (NEQ s604 1)), p2:(OR (NEQ s171 1) (NEQ s604 0) (NEQ s812 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 839 ms.
Stack based approach found an accepted trace after 84 steps with 0 reset with depth 85 and stack size 85 in 2 ms.
FORMULA ShieldIIPt-PT-050A-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-14 finished in 3919 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 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 34 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2021-05-15 20:53:30] [INFO ] Computed 451 place invariants in 1 ms
[2021-05-15 20:53:31] [INFO ] Implicit Places using invariants in 525 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 526 ms to find 2 implicit places.
[2021-05-15 20:53:31] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 700 rows 949 cols
[2021-05-15 20:53:31] [INFO ] Computed 449 place invariants in 2 ms
[2021-05-15 20:53:31] [INFO ] Dead Transitions using invariants and state equation in 451 ms returned []
Starting structural reductions, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 21 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2021-05-15 20:53:31] [INFO ] Computed 449 place invariants in 1 ms
[2021-05-15 20:53:32] [INFO ] Implicit Places using invariants in 515 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 516 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 29 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:53:32] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 20:53:33] [INFO ] Implicit Places using invariants in 515 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:53:33] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 20:53:33] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 8891 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-15 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:(EQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 810 ms.
Product exploration explored 100000 steps with 1 reset in 1047 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 804 ms.
Product exploration explored 100000 steps with 1 reset in 1036 ms.
[2021-05-15 20:53:46] [INFO ] Flatten gal took : 38 ms
[2021-05-15 20:53:46] [INFO ] Flatten gal took : 38 ms
[2021-05-15 20:53:46] [INFO ] Time to serialize gal into /tmp/LTL8463973825085884814.gal : 3 ms
[2021-05-15 20:53:46] [INFO ] Time to serialize properties into /tmp/LTL4070529164580760668.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/LTL8463973825085884814.gal, -t, CGAL, -LTL, /tmp/LTL4070529164580760668.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/LTL8463973825085884814.gal -t CGAL -LTL /tmp/LTL4070529164580760668.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(p19==1)"))))
Formula 0 simplified : !GF"(p19==1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1126 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.3323,187576,1,0,8,947478,24,0,24035,362091,29
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-050A-15 finished in 27881 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8813933998361118979
[2021-05-15 20:53:58] [INFO ] Computing symmetric may disable matrix : 702 transitions.
[2021-05-15 20:53:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 20:53:58] [INFO ] Computing symmetric may enable matrix : 702 transitions.
[2021-05-15 20:53:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 20:53:58] [INFO ] Applying decomposition
[2021-05-15 20:53:58] [INFO ] Flatten gal took : 43 ms
[2021-05-15 20:53:58] [INFO ] Computing Do-Not-Accords matrix : 702 transitions.
[2021-05-15 20:53:58] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 20:53:58] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8813933998361118979
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/ltsmin8813933998361118979]
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/graph3569675968511153531.txt, -o, /tmp/graph3569675968511153531.bin, -w, /tmp/graph3569675968511153531.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/graph3569675968511153531.bin, -l, -1, -v, -w, /tmp/graph3569675968511153531.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 20:53:58] [INFO ] Decomposing Gal with order
[2021-05-15 20:53:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:53:59] [INFO ] Removed a total of 150 redundant transitions.
[2021-05-15 20:53:59] [INFO ] Flatten gal took : 56 ms
[2021-05-15 20:53:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2021-05-15 20:53:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality14636828146031758098.gal : 9 ms
[2021-05-15 20:53:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality11974465906178832278.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/LTLCardinality14636828146031758098.gal, -t, CGAL, -LTL, /tmp/LTLCardinality11974465906178832278.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/LTLCardinality14636828146031758098.gal -t CGAL -LTL /tmp/LTLCardinality11974465906178832278.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G("((((i6.i0.i1.u96.p230==0)||(i6.i0.i1.u89.p213==1))||(i4.i1.i2.u74.p180==0))||(i13.u206.p491==1))")))
Formula 0 simplified : !G"((((i6.i0.i1.u96.p230==0)||(i6.i0.i1.u89.p213==1))||(i4.i1.i2.u74.p180==0))||(i13.u206.p491==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 12674 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8813933998361118979]
Link finished in 55 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, -p, --pins-guards, --when, --ltl, []((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin8813933998361118979]
WARNING : LTSmin timed out (>360 s) on command 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, -p, --pins-guards, --when, --ltl, []((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin8813933998361118979]
Retrying LTSmin with larger timeout 2880 s
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, -p, --pins-guards, --when, --ltl, []((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin8813933998361118979]
LTSmin run took 149738 ms.
FORMULA ShieldIIPt-PT-050A-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621112566262

--------------------
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="ShieldIIPt-PT-050A"
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 ShieldIIPt-PT-050A, 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-162098205100484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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