Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r121-tall-162075406900380.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 IOTPpurchase-PT-C12M10P15D17, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406900380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rwxr-xr-x 1 mcc users 60K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-00
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-01
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-02
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-03
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-04
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-05
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-06
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-07
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-08
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-09
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-10
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-11
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-12
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-13
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-14
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-15

=== Now, execution of the tool begins

BK_START 1620838672214

Running Version 0
[2021-05-12 16:57:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 16:57:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:57:53] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2021-05-12 16:57:53] [INFO ] Transformed 111 places.
[2021-05-12 16:57:53] [INFO ] Transformed 45 transitions.
[2021-05-12 16:57:53] [INFO ] Parsed PT model containing 111 places and 45 transitions in 72 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 16:57:53] [INFO ] Initial state test concluded for 3 properties.
Support contains 37 out of 111 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 74 transition count 45
Applied a total of 37 rules in 12 ms. Remains 74 /111 variables (removed 37) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 74 cols
[2021-05-12 16:57:53] [INFO ] Computed 30 place invariants in 12 ms
[2021-05-12 16:57:53] [INFO ] Implicit Places using invariants in 112 ms returned [12, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 136 ms to find 2 implicit places.
// Phase 1: matrix 45 rows 72 cols
[2021-05-12 16:57:53] [INFO ] Computed 28 place invariants in 7 ms
[2021-05-12 16:57:54] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 72/111 places, 45/45 transitions.
Applied a total of 0 rules in 7 ms. Remains 72 /72 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 72 cols
[2021-05-12 16:57:54] [INFO ] Computed 28 place invariants in 3 ms
[2021-05-12 16:57:54] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 2 iterations. Remains : 72/111 places, 45/45 transitions.
[2021-05-12 16:57:54] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-12 16:57:54] [INFO ] Flatten gal took : 24 ms
FORMULA IOTPpurchase-PT-C12M10P15D17-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:57:54] [INFO ] Flatten gal took : 7 ms
[2021-05-12 16:57:54] [INFO ] Input system was already deterministic with 45 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 360 ms. (steps per millisecond=277 ) properties (out of 25) seen :23
Running SMT prover for 2 properties.
// Phase 1: matrix 45 rows 72 cols
[2021-05-12 16:57:54] [INFO ] Computed 28 place invariants in 2 ms
[2021-05-12 16:57:54] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2021-05-12 16:57:54] [INFO ] [Real]Absence check using 17 positive and 11 generalized place invariants in 2 ms returned sat
[2021-05-12 16:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:57:54] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-12 16:57:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:57:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2021-05-12 16:57:54] [INFO ] [Nat]Absence check using 17 positive and 11 generalized place invariants in 1 ms returned sat
[2021-05-12 16:57:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:57:54] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-12 16:57:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 16:57:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-12 16:57:54] [INFO ] Computed and/alt/rep : 44/56/44 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 16:57:54] [INFO ] Added : 43 causal constraints over 9 iterations in 61 ms. Result :sat
[2021-05-12 16:57:54] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2021-05-12 16:57:54] [INFO ] Initial state test concluded for 1 properties.
FORMULA IOTPpurchase-PT-C12M10P15D17-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 65 transition count 45
Applied a total of 7 rules in 2 ms. Remains 65 /72 variables (removed 7) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:57:54] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-12 16:57:54] [INFO ] Implicit Places using invariants in 34 ms returned [14, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:57:54] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-12 16:57:55] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 63/72 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:57:55] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:57:55] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-00 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LEQ 3 s43), p0:(LEQ 1 s16)], 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 2 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-00 finished in 382 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 66 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 18 rules applied. Total rules applied 26 place count 55 transition count 31
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 34 place count 48 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 47 transition count 30
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 35 place count 47 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 61 place count 31 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 61 place count 31 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 29 transition count 18
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 86 place count 16 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 87 place count 15 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 87 place count 15 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 90 place count 13 transition count 9
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 91 place count 13 transition count 8
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 94 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 96 place count 10 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 97 place count 9 transition count 6
Applied a total of 97 rules in 14 ms. Remains 9 /72 variables (removed 63) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 9 cols
[2021-05-12 16:57:55] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 16:57:55] [INFO ] Implicit Places using invariants in 16 ms returned [1, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
[2021-05-12 16:57:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-12 16:57:55] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:57:55] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 7/72 places, 6/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 3 transition count 3
Applied a total of 7 rules in 1 ms. Remains 3 /7 variables (removed 4) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 16:57:55] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:57:55] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 16:57:55] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-12 16:57:55] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 3/72 places, 3/45 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s2), p1:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4 reset in 178 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-01 finished in 337 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G(p1)))], workingDir=/home/mcc/execution]
Support contains 1 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 65 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 26 rules applied. Total rules applied 37 place count 50 transition count 25
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 48 place count 39 transition count 25
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 48 place count 39 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 66 place count 28 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 66 place count 28 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 27 transition count 17
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 85 place count 17 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 16 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 86 place count 16 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 15 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 93 place count 12 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 96 place count 10 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 97 place count 10 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 99 place count 8 transition count 5
Applied a total of 99 rules in 7 ms. Remains 8 /72 variables (removed 64) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 8 cols
[2021-05-12 16:57:55] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 16:57:55] [INFO ] Implicit Places using invariants in 10 ms returned [1, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 11 ms to find 2 implicit places.
[2021-05-12 16:57:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-12 16:57:55] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:57:55] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 6/72 places, 5/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 6 transition count 3
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 2 transition count 2
Applied a total of 7 rules in 1 ms. Remains 2 /6 variables (removed 4) and now considering 2/5 (removed 3) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 16:57:55] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:57:55] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 16:57:55] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:57:55] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/72 places, 2/45 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(OR (GT 3 s1) (GT 1 s1)), p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-02 finished in 114 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1) U (G((p0 U p1))||((p0 U p1)&&X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 66 transition count 45
Applied a total of 6 rules in 2 ms. Remains 66 /72 variables (removed 6) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2021-05-12 16:57:55] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-12 16:57:55] [INFO ] Implicit Places using invariants in 37 ms returned [15, 18, 27]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:57:55] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-12 16:57:55] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 63/72 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:57:55] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-12 16:57:55] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-03 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s14 s34), p0:(LEQ s26 s6), p2:(GT s53 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 188 reset in 241 ms.
Product exploration explored 100000 steps with 178 reset in 241 ms.
Knowledge obtained : [p1, p0, (NOT p2)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 180 reset in 203 ms.
Product exploration explored 100000 steps with 176 reset in 232 ms.
Applying partial POR strategy [true, true, true, true, true]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 6 out of 63 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 63/63 places, 45/45 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 63 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 8 place count 63 transition count 45
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 19 place count 63 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 62 transition count 44
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 62 transition count 44
Deduced a syphon composed of 24 places in 1 ms
Applied a total of 27 rules in 9 ms. Remains 62 /63 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:57:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 62 cols
[2021-05-12 16:57:57] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-12 16:57:57] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/63 places, 44/45 transitions.
Product exploration explored 100000 steps with 727 reset in 311 ms.
Product exploration explored 100000 steps with 699 reset in 205 ms.
[2021-05-12 16:57:57] [INFO ] Flatten gal took : 5 ms
[2021-05-12 16:57:57] [INFO ] Flatten gal took : 5 ms
[2021-05-12 16:57:57] [INFO ] Time to serialize gal into /tmp/LTL16097350618125372860.gal : 1 ms
[2021-05-12 16:57:57] [INFO ] Time to serialize properties into /tmp/LTL7196267904860924361.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/LTL16097350618125372860.gal, -t, CGAL, -LTL, /tmp/LTL7196267904860924361.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/LTL16097350618125372860.gal -t CGAL -LTL /tmp/LTL7196267904860924361.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)")U("(Organization_p21_8<=p11_3)"))U((G(("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)")U("(Organization_p21_8<=p11_3)")))||((("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)")U("(Organization_p21_8<=p11_3)"))&&(X(G("(p5_1>Status_p21_14)")))))))
Formula 0 simplified : !(("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)" U "(Organization_p21_8<=p11_3)") U (G("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)" U "(Organization_p21_8<=p11_3)") | (("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)" U "(Organization_p21_8<=p11_3)") & XG"(p5_1>Status_p21_14)")))
Detected timeout of ITS tools.
[2021-05-12 16:58:12] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:58:12] [INFO ] Applying decomposition
[2021-05-12 16:58:12] [INFO ] Flatten gal took : 3 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/graph1220037251342899321.txt, -o, /tmp/graph1220037251342899321.bin, -w, /tmp/graph1220037251342899321.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/graph1220037251342899321.bin, -l, -1, -v, -w, /tmp/graph1220037251342899321.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:58:12] [INFO ] Decomposing Gal with order
[2021-05-12 16:58:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:58:13] [INFO ] Flatten gal took : 33 ms
[2021-05-12 16:58:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-12 16:58:13] [INFO ] Time to serialize gal into /tmp/LTL470923362435745594.gal : 5 ms
[2021-05-12 16:58:13] [INFO ] Time to serialize properties into /tmp/LTL9957764847340376389.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/LTL470923362435745594.gal, -t, CGAL, -LTL, /tmp/LTL9957764847340376389.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/LTL470923362435745594.gal -t CGAL -LTL /tmp/LTL9957764847340376389.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("(gu11.Status_p22_7<=gu11.DeliveryHandlerDelivery_p8_0)")U("(gu16.Organization_p21_8<=gu16.p11_3)"))U((G(("(gu11.Status_p22_7<=gu11.DeliveryHandlerDelivery_p8_0)")U("(gu16.Organization_p21_8<=gu16.p11_3)")))||((("(gu11.Status_p22_7<=gu11.DeliveryHandlerDelivery_p8_0)")U("(gu16.Organization_p21_8<=gu16.p11_3)"))&&(X(G("(gi0.gu9.p5_1>gi0.gu9.Status_p21_14)")))))))
Formula 0 simplified : !(("(gu11.Status_p22_7<=gu11.DeliveryHandlerDelivery_p8_0)" U "(gu16.Organization_p21_8<=gu16.p11_3)") U (G("(gu11.Status_p22_7<=gu11.DeliveryHandlerDelivery_p8_0)" U "(gu16.Organization_p21_8<=gu16.p11_3)") | (("(gu11.Status_p22_7<=gu11.DeliveryHandlerDelivery_p8_0)" U "(gu16.Organization_p21_8<=gu16.p11_3)") & XG"(gi0.gu9.p5_1>gi0.gu9.Status_p21_14)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3079632326926198288
[2021-05-12 16:58:28] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3079632326926198288
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/ltsmin3079632326926198288]
Compilation finished in 273 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3079632326926198288]
Link finished in 36 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (((LTLAPp0==true) U (LTLAPp1==true)) U ([](((LTLAPp0==true) U (LTLAPp1==true)))||(((LTLAPp0==true) U (LTLAPp1==true))&&X([]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3079632326926198288]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property IOTPpurchase-PT-C12M10P15D17-03 finished in 47355 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 65 transition count 45
Applied a total of 7 rules in 2 ms. Remains 65 /72 variables (removed 7) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:58:43] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-12 16:58:43] [INFO ] Implicit Places using invariants in 31 ms returned [14, 17, 26]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 32 ms to find 3 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:58:43] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-12 16:58:43] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 62/72 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:58:43] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:58:43] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 62/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (GT s16 s50) (GT s38 s24)), p0:(LEQ s38 s24)], 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 134 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-04 finished in 195 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((p0&&F(p1)))||G((p2&&X((p2 U p0)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 65 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 28 place count 54 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 36 place count 46 transition count 30
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 36 place count 46 transition count 21
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 59 place count 32 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 59 place count 32 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 63 place count 30 transition count 19
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 22 transition count 13
Applied a total of 77 rules in 5 ms. Remains 22 /72 variables (removed 50) and now considering 13/45 (removed 32) transitions.
// Phase 1: matrix 13 rows 22 cols
[2021-05-12 16:58:43] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-12 16:58:43] [INFO ] Implicit Places using invariants in 19 ms returned [2, 7, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 19 ms to find 3 implicit places.
[2021-05-12 16:58:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2021-05-12 16:58:43] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 16:58:43] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 19/72 places, 13/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 19 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 17 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 15 transition count 10
Applied a total of 7 rules in 2 ms. Remains 15 /19 variables (removed 4) and now considering 10/13 (removed 3) transitions.
// Phase 1: matrix 10 rows 15 cols
[2021-05-12 16:58:43] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 16:58:43] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 10 rows 15 cols
[2021-05-12 16:58:43] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 16:58:43] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 15/72 places, 10/45 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-05 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s5 s10), p2:(LEQ 2 s0), p1:(LEQ s12 s9)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 20299 reset in 129 ms.
Stack based approach found an accepted trace after 1269 steps with 285 reset with depth 11 and stack size 11 in 2 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-05 finished in 311 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 65 transition count 45
Applied a total of 7 rules in 12 ms. Remains 65 /72 variables (removed 7) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:58:43] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-12 16:58:43] [INFO ] Implicit Places using invariants in 46 ms returned [14, 17, 26]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:58:43] [INFO ] Computed 18 place invariants in 7 ms
[2021-05-12 16:58:43] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 62/72 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:58:43] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:58:43] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 62/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-06 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:(LEQ s11 s21)], 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 IOTPpurchase-PT-C12M10P15D17-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-06 finished in 202 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 37
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 26 rules applied. Total rules applied 36 place count 51 transition count 25
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 49 place count 39 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 38 transition count 24
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 50 place count 38 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 68 place count 27 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 68 place count 27 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 26 transition count 16
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 82 place count 19 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 18 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 83 place count 18 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 85 place count 17 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 90 place count 14 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 94 place count 11 transition count 7
Applied a total of 94 rules in 5 ms. Remains 11 /72 variables (removed 61) and now considering 7/45 (removed 38) transitions.
// Phase 1: matrix 7 rows 11 cols
[2021-05-12 16:58:43] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:58:43] [INFO ] Implicit Places using invariants in 18 ms returned [1, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 18 ms to find 2 implicit places.
[2021-05-12 16:58:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-12 16:58:43] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:58:43] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Starting structural reductions, iteration 1 : 9/72 places, 7/45 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 8 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 7 place count 5 transition count 4
Applied a total of 7 rules in 1 ms. Remains 5 /9 variables (removed 4) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 5 cols
[2021-05-12 16:58:43] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:58:43] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-12 16:58:43] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 16:58:43] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/72 places, 4/45 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 63 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-07 finished in 145 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 66 transition count 45
Applied a total of 6 rules in 2 ms. Remains 66 /72 variables (removed 6) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2021-05-12 16:58:43] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-12 16:58:43] [INFO ] Implicit Places using invariants in 34 ms returned [16, 19, 28]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 35 ms to find 3 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:58:43] [INFO ] Computed 19 place invariants in 7 ms
[2021-05-12 16:58:44] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 63/72 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:58:44] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-12 16:58:44] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-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:(GT s12 s15)], 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 IOTPpurchase-PT-C12M10P15D17-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-08 finished in 160 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 65 transition count 45
Applied a total of 7 rules in 1 ms. Remains 65 /72 variables (removed 7) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:58:44] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-12 16:58:44] [INFO ] Implicit Places using invariants in 40 ms returned [14, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:58:44] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-12 16:58:44] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 63/72 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:58:44] [INFO ] Computed 19 place invariants in 6 ms
[2021-05-12 16:58:44] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s24 s62)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 63 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 63/63 places, 45/45 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 63 transition count 45
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 9 place count 63 transition count 45
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 23 place count 63 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 62 transition count 44
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 62 transition count 44
Deduced a syphon composed of 28 places in 1 ms
Applied a total of 31 rules in 5 ms. Remains 62 /63 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:58:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 62 cols
[2021-05-12 16:58:44] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:58:44] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/63 places, 44/45 transitions.
Product exploration explored 100000 steps with 50000 reset in 388 ms.
Product exploration explored 100000 steps with 50000 reset in 382 ms.
[2021-05-12 16:58:45] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:58:45] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:58:45] [INFO ] Time to serialize gal into /tmp/LTL17861342943740484121.gal : 1 ms
[2021-05-12 16:58:45] [INFO ] Time to serialize properties into /tmp/LTL16071511794348267898.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/LTL17861342943740484121.gal, -t, CGAL, -LTL, /tmp/LTL16071511794348267898.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/LTL17861342943740484121.gal -t CGAL -LTL /tmp/LTL16071511794348267898.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(Status_p22_11<=p8_3)"))))
Formula 0 simplified : !XF"(Status_p22_11<=p8_3)"
Detected timeout of ITS tools.
[2021-05-12 16:59:00] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:59:00] [INFO ] Applying decomposition
[2021-05-12 16:59:00] [INFO ] Flatten gal took : 3 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/graph15385599042293152973.txt, -o, /tmp/graph15385599042293152973.bin, -w, /tmp/graph15385599042293152973.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/graph15385599042293152973.bin, -l, -1, -v, -w, /tmp/graph15385599042293152973.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:59:00] [INFO ] Decomposing Gal with order
[2021-05-12 16:59:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:59:00] [INFO ] Flatten gal took : 5 ms
[2021-05-12 16:59:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 16:59:00] [INFO ] Time to serialize gal into /tmp/LTL7549028944487939420.gal : 1 ms
[2021-05-12 16:59:00] [INFO ] Time to serialize properties into /tmp/LTL12644182792339071798.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/LTL7549028944487939420.gal, -t, CGAL, -LTL, /tmp/LTL12644182792339071798.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/LTL7549028944487939420.gal -t CGAL -LTL /tmp/LTL12644182792339071798.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(gu14.Status_p22_11<=gu14.p8_3)"))))
Formula 0 simplified : !XF"(gu14.Status_p22_11<=gu14.p8_3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13250692873149645905
[2021-05-12 16:59:15] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13250692873149645905
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/ltsmin13250692873149645905]
Compilation finished in 211 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13250692873149645905]
Link finished in 31 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin13250692873149645905]
LTSmin run took 328 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C12M10P15D17-09 finished in 32326 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&F((p1 U ((p1&&G(p2))||G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 65 transition count 45
Applied a total of 7 rules in 1 ms. Remains 65 /72 variables (removed 7) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:59:16] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-12 16:59:16] [INFO ] Implicit Places using invariants in 25 ms returned [14, 17, 27]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:59:16] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-12 16:59:16] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 62/72 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2021-05-12 16:59:16] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:59:16] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 62/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s16), p2:(LEQ s32 s23), p1:(LEQ s19 s49)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 216 ms.
Product exploration explored 100000 steps with 0 reset in 298 ms.
Knowledge obtained : [(NOT p0), (NOT p2), p1]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 227 ms.
Product exploration explored 100000 steps with 0 reset in 291 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 5 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 62/62 places, 45/45 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 62 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 8 place count 62 transition count 45
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 19 place count 62 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 62 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 61 transition count 44
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 61 transition count 44
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 27 rules in 4 ms. Remains 61 /62 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:59:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 61 cols
[2021-05-12 16:59:18] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-12 16:59:18] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/62 places, 44/45 transitions.
Product exploration explored 100000 steps with 0 reset in 227 ms.
Stack based approach found an accepted trace after 2673 steps with 0 reset with depth 2674 and stack size 2673 in 7 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-10 finished in 1866 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 65 transition count 45
Applied a total of 7 rules in 1 ms. Remains 65 /72 variables (removed 7) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2021-05-12 16:59:18] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-12 16:59:18] [INFO ] Implicit Places using invariants in 26 ms returned [17, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:59:18] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-12 16:59:18] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 63/72 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2021-05-12 16:59:18] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-12 16:59:18] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/72 places, 45/45 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s14 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 555 reset in 163 ms.
Product exploration explored 100000 steps with 548 reset in 241 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 541 reset in 149 ms.
Product exploration explored 100000 steps with 554 reset in 165 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 63 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 63/63 places, 45/45 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 63 transition count 45
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 9 place count 63 transition count 45
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 22 place count 63 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 62 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 62 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 30 rules in 8 ms. Remains 62 /63 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2021-05-12 16:59:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 62 cols
[2021-05-12 16:59:19] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-12 16:59:19] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/63 places, 44/45 transitions.
Product exploration explored 100000 steps with 1815 reset in 146 ms.
Product exploration explored 100000 steps with 1850 reset in 161 ms.
[2021-05-12 16:59:19] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:59:19] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:59:19] [INFO ] Time to serialize gal into /tmp/LTL6418542577845645321.gal : 0 ms
[2021-05-12 16:59:19] [INFO ] Time to serialize properties into /tmp/LTL2895351187971111335.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/LTL6418542577845645321.gal, -t, CGAL, -LTL, /tmp/LTL2895351187971111335.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/LTL6418542577845645321.gal -t CGAL -LTL /tmp/LTL2895351187971111335.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(Organization_p22_5>DeliveryNote_p22_12)"))))
Formula 0 simplified : !XF"(Organization_p22_5>DeliveryNote_p22_12)"
Detected timeout of ITS tools.
[2021-05-12 16:59:34] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:59:34] [INFO ] Applying decomposition
[2021-05-12 16:59:34] [INFO ] Flatten gal took : 2 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/graph4464885305819554725.txt, -o, /tmp/graph4464885305819554725.bin, -w, /tmp/graph4464885305819554725.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/graph4464885305819554725.bin, -l, -1, -v, -w, /tmp/graph4464885305819554725.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:59:34] [INFO ] Decomposing Gal with order
[2021-05-12 16:59:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:59:34] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:59:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 16:59:34] [INFO ] Time to serialize gal into /tmp/LTL7128099568952451716.gal : 1 ms
[2021-05-12 16:59:34] [INFO ] Time to serialize properties into /tmp/LTL7438866235798598749.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/LTL7128099568952451716.gal, -t, CGAL, -LTL, /tmp/LTL7438866235798598749.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/LTL7128099568952451716.gal -t CGAL -LTL /tmp/LTL7438866235798598749.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(gu2.Organization_p22_5>gu2.DeliveryNote_p22_12)"))))
Formula 0 simplified : !XF"(gu2.Organization_p22_5>gu2.DeliveryNote_p22_12)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13080570001956094915
[2021-05-12 16:59:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13080570001956094915
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/ltsmin13080570001956094915]
Compilation finished in 215 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13080570001956094915]
Link finished in 30 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin13080570001956094915]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property IOTPpurchase-PT-C12M10P15D17-11 finished in 46492 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 65 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 27 rules applied. Total rules applied 38 place count 50 transition count 24
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 50 place count 38 transition count 24
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 50 place count 38 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 68 place count 27 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 68 place count 27 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 25 transition count 15
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 86 place count 17 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 16 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 87 place count 16 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 90 place count 14 transition count 8
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 14 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 93 place count 12 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 93 place count 12 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 96 place count 10 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 96 place count 10 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 99 place count 8 transition count 5
Applied a total of 99 rules in 3 ms. Remains 8 /72 variables (removed 64) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 8 cols
[2021-05-12 17:00:04] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:00:04] [INFO ] Implicit Places using invariants in 26 ms returned [2, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
[2021-05-12 17:00:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-12 17:00:04] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 17:00:04] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Starting structural reductions, iteration 1 : 6/72 places, 5/45 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 4 transition count 3
Applied a total of 4 rules in 1 ms. Remains 4 /6 variables (removed 2) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 4 cols
[2021-05-12 17:00:04] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 17:00:04] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2021-05-12 17:00:04] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 17:00:04] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/72 places, 3/45 transitions.
Stuttering acceptance computed with spot in 29 ms :[true, (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-13 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:(GT s3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-13 finished in 96 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 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 65 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 27 rules applied. Total rules applied 38 place count 50 transition count 24
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 50 place count 38 transition count 24
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 50 place count 38 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 68 place count 27 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 68 place count 27 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 26 transition count 16
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 87 place count 16 transition count 9
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 89 place count 14 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 89 place count 14 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 91 place count 13 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 97 place count 9 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 98 place count 9 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 99 place count 8 transition count 5
Applied a total of 99 rules in 3 ms. Remains 8 /72 variables (removed 64) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 8 cols
[2021-05-12 17:00:04] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:00:04] [INFO ] Implicit Places using invariants in 10 ms returned [1, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 10 ms to find 2 implicit places.
[2021-05-12 17:00:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-12 17:00:04] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 17:00:04] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 6/72 places, 5/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 6 transition count 3
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 2 transition count 2
Applied a total of 7 rules in 1 ms. Remains 2 /6 variables (removed 4) and now considering 2/5 (removed 3) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 17:00:04] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:00:04] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 17:00:04] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:00:04] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/72 places, 2/45 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-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:(GT 1 s1)], 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 3606 reset in 77 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-15 finished in 179 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11249347302092685622
[2021-05-12 17:00:05] [INFO ] Computing symmetric may disable matrix : 45 transitions.
[2021-05-12 17:00:05] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 17:00:05] [INFO ] Computing symmetric may enable matrix : 45 transitions.
[2021-05-12 17:00:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 17:00:05] [INFO ] Applying decomposition
[2021-05-12 17:00:05] [INFO ] Computing Do-Not-Accords matrix : 45 transitions.
[2021-05-12 17:00:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 17:00:05] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11249347302092685622
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/ltsmin11249347302092685622]
[2021-05-12 17:00:05] [INFO ] Flatten gal took : 3 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/graph2159750141900295902.txt, -o, /tmp/graph2159750141900295902.bin, -w, /tmp/graph2159750141900295902.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/graph2159750141900295902.bin, -l, -1, -v, -w, /tmp/graph2159750141900295902.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 17:00:05] [INFO ] Decomposing Gal with order
[2021-05-12 17:00:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 17:00:05] [INFO ] Flatten gal took : 5 ms
[2021-05-12 17:00:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 17:00:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality9331897206371453292.gal : 1 ms
[2021-05-12 17:00:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality9215075441787632352.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/LTLCardinality9331897206371453292.gal, -t, CGAL, -LTL, /tmp/LTLCardinality9215075441787632352.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/LTLCardinality9331897206371453292.gal -t CGAL -LTL /tmp/LTLCardinality9215075441787632352.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !(((("(gu15.Status_p22_7<=gu15.DeliveryHandlerDelivery_p8_0)")U("(gu18.Organization_p21_8<=gu18.p11_3)"))U(((("(gu15.Status_p22_7<=gu15.DeliveryHandlerDelivery_p8_0)")U("(gu18.Organization_p21_8<=gu18.p11_3)"))&&(X(G("(gi1.gu13.p5_1>gi1.gu13.Status_p21_14)"))))||(G(("(gu15.Status_p22_7<=gu15.DeliveryHandlerDelivery_p8_0)")U("(gu18.Organization_p21_8<=gu18.p11_3)"))))))
Formula 0 simplified : !(("(gu15.Status_p22_7<=gu15.DeliveryHandlerDelivery_p8_0)" U "(gu18.Organization_p21_8<=gu18.p11_3)") U ((("(gu15.Status_p22_7<=gu15.DeliveryHandlerDelivery_p8_0)" U "(gu18.Organization_p21_8<=gu18.p11_3)") & XG"(gi1.gu13.p5_1>gi1.gu13.Status_p21_14)") | G("(gu15.Status_p22_7<=gu15.DeliveryHandlerDelivery_p8_0)" U "(gu18.Organization_p21_8<=gu18.p11_3)")))
Compilation finished in 257 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11249347302092685622]
Link finished in 31 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (((LTLAPp0==true) U (LTLAPp1==true)) U ([](((LTLAPp0==true) U (LTLAPp1==true)))||(((LTLAPp0==true) U (LTLAPp1==true))&&X([]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11249347302092685622]
WARNING : LTSmin timed out (>240 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, --when, --ltl, (((LTLAPp0==true) U (LTLAPp1==true)) U ([](((LTLAPp0==true) U (LTLAPp1==true)))||(((LTLAPp0==true) U (LTLAPp1==true))&&X([]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11249347302092685622]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11249347302092685622]
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
WARNING : LTSmin timed out (>240 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, --when, --ltl, X(<>((LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11249347302092685622]
Retrying LTSmin with larger timeout 1920 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, --when, --ltl, (((LTLAPp0==true) U (LTLAPp1==true)) U ([](((LTLAPp0==true) U (LTLAPp1==true)))||(((LTLAPp0==true) U (LTLAPp1==true))&&X([]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11249347302092685622]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: (((LTLAPp0==true) U (LTLAPp1==true)) U ([](((LTLAPp0==true) U (LTLAPp1==true)))||(((LTLAPp0==true) U (LTLAPp1==true))&&X([]((LTLAPp2==true))))))
pins2lts-mc-linux64( 1/ 8), 0.003: "(((LTLAPp0==true) U (LTLAPp1==true)) U ([](((LTLAPp0==true) U (LTLAPp1==true)))||(((LTLAPp0==true) U (LTLAPp1==true))&&X([]((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.073: DFS-FIFO for weak LTL, using special progress label 50
pins2lts-mc-linux64( 0/ 8), 0.073: There are 51 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.073: State length is 73, there are 59 groups
pins2lts-mc-linux64( 0/ 8), 0.073: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.073: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.073: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.073: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.164: ~1 levels ~960 states ~6432 transitions
pins2lts-mc-linux64( 0/ 8), 0.183: ~1 levels ~1920 states ~12816 transitions
pins2lts-mc-linux64( 6/ 8), 0.186: ~1 levels ~3840 states ~29984 transitions
pins2lts-mc-linux64( 0/ 8), 0.206: ~1 levels ~7680 states ~57392 transitions
pins2lts-mc-linux64( 7/ 8), 0.233: ~1 levels ~15360 states ~137504 transitions
pins2lts-mc-linux64( 7/ 8), 0.297: ~1 levels ~30720 states ~290640 transitions
pins2lts-mc-linux64( 3/ 8), 0.424: ~1 levels ~61440 states ~557568 transitions
pins2lts-mc-linux64( 0/ 8), 0.740: ~1 levels ~122880 states ~1130448 transitions
pins2lts-mc-linux64( 0/ 8), 1.354: ~1 levels ~245760 states ~2390904 transitions
pins2lts-mc-linux64( 0/ 8), 2.734: ~1 levels ~491520 states ~5059008 transitions
pins2lts-mc-linux64( 3/ 8), 5.608: ~1 levels ~983040 states ~10529344 transitions
pins2lts-mc-linux64( 2/ 8), 11.243: ~1 levels ~1966080 states ~23288920 transitions
pins2lts-mc-linux64( 0/ 8), 16.360: ~111 levels ~3932160 states ~26519688 transitions
pins2lts-mc-linux64( 0/ 8), 25.953: ~111 levels ~7864320 states ~36189568 transitions
pins2lts-mc-linux64( 0/ 8), 46.728: ~111 levels ~15728640 states ~58105392 transitions
pins2lts-mc-linux64( 0/ 8), 99.135: ~111 levels ~31457280 states ~126474408 transitions
pins2lts-mc-linux64( 3/ 8), 212.541: ~130 levels ~62914560 states ~266375888 transitions
pins2lts-mc-linux64( 7/ 8), 406.188: ~270 levels ~125829120 states ~445920248 transitions
pins2lts-mc-linux64( 3/ 8), 440.686: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 440.714:
pins2lts-mc-linux64( 0/ 8), 440.714: mean standard work distribution: 22.1% (states) 20.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 440.714:
pins2lts-mc-linux64( 0/ 8), 440.714: Explored 111943543 states 597429958 transitions, fanout: 5.337
pins2lts-mc-linux64( 0/ 8), 440.714: Total exploration time 440.640 sec (440.600 sec minimum, 440.614 sec on average)
pins2lts-mc-linux64( 0/ 8), 440.714: States per second: 254048, Transitions per second: 1355823
pins2lts-mc-linux64( 0/ 8), 440.714:
pins2lts-mc-linux64( 0/ 8), 440.714: Progress states detected: 28198094
pins2lts-mc-linux64( 0/ 8), 440.714: Redundant explorations: -3.4844
pins2lts-mc-linux64( 0/ 8), 440.714:
pins2lts-mc-linux64( 0/ 8), 440.714: Queue width: 8B, total height: 7645178, memory: 58.33MB
pins2lts-mc-linux64( 0/ 8), 440.714: Tree memory: 1140.9MB, 10.3 B/state, compr.: 3.5%
pins2lts-mc-linux64( 0/ 8), 440.714: Tree fill ratio (roots/leafs): 86.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 440.714: Stored 45 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 440.714: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 440.714: Est. total memory use: 1199.2MB (~1082.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (((LTLAPp0==true) U (LTLAPp1==true)) U ([](((LTLAPp0==true) U (LTLAPp1==true)))||(((LTLAPp0==true) U (LTLAPp1==true))&&X([]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11249347302092685622]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (((LTLAPp0==true) U (LTLAPp1==true)) U ([](((LTLAPp0==true) U (LTLAPp1==true)))||(((LTLAPp0==true) U (LTLAPp1==true))&&X([]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11249347302092685622]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-12 17:20:48] [INFO ] Flatten gal took : 2 ms
[2021-05-12 17:20:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality411021164073963572.gal : 1 ms
[2021-05-12 17:20:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality9317087056597138300.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/LTLCardinality411021164073963572.gal, -t, CGAL, -LTL, /tmp/LTLCardinality9317087056597138300.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/LTLCardinality411021164073963572.gal -t CGAL -LTL /tmp/LTLCardinality9317087056597138300.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !(((("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)")U("(Organization_p21_8<=p11_3)"))U(((("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)")U("(Organization_p21_8<=p11_3)"))&&(X(G("(p5_1>Status_p21_14)"))))||(G(("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)")U("(Organization_p21_8<=p11_3)"))))))
Formula 0 simplified : !(("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)" U "(Organization_p21_8<=p11_3)") U ((("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)" U "(Organization_p21_8<=p11_3)") & XG"(p5_1>Status_p21_14)") | G("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)" U "(Organization_p21_8<=p11_3)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-12 17:41:31] [INFO ] Flatten gal took : 3 ms
[2021-05-12 17:41:31] [INFO ] Input system was already deterministic with 45 transitions.
[2021-05-12 17:41:31] [INFO ] Transformed 72 places.
[2021-05-12 17:41:31] [INFO ] Transformed 45 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-12 17:41:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality7680064006079879925.gal : 1 ms
[2021-05-12 17:41:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality12160553115985223361.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/LTLCardinality7680064006079879925.gal, -t, CGAL, -LTL, /tmp/LTLCardinality12160553115985223361.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLCardinality7680064006079879925.gal -t CGAL -LTL /tmp/LTLCardinality12160553115985223361.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)")U("(Organization_p21_8<=p11_3)"))U(((("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)")U("(Organization_p21_8<=p11_3)"))&&(X(G("(p5_1>Status_p21_14)"))))||(G(("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)")U("(Organization_p21_8<=p11_3)"))))))
Formula 0 simplified : !(("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)" U "(Organization_p21_8<=p11_3)") U ((("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)" U "(Organization_p21_8<=p11_3)") & XG"(p5_1>Status_p21_14)") | G("(Status_p22_7<=DeliveryHandlerDelivery_p8_0)" U "(Organization_p21_8<=p11_3)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

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

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