About the Execution of 2023-gold for BusinessProcesses-PT-20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16226.180 | 3600000.00 | 8823864.00 | 84986.30 | FFFTTFTFTFFF?TTF | normal |
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-171620415000377.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-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620415000377
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 192K 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-20-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716651613955
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-20
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:40:16] [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:40:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:40:16] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-05-25 15:40:16] [INFO ] Transformed 782 places.
[2024-05-25 15:40:16] [INFO ] Transformed 697 transitions.
[2024-05-25 15:40:16] [INFO ] Found NUPN structural information;
[2024-05-25 15:40:16] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 340 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 63 places in 23 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 118 place count 601 transition count 534
Iterating global reduction 1 with 104 rules applied. Total rules applied 222 place count 601 transition count 534
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 276 place count 547 transition count 480
Iterating global reduction 1 with 54 rules applied. Total rules applied 330 place count 547 transition count 480
Applied a total of 330 rules in 165 ms. Remains 547 /719 variables (removed 172) and now considering 480/638 (removed 158) transitions.
// Phase 1: matrix 480 rows 547 cols
[2024-05-25 15:40:17] [INFO ] Computed 107 invariants in 33 ms
[2024-05-25 15:40:18] [INFO ] Implicit Places using invariants in 1189 ms returned []
[2024-05-25 15:40:18] [INFO ] Invariant cache hit.
[2024-05-25 15:40:19] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 2033 ms to find 0 implicit places.
[2024-05-25 15:40:19] [INFO ] Invariant cache hit.
[2024-05-25 15:40:19] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 547/719 places, 480/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2649 ms. Remains : 547/719 places, 480/638 transitions.
Support contains 18 out of 547 places after structural reductions.
[2024-05-25 15:40:20] [INFO ] Flatten gal took : 131 ms
[2024-05-25 15:40:20] [INFO ] Flatten gal took : 68 ms
[2024-05-25 15:40:20] [INFO ] Input system was already deterministic with 480 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 527 ms. (steps per millisecond=18 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 15:40:21] [INFO ] Invariant cache hit.
[2024-05-25 15:40:21] [INFO ] [Real]Absence check using 65 positive place invariants in 44 ms returned sat
[2024-05-25 15:40:21] [INFO ] [Real]Absence check using 65 positive and 42 generalized place invariants in 10 ms returned sat
[2024-05-25 15:40:21] [INFO ] After 513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 15:40:21] [INFO ] [Nat]Absence check using 65 positive place invariants in 31 ms returned sat
[2024-05-25 15:40:22] [INFO ] [Nat]Absence check using 65 positive and 42 generalized place invariants in 35 ms returned sat
[2024-05-25 15:40:22] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-25 15:40:22] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 18 ms to minimize.
[2024-05-25 15:40:22] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2024-05-25 15:40:22] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-05-25 15:40:23] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2024-05-25 15:40:23] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:40:23] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 1 ms to minimize.
[2024-05-25 15:40:23] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 0 ms to minimize.
[2024-05-25 15:40:23] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 0 ms to minimize.
[2024-05-25 15:40:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 962 ms
[2024-05-25 15:40:23] [INFO ] After 1441ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-25 15:40:23] [INFO ] After 1906ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 4 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 480/480 transitions.
Graph (trivial) has 259 edges and 547 vertex of which 6 / 547 are part of one of the 1 SCC in 9 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1215 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 540 transition count 399
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 468 transition count 399
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 146 place count 468 transition count 288
Deduced a syphon composed of 111 places in 15 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 390 place count 335 transition count 288
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 395 place count 330 transition count 283
Iterating global reduction 2 with 5 rules applied. Total rules applied 400 place count 330 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 400 place count 330 transition count 282
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 402 place count 329 transition count 282
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 684 place count 186 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 688 place count 184 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 690 place count 184 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 692 place count 182 transition count 148
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 697 place count 182 transition count 148
Applied a total of 697 rules in 196 ms. Remains 182 /547 variables (removed 365) and now considering 148/480 (removed 332) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 182/547 places, 148/480 transitions.
Finished random walk after 875 steps, including 40 resets, run visited all 3 properties in 29 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
FORMULA BusinessProcesses-PT-20-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 478 stabilizing places and 421 stable transitions
Graph (complete) has 1222 edges and 547 vertex of which 545 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.33 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(F(p0)))'
Support contains 1 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 480/480 transitions.
Graph (trivial) has 261 edges and 547 vertex of which 6 / 547 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 1216 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 539 transition count 399
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 467 transition count 399
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 146 place count 467 transition count 288
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 390 place count 334 transition count 288
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 397 place count 327 transition count 281
Iterating global reduction 2 with 7 rules applied. Total rules applied 404 place count 327 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 404 place count 327 transition count 280
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 406 place count 326 transition count 280
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 690 place count 182 transition count 140
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 694 place count 180 transition count 147
Applied a total of 694 rules in 92 ms. Remains 180 /547 variables (removed 367) and now considering 147/480 (removed 333) transitions.
[2024-05-25 15:40:24] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
// Phase 1: matrix 146 rows 180 cols
[2024-05-25 15:40:24] [INFO ] Computed 81 invariants in 3 ms
[2024-05-25 15:40:24] [INFO ] Implicit Places using invariants in 220 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 226 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/547 places, 147/480 transitions.
Applied a total of 0 rules in 14 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 333 ms. Remains : 156/547 places, 147/480 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 417 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s85 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-02 finished in 839 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 U X(X(G(p1)))) U (F(p3)||p2))))'
Support contains 5 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 480/480 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 543 transition count 476
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 543 transition count 476
Applied a total of 8 rules in 43 ms. Remains 543 /547 variables (removed 4) and now considering 476/480 (removed 4) transitions.
// Phase 1: matrix 476 rows 543 cols
[2024-05-25 15:40:25] [INFO ] Computed 107 invariants in 14 ms
[2024-05-25 15:40:25] [INFO ] Implicit Places using invariants in 692 ms returned []
[2024-05-25 15:40:25] [INFO ] Invariant cache hit.
[2024-05-25 15:40:26] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
[2024-05-25 15:40:26] [INFO ] Invariant cache hit.
[2024-05-25 15:40:26] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 543/547 places, 476/480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1771 ms. Remains : 543/547 places, 476/480 transitions.
Stuttering acceptance computed with spot in 418 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s505 0) (EQ s126 1)), p3:(OR (EQ s375 0) (EQ s98 1)), p0:(OR (EQ s505 0) (EQ s126 1)), p1:(EQ s51 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 529 ms.
Product exploration explored 100000 steps with 50000 reset in 352 ms.
Computed a total of 475 stabilizing places and 418 stable transitions
Graph (complete) has 1218 edges and 543 vertex of which 541 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 475 stabilizing places and 418 stable transitions
Detected a total of 475/543 stabilizing places and 418/476 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p2 p3 p0 p1), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X p3)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 54 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-20-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-20-LTLCardinality-04 finished in 3202 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||G(p1)))))'
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 480/480 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 542 transition count 475
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 542 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 540 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 540 transition count 473
Applied a total of 14 rules in 42 ms. Remains 540 /547 variables (removed 7) and now considering 473/480 (removed 7) transitions.
// Phase 1: matrix 473 rows 540 cols
[2024-05-25 15:40:28] [INFO ] Computed 107 invariants in 14 ms
[2024-05-25 15:40:28] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-25 15:40:28] [INFO ] Invariant cache hit.
[2024-05-25 15:40:29] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
[2024-05-25 15:40:29] [INFO ] Invariant cache hit.
[2024-05-25 15:40:29] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 540/547 places, 473/480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1594 ms. Remains : 540/547 places, 473/480 transitions.
Stuttering acceptance computed with spot in 294 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s456 0) (EQ s419 1)), p0:(EQ s375 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 2091 steps with 10 reset in 10 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-09 finished in 1940 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(F((p0&&X(G(p1))))))'
Support contains 2 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 480/480 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 541 transition count 474
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 541 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 539 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 539 transition count 472
Applied a total of 16 rules in 40 ms. Remains 539 /547 variables (removed 8) and now considering 472/480 (removed 8) transitions.
// Phase 1: matrix 472 rows 539 cols
[2024-05-25 15:40:30] [INFO ] Computed 107 invariants in 8 ms
[2024-05-25 15:40:30] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-25 15:40:30] [INFO ] Invariant cache hit.
[2024-05-25 15:40:31] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 973 ms to find 0 implicit places.
[2024-05-25 15:40:31] [INFO ] Invariant cache hit.
[2024-05-25 15:40:31] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/547 places, 472/480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1276 ms. Remains : 539/547 places, 472/480 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s525 0), p1:(EQ s486 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 507 reset in 512 ms.
Product exploration explored 100000 steps with 509 reset in 440 ms.
Computed a total of 471 stabilizing places and 414 stable transitions
Graph (complete) has 1210 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.21 ms
Computed a total of 471 stabilizing places and 414 stable transitions
Detected a total of 471/539 stabilizing places and 414/472 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 307 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 683901 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 683901 steps, saw 110514 distinct states, run finished after 3002 ms. (steps per millisecond=227 ) properties seen :3
Running SMT prover for 1 properties.
[2024-05-25 15:40:36] [INFO ] Invariant cache hit.
[2024-05-25 15:40:36] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:40:36] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2024-05-25 15:40:36] [INFO ] [Nat]Absence check using 65 positive and 42 generalized place invariants in 14 ms returned sat
[2024-05-25 15:40:36] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 452 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Support contains 1 out of 539 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 251 edges and 539 vertex of which 6 / 539 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 1204 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 531 transition count 395
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 463 transition count 395
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 138 place count 463 transition count 284
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 382 place count 330 transition count 284
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 670 place count 184 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 674 place count 182 transition count 149
Applied a total of 674 rules in 58 ms. Remains 182 /539 variables (removed 357) and now considering 149/472 (removed 323) transitions.
[2024-05-25 15:40:37] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 182 cols
[2024-05-25 15:40:37] [INFO ] Computed 81 invariants in 1 ms
[2024-05-25 15:40:37] [INFO ] Implicit Places using invariants in 127 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 128 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/539 places, 149/472 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 195 ms. Remains : 158/539 places, 149/472 transitions.
Computed a total of 85 stabilizing places and 97 stable transitions
Computed a total of 85 stabilizing places and 97 stable transitions
Detected a total of 85/158 stabilizing places and 97/149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1770 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 443 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 95 steps, run visited all 1 properties in 6 ms. (steps per millisecond=15 )
Probabilistic random walk after 95 steps, saw 65 distinct states, run finished after 6 ms. (steps per millisecond=15 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Product exploration explored 100000 steps with 15616 reset in 223 ms.
Product exploration explored 100000 steps with 15772 reset in 289 ms.
Built C files in :
/tmp/ltsmin14077700819319880104
[2024-05-25 15:40:38] [INFO ] Computing symmetric may disable matrix : 149 transitions.
[2024-05-25 15:40:38] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:40:38] [INFO ] Computing symmetric may enable matrix : 149 transitions.
[2024-05-25 15:40:38] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:40:38] [INFO ] Computing Do-Not-Accords matrix : 149 transitions.
[2024-05-25 15:40:38] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:40:38] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14077700819319880104
Running compilation step : cd /tmp/ltsmin14077700819319880104;'/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 501 ms.
Running link step : cd /tmp/ltsmin14077700819319880104;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin14077700819319880104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10049111201443579510.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 149/149 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 158 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 157 transition count 148
Applied a total of 2 rules in 10 ms. Remains 157 /158 variables (removed 1) and now considering 148/149 (removed 1) transitions.
[2024-05-25 15:40:53] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 157 cols
[2024-05-25 15:40:53] [INFO ] Computed 57 invariants in 3 ms
[2024-05-25 15:40:54] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-25 15:40:54] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
[2024-05-25 15:40:54] [INFO ] Invariant cache hit.
[2024-05-25 15:40:54] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-25 15:40:54] [INFO ] Implicit Places using invariants and state equation in 197 ms returned [5, 44, 46, 48, 56, 90, 92, 94, 96, 98, 100, 102]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 360 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/158 places, 148/149 transitions.
Graph (complete) has 527 edges and 145 vertex of which 136 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 136 transition count 140
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 132 transition count 140
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 20 place count 121 transition count 101
Iterating global reduction 2 with 11 rules applied. Total rules applied 31 place count 121 transition count 101
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 121 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 120 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 34 place count 119 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 119 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 37 place count 119 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 38 place count 118 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 42 place count 116 transition count 95
Applied a total of 42 rules in 18 ms. Remains 116 /145 variables (removed 29) and now considering 95/148 (removed 53) transitions.
[2024-05-25 15:40:54] [INFO ] Flow matrix only has 94 transitions (discarded 1 similar events)
// Phase 1: matrix 94 rows 116 cols
[2024-05-25 15:40:54] [INFO ] Computed 40 invariants in 1 ms
[2024-05-25 15:40:54] [INFO ] Implicit Places using invariants in 69 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 71 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/158 places, 95/149 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 463 ms. Remains : 113/158 places, 95/149 transitions.
Built C files in :
/tmp/ltsmin4709988669647680384
[2024-05-25 15:40:54] [INFO ] Computing symmetric may disable matrix : 95 transitions.
[2024-05-25 15:40:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:40:54] [INFO ] Computing symmetric may enable matrix : 95 transitions.
[2024-05-25 15:40:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:40:54] [INFO ] Computing Do-Not-Accords matrix : 95 transitions.
[2024-05-25 15:40:54] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:40:54] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4709988669647680384
Running compilation step : cd /tmp/ltsmin4709988669647680384;'/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 257 ms.
Running link step : cd /tmp/ltsmin4709988669647680384;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4709988669647680384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17050910567742349577.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:41:09] [INFO ] Flatten gal took : 11 ms
[2024-05-25 15:41:09] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:41:09] [INFO ] Time to serialize gal into /tmp/LTL5376569924927609305.gal : 3 ms
[2024-05-25 15:41:09] [INFO ] Time to serialize properties into /tmp/LTL11968535254539293815.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/LTL5376569924927609305.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9072933416870702443.hoa' '-atoms' '/tmp/LTL11968535254539293815.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...318
Loading property file /tmp/LTL11968535254539293815.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9072933416870702443.hoa
Detected timeout of ITS tools.
[2024-05-25 15:41:24] [INFO ] Flatten gal took : 26 ms
[2024-05-25 15:41:24] [INFO ] Flatten gal took : 22 ms
[2024-05-25 15:41:24] [INFO ] Time to serialize gal into /tmp/LTL11059406584197423309.gal : 5 ms
[2024-05-25 15:41:24] [INFO ] Time to serialize properties into /tmp/LTL13751669126671067632.ltl : 11 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/LTL11059406584197423309.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13751669126671067632.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(F(("(p768==0)")&&(X(G("(p709==0)")))))))
Formula 0 simplified : XG(!"(p768==0)" | XF!"(p709==0)")
Detected timeout of ITS tools.
[2024-05-25 15:41:39] [INFO ] Flatten gal took : 27 ms
[2024-05-25 15:41:39] [INFO ] Applying decomposition
[2024-05-25 15:41:39] [INFO ] Flatten gal took : 22 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/graph9104667778354697951.txt' '-o' '/tmp/graph9104667778354697951.bin' '-w' '/tmp/graph9104667778354697951.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9104667778354697951.bin' '-l' '-1' '-v' '-w' '/tmp/graph9104667778354697951.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:41:40] [INFO ] Decomposing Gal with order
[2024-05-25 15:41:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:41:40] [INFO ] Removed a total of 185 redundant transitions.
[2024-05-25 15:41:40] [INFO ] Flatten gal took : 84 ms
[2024-05-25 15:41:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 30 ms.
[2024-05-25 15:41:40] [INFO ] Time to serialize gal into /tmp/LTL13272154728951133536.gal : 7 ms
[2024-05-25 15:41:40] [INFO ] Time to serialize properties into /tmp/LTL16115772078027760893.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/LTL13272154728951133536.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16115772078027760893.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...256
Read 1 LTL properties
Checking formula 0 : !((X(F(("(u12.p768==0)")&&(X(G("(i6.u38.p709==0)")))))))
Formula 0 simplified : XG(!"(u12.p768==0)" | XF!"(i6.u38.p709==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15375679533099202599
[2024-05-25 15:41:55] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15375679533099202599
Running compilation step : cd /tmp/ltsmin15375679533099202599;'/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 416 ms.
Running link step : cd /tmp/ltsmin15375679533099202599;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15375679533099202599;'/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(<>(((LTLAPp0==true)&&X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-20-LTLCardinality-12 finished in 100159 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((F(G(p0))&&F(p1))))'
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 480/480 transitions.
Graph (trivial) has 259 edges and 547 vertex of which 6 / 547 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 1216 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 539 transition count 400
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 468 transition count 399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 467 transition count 399
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 146 place count 467 transition count 288
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 390 place count 334 transition count 288
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 396 place count 328 transition count 282
Iterating global reduction 3 with 6 rules applied. Total rules applied 402 place count 328 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 402 place count 328 transition count 281
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 404 place count 327 transition count 281
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 682 place count 186 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 686 place count 184 transition count 151
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 692 place count 184 transition count 151
Applied a total of 692 rules in 109 ms. Remains 184 /547 variables (removed 363) and now considering 151/480 (removed 329) transitions.
[2024-05-25 15:42:10] [INFO ] Flow matrix only has 150 transitions (discarded 1 similar events)
// Phase 1: matrix 150 rows 184 cols
[2024-05-25 15:42:10] [INFO ] Computed 81 invariants in 2 ms
[2024-05-25 15:42:10] [INFO ] Implicit Places using invariants in 176 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 178 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/547 places, 151/480 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 292 ms. Remains : 161/547 places, 151/480 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-15 automaton TGBA Formula[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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s109 0) (EQ s119 1)), p1:(AND (EQ s109 0) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-15 finished in 535 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(F((p0&&X(G(p1))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-20-LTLCardinality-12
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 547 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 547/547 places, 480/480 transitions.
Graph (trivial) has 259 edges and 547 vertex of which 6 / 547 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1216 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 539 transition count 399
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 467 transition count 399
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 146 place count 467 transition count 289
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 388 place count 335 transition count 289
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 394 place count 329 transition count 283
Iterating global reduction 2 with 6 rules applied. Total rules applied 400 place count 329 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 400 place count 329 transition count 282
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 402 place count 328 transition count 282
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 686 place count 184 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 690 place count 182 transition count 149
Applied a total of 690 rules in 68 ms. Remains 182 /547 variables (removed 365) and now considering 149/480 (removed 331) transitions.
[2024-05-25 15:42:11] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 182 cols
[2024-05-25 15:42:11] [INFO ] Computed 81 invariants in 2 ms
[2024-05-25 15:42:11] [INFO ] Implicit Places using invariants in 274 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 277 ms to find 24 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 158/547 places, 149/480 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 350 ms. Remains : 158/547 places, 149/480 transitions.
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s148 0), p1:(EQ s125 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 15856 reset in 367 ms.
Product exploration explored 100000 steps with 15804 reset in 328 ms.
Computed a total of 85 stabilizing places and 97 stable transitions
Computed a total of 85 stabilizing places and 97 stable transitions
Detected a total of 85/158 stabilizing places and 97/149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 296 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1789 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 426 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-25 15:42:13] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 158 cols
[2024-05-25 15:42:13] [INFO ] Computed 57 invariants in 2 ms
[2024-05-25 15:42:13] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:42:13] [INFO ] [Nat]Absence check using 41 positive place invariants in 7 ms returned sat
[2024-05-25 15:42:13] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-25 15:42:13] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 438 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1)]
Support contains 1 out of 158 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 149/149 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2024-05-25 15:42:14] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
[2024-05-25 15:42:14] [INFO ] Invariant cache hit.
[2024-05-25 15:42:14] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-25 15:42:14] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
[2024-05-25 15:42:14] [INFO ] Invariant cache hit.
[2024-05-25 15:42:14] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-25 15:42:14] [INFO ] Implicit Places using invariants and state equation in 308 ms returned [5, 44, 46, 48, 56, 90, 92, 94, 96, 98, 100, 102]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 480 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/158 places, 149/149 transitions.
Graph (complete) has 528 edges and 146 vertex of which 137 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 137 transition count 141
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 133 transition count 141
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 20 place count 122 transition count 102
Iterating global reduction 2 with 11 rules applied. Total rules applied 31 place count 122 transition count 102
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 122 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 121 transition count 101
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 34 place count 120 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 120 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 37 place count 120 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 38 place count 119 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 42 place count 117 transition count 96
Applied a total of 42 rules in 11 ms. Remains 117 /146 variables (removed 29) and now considering 96/149 (removed 53) transitions.
[2024-05-25 15:42:14] [INFO ] Flow matrix only has 95 transitions (discarded 1 similar events)
// Phase 1: matrix 95 rows 117 cols
[2024-05-25 15:42:14] [INFO ] Computed 40 invariants in 19 ms
[2024-05-25 15:42:14] [INFO ] Implicit Places using invariants in 128 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 140 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/158 places, 96/149 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 639 ms. Remains : 114/158 places, 96/149 transitions.
Computed a total of 41 stabilizing places and 44 stable transitions
Computed a total of 41 stabilizing places and 44 stable transitions
Detected a total of 41/114 stabilizing places and 44/96 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 289 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p1)]
Finished random walk after 4231 steps, including 768 resets, run visited all 1 properties in 7 ms. (steps per millisecond=604 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Product exploration explored 100000 steps with 16199 reset in 206 ms.
Product exploration explored 100000 steps with 16304 reset in 196 ms.
Built C files in :
/tmp/ltsmin3792249374463909472
[2024-05-25 15:42:15] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2024-05-25 15:42:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:42:15] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2024-05-25 15:42:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:42:15] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2024-05-25 15:42:15] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:42:15] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3792249374463909472
Running compilation step : cd /tmp/ltsmin3792249374463909472;'/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 343 ms.
Running link step : cd /tmp/ltsmin3792249374463909472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin3792249374463909472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7007294340076808909.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 96/96 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 95
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 95
Applied a total of 2 rules in 31 ms. Remains 113 /114 variables (removed 1) and now considering 95/96 (removed 1) transitions.
[2024-05-25 15:42:31] [INFO ] Flow matrix only has 94 transitions (discarded 1 similar events)
// Phase 1: matrix 94 rows 113 cols
[2024-05-25 15:42:31] [INFO ] Computed 37 invariants in 1 ms
[2024-05-25 15:42:31] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-25 15:42:31] [INFO ] Flow matrix only has 94 transitions (discarded 1 similar events)
[2024-05-25 15:42:31] [INFO ] Invariant cache hit.
[2024-05-25 15:42:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 15:42:31] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [24, 26, 28]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 305 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/114 places, 95/96 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 110 transition count 92
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 107 transition count 92
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 29 place count 93 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 90 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 90 transition count 80
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 37 place count 89 transition count 79
Applied a total of 37 rules in 8 ms. Remains 89 /110 variables (removed 21) and now considering 79/95 (removed 16) transitions.
[2024-05-25 15:42:31] [INFO ] Flow matrix only has 78 transitions (discarded 1 similar events)
// Phase 1: matrix 78 rows 89 cols
[2024-05-25 15:42:31] [INFO ] Computed 29 invariants in 0 ms
[2024-05-25 15:42:31] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-25 15:42:31] [INFO ] Flow matrix only has 78 transitions (discarded 1 similar events)
[2024-05-25 15:42:31] [INFO ] Invariant cache hit.
[2024-05-25 15:42:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 15:42:31] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/114 places, 79/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 534 ms. Remains : 89/114 places, 79/96 transitions.
Built C files in :
/tmp/ltsmin7019386535521719294
[2024-05-25 15:42:31] [INFO ] Computing symmetric may disable matrix : 79 transitions.
[2024-05-25 15:42:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:42:31] [INFO ] Computing symmetric may enable matrix : 79 transitions.
[2024-05-25 15:42:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:42:31] [INFO ] Computing Do-Not-Accords matrix : 79 transitions.
[2024-05-25 15:42:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:42:31] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7019386535521719294
Running compilation step : cd /tmp/ltsmin7019386535521719294;'/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 225 ms.
Running link step : cd /tmp/ltsmin7019386535521719294;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin7019386535521719294;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13209314625914014711.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:42:46] [INFO ] Flatten gal took : 18 ms
[2024-05-25 15:42:46] [INFO ] Flatten gal took : 4 ms
[2024-05-25 15:42:46] [INFO ] Time to serialize gal into /tmp/LTL10177324732682117233.gal : 28 ms
[2024-05-25 15:42:46] [INFO ] Time to serialize properties into /tmp/LTL14269160869525601040.prop : 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/LTL10177324732682117233.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8856620028524638389.hoa' '-atoms' '/tmp/LTL14269160869525601040.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...319
Loading property file /tmp/LTL14269160869525601040.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8856620028524638389.hoa
Detected timeout of ITS tools.
[2024-05-25 15:43:01] [INFO ] Flatten gal took : 14 ms
[2024-05-25 15:43:01] [INFO ] Flatten gal took : 13 ms
[2024-05-25 15:43:01] [INFO ] Time to serialize gal into /tmp/LTL9921368238357458704.gal : 3 ms
[2024-05-25 15:43:01] [INFO ] Time to serialize properties into /tmp/LTL2614689143601937393.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/LTL9921368238357458704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2614689143601937393.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...275
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p768==0)")&&(X(G("(p709==0)")))))))
Formula 0 simplified : XG(!"(p768==0)" | XF!"(p709==0)")
Detected timeout of ITS tools.
[2024-05-25 15:43:16] [INFO ] Flatten gal took : 5 ms
[2024-05-25 15:43:16] [INFO ] Applying decomposition
[2024-05-25 15:43:16] [INFO ] Flatten gal took : 6 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/graph12450534406489465575.txt' '-o' '/tmp/graph12450534406489465575.bin' '-w' '/tmp/graph12450534406489465575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12450534406489465575.bin' '-l' '-1' '-v' '-w' '/tmp/graph12450534406489465575.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:43:17] [INFO ] Decomposing Gal with order
[2024-05-25 15:43:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:43:17] [INFO ] Removed a total of 162 redundant transitions.
[2024-05-25 15:43:17] [INFO ] Flatten gal took : 12 ms
[2024-05-25 15:43:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 11 ms.
[2024-05-25 15:43:17] [INFO ] Time to serialize gal into /tmp/LTL10567591296546714823.gal : 3 ms
[2024-05-25 15:43:17] [INFO ] Time to serialize properties into /tmp/LTL5898300969743449039.ltl : 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/LTL10567591296546714823.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5898300969743449039.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...255
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i7.u38.p768==0)")&&(X(G("(i4.i0.u33.p709==0)")))))))
Formula 0 simplified : XG(!"(i7.u38.p768==0)" | XF!"(i4.i0.u33.p709==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14372648950206019031
[2024-05-25 15:43:32] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14372648950206019031
Running compilation step : cd /tmp/ltsmin14372648950206019031;'/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 184 ms.
Running link step : cd /tmp/ltsmin14372648950206019031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin14372648950206019031;'/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(<>(((LTLAPp0==true)&&X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-20-LTLCardinality-12 finished in 96279 ms.
[2024-05-25 15:43:47] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
[2024-05-25 15:43:47] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin12305391224005503364
[2024-05-25 15:43:47] [INFO ] Computing symmetric may disable matrix : 480 transitions.
[2024-05-25 15:43:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:43:47] [INFO ] Computing symmetric may enable matrix : 480 transitions.
[2024-05-25 15:43:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:43:47] [INFO ] Flatten gal took : 76 ms
[2024-05-25 15:43:47] [INFO ] Computing Do-Not-Accords matrix : 480 transitions.
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/graph17735055429325199763.txt' '-o' '/tmp/graph17735055429325199763.bin' '-w' '/tmp/graph17735055429325199763.weights'
[2024-05-25 15:43:47] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17735055429325199763.bin' '-l' '-1' '-v' '-w' '/tmp/graph17735055429325199763.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:43:47] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12305391224005503364
Running compilation step : cd /tmp/ltsmin12305391224005503364;'/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'
[2024-05-25 15:43:47] [INFO ] Decomposing Gal with order
[2024-05-25 15:43:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:43:47] [INFO ] Removed a total of 282 redundant transitions.
[2024-05-25 15:43:47] [INFO ] Flatten gal took : 36 ms
[2024-05-25 15:43:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2024-05-25 15:43:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality1873941648802351724.gal : 6 ms
[2024-05-25 15:43:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality2522955062709538689.ltl : 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/LTLCardinality1873941648802351724.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2522955062709538689.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...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i3.i2.u191.p768==0)")&&(X(G("(i16.u153.p709==0)")))))))
Formula 0 simplified : XG(!"(i3.i2.u191.p768==0)" | XF!"(i16.u153.p709==0)")
Compilation finished in 1272 ms.
Running link step : cd /tmp/ltsmin12305391224005503364;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 99 ms.
Running LTSmin : cd /tmp/ltsmin12305391224005503364;'/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(<>(((LTLAPp0==true)&&X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t207, t302, t320, t365, t379, t381, t382, t384, t386, t388, t389, t390, t393,...1595
Computing Next relation with stutter on 1.99596e+09 deadlock states
Detected timeout of ITS tools.
[2024-05-25 16:04:58] [INFO ] Applying decomposition
[2024-05-25 16:04:58] [INFO ] Flatten gal took : 26 ms
[2024-05-25 16:04:58] [INFO ] Decomposing Gal with order
[2024-05-25 16:04:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:04:58] [INFO ] Removed a total of 149 redundant transitions.
[2024-05-25 16:04:59] [INFO ] Flatten gal took : 108 ms
[2024-05-25 16:04:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 252 labels/synchronizations in 499 ms.
[2024-05-25 16:04:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality3199022030767579949.gal : 8 ms
[2024-05-25 16:04:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality6659199933128466840.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/LTLCardinality3199022030767579949.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6659199933128466840.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...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i1.u176.p768==0)")&&(X(G("(i1.u182.p709==0)")))))))
Formula 0 simplified : XG(!"(i1.u176.p768==0)" | XF!"(i1.u182.p709==0)")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 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( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: 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( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.062: LTL layer: formula: X(<>(((LTLAPp0==true)&&X([]((LTLAPp1==true))))))
pins2lts-mc-linux64( 2/ 8), 0.062: "X(<>(((LTLAPp0==true)&&X([]((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.108: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.121: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.133: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.141: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.144: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.157: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.159: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.329: There are 483 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.330: State length is 548, there are 489 groups
pins2lts-mc-linux64( 0/ 8), 0.330: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.330: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.330: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.330: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.473: [Blue] ~120 levels ~960 states ~4336 transitions
pins2lts-mc-linux64( 1/ 8), 0.555: [Blue] ~177 levels ~1920 states ~7480 transitions
pins2lts-mc-linux64( 2/ 8), 0.665: [Blue] ~176 levels ~3840 states ~17640 transitions
pins2lts-mc-linux64( 7/ 8), 0.934: [Blue] ~686 levels ~7680 states ~20640 transitions
pins2lts-mc-linux64( 7/ 8), 1.239: [Blue] ~686 levels ~15360 states ~50784 transitions
pins2lts-mc-linux64( 7/ 8), 2.092: [Blue] ~686 levels ~30720 states ~120424 transitions
pins2lts-mc-linux64( 7/ 8), 3.522: [Blue] ~686 levels ~61440 states ~270328 transitions
pins2lts-mc-linux64( 4/ 8), 5.682: [Blue] ~602 levels ~122880 states ~613184 transitions
pins2lts-mc-linux64( 7/ 8), 10.016: [Blue] ~686 levels ~245760 states ~1348784 transitions
pins2lts-mc-linux64( 6/ 8), 19.183: [Blue] ~850 levels ~491520 states ~2337256 transitions
pins2lts-mc-linux64( 6/ 8), 33.606: [Blue] ~850 levels ~983040 states ~5303384 transitions
pins2lts-mc-linux64( 7/ 8), 55.687: [Blue] ~686 levels ~1966080 states ~13751560 transitions
pins2lts-mc-linux64( 7/ 8), 86.171: [Blue] ~686 levels ~3932160 states ~29254720 transitions
pins2lts-mc-linux64( 6/ 8), 148.944: [Blue] ~850 levels ~7864320 states ~52612072 transitions
pins2lts-mc-linux64( 6/ 8), 269.148: [Blue] ~850 levels ~15728640 states ~113130040 transitions
pins2lts-mc-linux64( 6/ 8), 505.261: [Blue] ~850 levels ~31457280 states ~240629496 transitions
pins2lts-mc-linux64( 6/ 8), 986.550: [Blue] ~850 levels ~62914560 states ~512849384 transitions
pins2lts-mc-linux64( 3/ 8), 1651.820: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1651.854:
pins2lts-mc-linux64( 0/ 8), 1651.854: Explored 108027898 states 1007012720 transitions, fanout: 9.322
pins2lts-mc-linux64( 0/ 8), 1651.854: Total exploration time 1651.490 sec (1651.450 sec minimum, 1651.478 sec on average)
pins2lts-mc-linux64( 0/ 8), 1651.854: States per second: 65412, Transitions per second: 609760
pins2lts-mc-linux64( 0/ 8), 1651.854:
pins2lts-mc-linux64( 0/ 8), 1651.854: State space has 107789624 states, 272524 are accepting
pins2lts-mc-linux64( 0/ 8), 1651.854: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1651.854: blue states: 108027898 (100.22%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1651.854: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1651.854: all-red states: 272769 (0.25%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1651.854:
pins2lts-mc-linux64( 0/ 8), 1651.854: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 1651.854:
pins2lts-mc-linux64( 0/ 8), 1651.854: Queue width: 8B, total height: 7725, memory: 0.06MB
pins2lts-mc-linux64( 0/ 8), 1651.854: Tree memory: 1078.4MB, 10.5 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 1651.854: Tree fill ratio (roots/leafs): 80.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1651.854: Stored 483 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1651.854: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1651.854: Est. total memory use: 1078.4MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12305391224005503364;'/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(<>(((LTLAPp0==true)&&X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12305391224005503364;'/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(<>(((LTLAPp0==true)&&X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-25 16:26:12] [INFO ] Flatten gal took : 369 ms
[2024-05-25 16:26:13] [INFO ] Input system was already deterministic with 480 transitions.
[2024-05-25 16:26:13] [INFO ] Transformed 547 places.
[2024-05-25 16:26:13] [INFO ] Transformed 480 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 16:26:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality6138696392792865669.gal : 22 ms
[2024-05-25 16:26:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality17636761149484866109.ltl : 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/LTLCardinality6138696392792865669.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17636761149484866109.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(("(p768==0)")&&(X(G("(p709==0)")))))))
Formula 0 simplified : XG(!"(p768==0)" | XF!"(p709==0)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 169296 kB
After kill :
MemTotal: 16393356 kB
MemFree: 12319820 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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-20"
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-20, 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-171620415000377"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-20.tgz
mv BusinessProcesses-PT-20 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 '
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 ;