Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414800302.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BusinessProcesses-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414800302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 11 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 85K May 18 16:42 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 BusinessProcesses-PT-05-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716650418562

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:20:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:20:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:20:20] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-25 15:20:20] [INFO ] Transformed 368 places.
[2024-05-25 15:20:20] [INFO ] Transformed 319 transitions.
[2024-05-25 15:20:20] [INFO ] Found NUPN structural information;
[2024-05-25 15:20:20] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-05-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 60 place count 307 transition count 260
Iterating global reduction 1 with 58 rules applied. Total rules applied 118 place count 307 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 119 place count 307 transition count 259
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 147 place count 279 transition count 231
Iterating global reduction 2 with 28 rules applied. Total rules applied 175 place count 279 transition count 231
Applied a total of 175 rules in 76 ms. Remains 279 /367 variables (removed 88) and now considering 231/318 (removed 87) transitions.
// Phase 1: matrix 231 rows 279 cols
[2024-05-25 15:20:20] [INFO ] Computed 55 invariants in 24 ms
[2024-05-25 15:20:20] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-25 15:20:20] [INFO ] Invariant cache hit.
[2024-05-25 15:20:21] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2024-05-25 15:20:21] [INFO ] Invariant cache hit.
[2024-05-25 15:20:21] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 279/367 places, 231/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 751 ms. Remains : 279/367 places, 231/318 transitions.
Support contains 15 out of 279 places after structural reductions.
[2024-05-25 15:20:21] [INFO ] Flatten gal took : 45 ms
[2024-05-25 15:20:21] [INFO ] Flatten gal took : 17 ms
[2024-05-25 15:20:21] [INFO ] Input system was already deterministic with 231 transitions.
Incomplete random walk after 10000 steps, including 93 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:20:21] [INFO ] Invariant cache hit.
[2024-05-25 15:20:22] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:20:22] [INFO ] [Nat]Absence check using 55 positive place invariants in 15 ms returned sat
[2024-05-25 15:20:22] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-25 15:20:22] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 5 ms to minimize.
[2024-05-25 15:20:22] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-25 15:20:22] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-25 15:20:22] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-25 15:20:22] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:20:22] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-25 15:20:22] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:20:22] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-25 15:20:22] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2024-05-25 15:20:22] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:20:22] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:20:23] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:20:23] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:20:23] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:20:23] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:20:23] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:20:23] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:20:23] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1189 ms
[2024-05-25 15:20:23] [INFO ] After 1307ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-25 15:20:23] [INFO ] After 1430ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 231/231 transitions.
Graph (trivial) has 144 edges and 279 vertex of which 6 / 279 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 586 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 273 transition count 190
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 241 transition count 190
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 66 place count 241 transition count 134
Deduced a syphon composed of 56 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 125 rules applied. Total rules applied 191 place count 172 transition count 134
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 197 place count 166 transition count 128
Iterating global reduction 2 with 6 rules applied. Total rules applied 203 place count 166 transition count 128
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 369 place count 82 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 370 place count 81 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 371 place count 80 transition count 45
Applied a total of 371 rules in 75 ms. Remains 80 /279 variables (removed 199) and now considering 45/231 (removed 186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 80/279 places, 45/231 transitions.
Finished random walk after 180 steps, including 6 resets, run visited all 1 properties in 4 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 273 stabilizing places and 223 stable transitions
Graph (complete) has 598 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 231/231 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 271 transition count 223
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 271 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 267 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 267 transition count 219
Applied a total of 24 rules in 23 ms. Remains 267 /279 variables (removed 12) and now considering 219/231 (removed 12) transitions.
// Phase 1: matrix 219 rows 267 cols
[2024-05-25 15:20:23] [INFO ] Computed 55 invariants in 2 ms
[2024-05-25 15:20:23] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-25 15:20:23] [INFO ] Invariant cache hit.
[2024-05-25 15:20:24] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-25 15:20:24] [INFO ] Invariant cache hit.
[2024-05-25 15:20:24] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/279 places, 219/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 554 ms. Remains : 267/279 places, 219/231 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 237 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s210 0) (EQ s247 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-01 finished in 856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 231/231 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 272 transition count 224
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 272 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 268 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 268 transition count 220
Applied a total of 22 rules in 18 ms. Remains 268 /279 variables (removed 11) and now considering 220/231 (removed 11) transitions.
// Phase 1: matrix 220 rows 268 cols
[2024-05-25 15:20:24] [INFO ] Computed 55 invariants in 6 ms
[2024-05-25 15:20:24] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-25 15:20:24] [INFO ] Invariant cache hit.
[2024-05-25 15:20:24] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2024-05-25 15:20:24] [INFO ] Invariant cache hit.
[2024-05-25 15:20:25] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/279 places, 220/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 564 ms. Remains : 268/279 places, 220/231 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s241 0) (EQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-02 finished in 697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 231/231 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 272 transition count 224
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 272 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 268 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 268 transition count 220
Applied a total of 22 rules in 14 ms. Remains 268 /279 variables (removed 11) and now considering 220/231 (removed 11) transitions.
// Phase 1: matrix 220 rows 268 cols
[2024-05-25 15:20:25] [INFO ] Computed 55 invariants in 2 ms
[2024-05-25 15:20:25] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-25 15:20:25] [INFO ] Invariant cache hit.
[2024-05-25 15:20:25] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-05-25 15:20:25] [INFO ] Invariant cache hit.
[2024-05-25 15:20:25] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/279 places, 220/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 268/279 places, 220/231 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s59 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-04 finished in 670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))||G(p1))))))'
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 231/231 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 274 transition count 226
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 274 transition count 226
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 272 transition count 224
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 272 transition count 224
Applied a total of 14 rules in 35 ms. Remains 272 /279 variables (removed 7) and now considering 224/231 (removed 7) transitions.
// Phase 1: matrix 224 rows 272 cols
[2024-05-25 15:20:25] [INFO ] Computed 55 invariants in 5 ms
[2024-05-25 15:20:26] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-25 15:20:26] [INFO ] Invariant cache hit.
[2024-05-25 15:20:26] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-05-25 15:20:26] [INFO ] Invariant cache hit.
[2024-05-25 15:20:26] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/279 places, 224/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 537 ms. Remains : 272/279 places, 224/231 transitions.
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (EQ s165 0) (EQ s239 1)), p0:(OR (EQ s250 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 926 reset in 297 ms.
Product exploration explored 100000 steps with 938 reset in 223 ms.
Computed a total of 266 stabilizing places and 216 stable transitions
Graph (complete) has 585 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 266 stabilizing places and 216 stable transitions
Detected a total of 266/272 stabilizing places and 216/224 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 92 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:20:27] [INFO ] Invariant cache hit.
[2024-05-25 15:20:27] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:20:27] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned sat
[2024-05-25 15:20:28] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:20:28] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-25 15:20:28] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2024-05-25 15:20:28] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:20:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2024-05-25 15:20:28] [INFO ] After 361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-25 15:20:28] [INFO ] After 480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 224/224 transitions.
Graph (trivial) has 135 edges and 272 vertex of which 6 / 272 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 573 edges and 267 vertex of which 266 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 266 transition count 186
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 237 transition count 186
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 60 place count 237 transition count 132
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 181 place count 170 transition count 132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 182 place count 169 transition count 131
Iterating global reduction 2 with 1 rules applied. Total rules applied 183 place count 169 transition count 131
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 351 place count 84 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 352 place count 83 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 353 place count 82 transition count 47
Applied a total of 353 rules in 34 ms. Remains 82 /272 variables (removed 190) and now considering 47/224 (removed 177) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 82/272 places, 47/224 transitions.
Finished random walk after 144 steps, including 5 resets, run visited all 1 properties in 1 ms. (steps per millisecond=144 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 207 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 224/224 transitions.
Applied a total of 0 rules in 9 ms. Remains 272 /272 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-25 15:20:29] [INFO ] Invariant cache hit.
[2024-05-25 15:20:29] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-25 15:20:29] [INFO ] Invariant cache hit.
[2024-05-25 15:20:29] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-25 15:20:29] [INFO ] Invariant cache hit.
[2024-05-25 15:20:29] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 539 ms. Remains : 272/272 places, 224/224 transitions.
Computed a total of 266 stabilizing places and 216 stable transitions
Graph (complete) has 585 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 266 stabilizing places and 216 stable transitions
Detected a total of 266/272 stabilizing places and 216/224 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 93 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:20:30] [INFO ] Invariant cache hit.
[2024-05-25 15:20:30] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:20:30] [INFO ] [Nat]Absence check using 55 positive place invariants in 34 ms returned sat
[2024-05-25 15:20:30] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:20:30] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2024-05-25 15:20:30] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2024-05-25 15:20:30] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:20:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 224 ms
[2024-05-25 15:20:30] [INFO ] After 349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-25 15:20:30] [INFO ] After 466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 224/224 transitions.
Graph (trivial) has 135 edges and 272 vertex of which 6 / 272 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 573 edges and 267 vertex of which 266 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 266 transition count 186
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 237 transition count 186
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 60 place count 237 transition count 132
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 181 place count 170 transition count 132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 182 place count 169 transition count 131
Iterating global reduction 2 with 1 rules applied. Total rules applied 183 place count 169 transition count 131
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 351 place count 84 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 352 place count 83 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 353 place count 82 transition count 47
Applied a total of 353 rules in 27 ms. Remains 82 /272 variables (removed 190) and now considering 47/224 (removed 177) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 82/272 places, 47/224 transitions.
Finished random walk after 73 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=73 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 942 reset in 236 ms.
Product exploration explored 100000 steps with 936 reset in 236 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 224/224 transitions.
Graph (trivial) has 133 edges and 272 vertex of which 6 / 272 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 578 edges and 267 vertex of which 266 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 266 transition count 217
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 39 Pre rules applied. Total rules applied 30 place count 266 transition count 252
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 69 place count 266 transition count 252
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 78 place count 257 transition count 235
Deduced a syphon composed of 58 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 87 place count 257 transition count 235
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 156 places in 0 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 185 place count 257 transition count 235
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 205 place count 237 transition count 215
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 225 place count 237 transition count 215
Deduced a syphon composed of 136 places in 0 ms
Applied a total of 225 rules in 65 ms. Remains 237 /272 variables (removed 35) and now considering 215/224 (removed 9) transitions.
[2024-05-25 15:20:32] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 215 rows 237 cols
[2024-05-25 15:20:32] [INFO ] Computed 55 invariants in 4 ms
[2024-05-25 15:20:32] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 237/272 places, 215/224 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 237/272 places, 215/224 transitions.
Built C files in :
/tmp/ltsmin6558455473260951125
[2024-05-25 15:20:32] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6558455473260951125
Running compilation step : cd /tmp/ltsmin6558455473260951125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 591 ms.
Running link step : cd /tmp/ltsmin6558455473260951125;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin6558455473260951125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1144750156026968625.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 224/224 transitions.
Applied a total of 0 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 224/224 (removed 0) transitions.
// Phase 1: matrix 224 rows 272 cols
[2024-05-25 15:20:48] [INFO ] Computed 55 invariants in 3 ms
[2024-05-25 15:20:48] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-25 15:20:48] [INFO ] Invariant cache hit.
[2024-05-25 15:20:48] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-05-25 15:20:48] [INFO ] Invariant cache hit.
[2024-05-25 15:20:48] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 412 ms. Remains : 272/272 places, 224/224 transitions.
Built C files in :
/tmp/ltsmin17992309849565414316
[2024-05-25 15:20:48] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17992309849565414316
Running compilation step : cd /tmp/ltsmin17992309849565414316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 397 ms.
Running link step : cd /tmp/ltsmin17992309849565414316;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17992309849565414316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14968615963537994635.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:21:03] [INFO ] Flatten gal took : 18 ms
[2024-05-25 15:21:03] [INFO ] Flatten gal took : 14 ms
[2024-05-25 15:21:03] [INFO ] Time to serialize gal into /tmp/LTL4842652611789796333.gal : 5 ms
[2024-05-25 15:21:03] [INFO ] Time to serialize properties into /tmp/LTL7245290458651100134.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4842652611789796333.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8370642217745592038.hoa' '-atoms' '/tmp/LTL7245290458651100134.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7245290458651100134.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8370642217745592038.hoa
Detected timeout of ITS tools.
[2024-05-25 15:21:18] [INFO ] Flatten gal took : 21 ms
[2024-05-25 15:21:18] [INFO ] Flatten gal took : 18 ms
[2024-05-25 15:21:18] [INFO ] Time to serialize gal into /tmp/LTL13344927737986876614.gal : 4 ms
[2024-05-25 15:21:18] [INFO ] Time to serialize properties into /tmp/LTL13192388263936159356.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13344927737986876614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13192388263936159356.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F(G("((p316==0)||(p29==1))")))||(G("((p188==0)||(p293==1))")))))))
Formula 0 simplified : XXX(GF!"((p316==0)||(p29==1))" & F!"((p188==0)||(p293==1))")
Detected timeout of ITS tools.
[2024-05-25 15:21:33] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:21:33] [INFO ] Applying decomposition
[2024-05-25 15:21:33] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14072563954996656762.txt' '-o' '/tmp/graph14072563954996656762.bin' '-w' '/tmp/graph14072563954996656762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14072563954996656762.bin' '-l' '-1' '-v' '-w' '/tmp/graph14072563954996656762.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:21:34] [INFO ] Decomposing Gal with order
[2024-05-25 15:21:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:21:34] [INFO ] Removed a total of 67 redundant transitions.
[2024-05-25 15:21:34] [INFO ] Flatten gal took : 63 ms
[2024-05-25 15:21:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2024-05-25 15:21:34] [INFO ] Time to serialize gal into /tmp/LTL419828110168879594.gal : 6 ms
[2024-05-25 15:21:34] [INFO ] Time to serialize properties into /tmp/LTL18157296863411649198.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL419828110168879594.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18157296863411649198.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F(G("((i21.i1.u85.p316==0)||(i17.u11.p29==1))")))||(G("((i16.i1.u59.p188==0)||(i20.u80.p293==1))")))))))
Formula 0 simplified : XXX(GF!"((i21.i1.u85.p316==0)||(i17.u11.p29==1))" & F!"((i16.i1.u59.p188==0)||(i20.u80.p293==1))")
Reverse transition relation is NOT exact ! Due to transitions t160, t169, t209, t212, t213, t216, i0.u76.t31, i1.t107, i1.u33.t122, i1.u37.t114, i1.u39.t11...917
Computing Next relation with stutter on 24 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8449929297006040131
[2024-05-25 15:21:49] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8449929297006040131
Running compilation step : cd /tmp/ltsmin8449929297006040131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 420 ms.
Running link step : cd /tmp/ltsmin8449929297006040131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8449929297006040131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-05-LTLCardinality-06 finished in 98355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 231/231 transitions.
Graph (trivial) has 142 edges and 279 vertex of which 6 / 279 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 591 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 272 transition count 192
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 241 transition count 192
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 64 place count 241 transition count 136
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 125 rules applied. Total rules applied 189 place count 172 transition count 136
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 195 place count 166 transition count 130
Iterating global reduction 2 with 6 rules applied. Total rules applied 201 place count 166 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 201 place count 166 transition count 129
Deduced a syphon composed of 1 places in 1 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 204 place count 164 transition count 129
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 364 place count 83 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 365 place count 82 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 366 place count 81 transition count 49
Applied a total of 366 rules in 57 ms. Remains 81 /279 variables (removed 198) and now considering 49/231 (removed 182) transitions.
// Phase 1: matrix 49 rows 81 cols
[2024-05-25 15:22:04] [INFO ] Computed 38 invariants in 1 ms
[2024-05-25 15:22:04] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-25 15:22:04] [INFO ] Invariant cache hit.
[2024-05-25 15:22:04] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 204 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/279 places, 49/231 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 0 with 8 rules applied. Total rules applied 8 place count 43 transition count 41
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 35 transition count 41
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 30 transition count 36
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 30 transition count 36
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 30 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 30 place count 28 transition count 34
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 31 place count 27 transition count 33
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 27 transition count 33
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 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 42 place count 22 transition count 28
Applied a total of 42 rules in 6 ms. Remains 22 /43 variables (removed 21) and now considering 28/49 (removed 21) transitions.
// Phase 1: matrix 28 rows 22 cols
[2024-05-25 15:22:04] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 15:22:04] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-25 15:22:04] [INFO ] Invariant cache hit.
[2024-05-25 15:22:04] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/279 places, 28/231 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 328 ms. Remains : 22/279 places, 28/231 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s20 0) (NEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-10 finished in 400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X(X(G(p1)))))'
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 231/231 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 271 transition count 223
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 271 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 267 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 267 transition count 219
Applied a total of 24 rules in 9 ms. Remains 267 /279 variables (removed 12) and now considering 219/231 (removed 12) transitions.
// Phase 1: matrix 219 rows 267 cols
[2024-05-25 15:22:04] [INFO ] Computed 55 invariants in 2 ms
[2024-05-25 15:22:04] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-25 15:22:04] [INFO ] Invariant cache hit.
[2024-05-25 15:22:04] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-25 15:22:04] [INFO ] Invariant cache hit.
[2024-05-25 15:22:05] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/279 places, 219/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 267/279 places, 219/231 transitions.
Stuttering acceptance computed with spot in 453 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s65 1), p0:(EQ s166 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLCardinality-12 finished in 903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))||G(p1))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-05-LTLCardinality-06
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 279/279 places, 231/231 transitions.
Graph (trivial) has 140 edges and 279 vertex of which 6 / 279 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 591 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 272 transition count 193
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 242 transition count 193
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 62 place count 242 transition count 139
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 183 place count 175 transition count 139
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 187 place count 171 transition count 135
Iterating global reduction 2 with 4 rules applied. Total rules applied 191 place count 171 transition count 135
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 167 rules applied. Total rules applied 358 place count 87 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 359 place count 86 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 360 place count 85 transition count 51
Applied a total of 360 rules in 44 ms. Remains 85 /279 variables (removed 194) and now considering 51/231 (removed 180) transitions.
// Phase 1: matrix 51 rows 85 cols
[2024-05-25 15:22:06] [INFO ] Computed 40 invariants in 1 ms
[2024-05-25 15:22:06] [INFO ] Implicit Places using invariants in 87 ms returned [4, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 88 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 83/279 places, 51/231 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 135 ms. Remains : 83/279 places, 51/231 transitions.
Running random walk in product with property : BusinessProcesses-PT-05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (EQ s31 0) (EQ s65 1)), p0:(OR (EQ s70 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 21955 reset in 237 ms.
Product exploration explored 100000 steps with 22170 reset in 233 ms.
Computed a total of 83 stabilizing places and 50 stable transitions
Computed a total of 83 stabilizing places and 50 stable transitions
Detected a total of 83/83 stabilizing places and 50/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2785 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 1259 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 83 cols
[2024-05-25 15:22:07] [INFO ] Computed 38 invariants in 1 ms
[2024-05-25 15:22:07] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:22:07] [INFO ] [Nat]Absence check using 38 positive place invariants in 5 ms returned sat
[2024-05-25 15:22:07] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:22:07] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-25 15:22:07] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-25 15:22:07] [INFO ] Invariant cache hit.
[2024-05-25 15:22:07] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-25 15:22:07] [INFO ] Invariant cache hit.
[2024-05-25 15:22:08] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 175 ms to find 38 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/83 places, 51/51 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 42 transition count 48
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 42 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 41 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 41 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 40 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 40 transition count 46
Applied a total of 10 rules in 1 ms. Remains 40 /45 variables (removed 5) and now considering 46/51 (removed 5) transitions.
// Phase 1: matrix 46 rows 40 cols
[2024-05-25 15:22:08] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 15:22:08] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-25 15:22:08] [INFO ] Invariant cache hit.
[2024-05-25 15:22:08] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 40/83 places, 46/51 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 266 ms. Remains : 40/83 places, 46/51 transitions.
Computed a total of 40 stabilizing places and 45 stable transitions
Graph (complete) has 79 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 45 stable transitions
Detected a total of 40/40 stabilizing places and 45/46 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 913 steps, including 260 resets, run visited all 2 properties in 2 ms. (steps per millisecond=456 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 21900 reset in 78 ms.
Product exploration explored 100000 steps with 22002 reset in 86 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 46/46 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 40 transition count 46
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 40 transition count 50
Deduced a syphon composed of 13 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 40 transition count 48
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 15 rules in 5 ms. Remains 40 /40 variables (removed 0) and now considering 48/46 (removed -2) transitions.
[2024-05-25 15:22:09] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 48 rows 40 cols
[2024-05-25 15:22:09] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 15:22:10] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/40 places, 48/46 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 40/40 places, 48/46 transitions.
Built C files in :
/tmp/ltsmin2258946420240876501
[2024-05-25 15:22:10] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2258946420240876501
Running compilation step : cd /tmp/ltsmin2258946420240876501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 105 ms.
Running link step : cd /tmp/ltsmin2258946420240876501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2258946420240876501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10380260741785602755.hoa' '--buchi-type=spotba'
LTSmin run took 56 ms.
Treatment of property BusinessProcesses-PT-05-LTLCardinality-06 finished in 4648 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
[2024-05-25 15:22:10] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin507946103832689636
[2024-05-25 15:22:10] [INFO ] Computing symmetric may disable matrix : 231 transitions.
[2024-05-25 15:22:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:22:10] [INFO ] Computing symmetric may enable matrix : 231 transitions.
[2024-05-25 15:22:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:22:10] [INFO ] Applying decomposition
[2024-05-25 15:22:10] [INFO ] Flatten gal took : 12 ms
[2024-05-25 15:22:10] [INFO ] Computing Do-Not-Accords matrix : 231 transitions.
[2024-05-25 15:22:10] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:22:10] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin507946103832689636
Running compilation step : cd /tmp/ltsmin507946103832689636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17352876270807534343.txt' '-o' '/tmp/graph17352876270807534343.bin' '-w' '/tmp/graph17352876270807534343.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17352876270807534343.bin' '-l' '-1' '-v' '-w' '/tmp/graph17352876270807534343.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:22:10] [INFO ] Decomposing Gal with order
[2024-05-25 15:22:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:22:10] [INFO ] Removed a total of 64 redundant transitions.
[2024-05-25 15:22:10] [INFO ] Flatten gal took : 23 ms
[2024-05-25 15:22:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-25 15:22:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality1595420155976209207.gal : 6 ms
[2024-05-25 15:22:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality15800677122920521564.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1595420155976209207.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15800677122920521564.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F(G("((i20.i1.u87.p316==0)||(i4.i0.u11.p29==1))")))||(G("((i5.u60.p188==0)||(i19.u81.p293==1))")))))))
Formula 0 simplified : XXX(GF!"((i20.i1.u87.p316==0)||(i4.i0.u11.p29==1))" & F!"((i5.u60.p188==0)||(i19.u81.p293==1))")
Compilation finished in 648 ms.
Running link step : cd /tmp/ltsmin507946103832689636;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin507946103832689636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t160, t169, t212, t213, i0.t107, i0.u38.t114, i0.u40.t110, i1.i0.u32.t126, i1.i1.u25.t140, i2...969
Computing Next relation with stutter on 24 deadlock states
5 unique states visited
0 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
2472 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,24.7551,517376,1,0,752375,551,3733,2.1428e+06,218,1945,1304943
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-05-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 178687 ms.

BK_STOP 1716650599218

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="BusinessProcesses-PT-05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-05, 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 r065-tajo-171620414800302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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