Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813592600027.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ASLink-PT-02a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813592600027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 13:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 13:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 13:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 13:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 279K Mar 5 18:22 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 ASLink-PT-02a-LTLCardinality-00
FORMULA_NAME ASLink-PT-02a-LTLCardinality-01
FORMULA_NAME ASLink-PT-02a-LTLCardinality-02
FORMULA_NAME ASLink-PT-02a-LTLCardinality-03
FORMULA_NAME ASLink-PT-02a-LTLCardinality-04
FORMULA_NAME ASLink-PT-02a-LTLCardinality-05
FORMULA_NAME ASLink-PT-02a-LTLCardinality-06
FORMULA_NAME ASLink-PT-02a-LTLCardinality-07
FORMULA_NAME ASLink-PT-02a-LTLCardinality-08
FORMULA_NAME ASLink-PT-02a-LTLCardinality-09
FORMULA_NAME ASLink-PT-02a-LTLCardinality-10
FORMULA_NAME ASLink-PT-02a-LTLCardinality-11
FORMULA_NAME ASLink-PT-02a-LTLCardinality-12
FORMULA_NAME ASLink-PT-02a-LTLCardinality-13
FORMULA_NAME ASLink-PT-02a-LTLCardinality-14
FORMULA_NAME ASLink-PT-02a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678485921776

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-10 22:05:23] [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]
[2023-03-10 22:05:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:05:24] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-10 22:05:24] [INFO ] Transformed 626 places.
[2023-03-10 22:05:24] [INFO ] Transformed 1008 transitions.
[2023-03-10 22:05:24] [INFO ] Found NUPN structural information;
[2023-03-10 22:05:24] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-02a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 614 transition count 998
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 19 place count 607 transition count 973
Ensure Unique test removed 1 places
Iterating global reduction 1 with 8 rules applied. Total rules applied 27 place count 606 transition count 973
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 606 transition count 971
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 605 transition count 963
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 605 transition count 963
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 604 transition count 955
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 604 transition count 955
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 603 transition count 947
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 603 transition count 947
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 602 transition count 939
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 602 transition count 939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 601 transition count 931
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 601 transition count 931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 600 transition count 923
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 600 transition count 923
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 599 transition count 915
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 599 transition count 915
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 598 transition count 907
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 598 transition count 907
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 597 transition count 899
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 597 transition count 899
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 596 transition count 891
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 596 transition count 891
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 595 transition count 883
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 595 transition count 883
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 594 transition count 875
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 594 transition count 875
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 593 transition count 867
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 593 transition count 867
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 592 transition count 859
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 592 transition count 859
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 591 transition count 851
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 591 transition count 851
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 590 transition count 843
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 590 transition count 843
Applied a total of 61 rules in 487 ms. Remains 590 /626 variables (removed 36) and now considering 843/998 (removed 155) transitions.
// Phase 1: matrix 843 rows 590 cols
[2023-03-10 22:05:24] [INFO ] Computed 105 place invariants in 32 ms
[2023-03-10 22:05:25] [INFO ] Implicit Places using invariants in 518 ms returned [1, 19, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 391, 403, 408, 409, 410, 428, 430, 433, 451, 452, 453, 454, 471, 479, 487, 493, 499, 505, 511, 519, 525, 531, 539]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 546 ms to find 37 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 553/626 places, 843/998 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 540 transition count 830
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 540 transition count 830
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 530 transition count 820
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 530 transition count 820
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 525 transition count 815
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 525 transition count 815
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 523 transition count 813
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 523 transition count 813
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 521 transition count 811
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 521 transition count 811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 520 transition count 810
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 520 transition count 810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 519 transition count 809
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 519 transition count 809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 518 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 518 transition count 808
Applied a total of 70 rules in 69 ms. Remains 518 /553 variables (removed 35) and now considering 808/843 (removed 35) transitions.
// Phase 1: matrix 808 rows 518 cols
[2023-03-10 22:05:25] [INFO ] Computed 68 place invariants in 12 ms
[2023-03-10 22:05:25] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-10 22:05:25] [INFO ] Invariant cache hit.
[2023-03-10 22:05:26] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 518/626 places, 808/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2309 ms. Remains : 518/626 places, 808/998 transitions.
Support contains 30 out of 518 places after structural reductions.
[2023-03-10 22:05:27] [INFO ] Flatten gal took : 95 ms
[2023-03-10 22:05:27] [INFO ] Flatten gal took : 43 ms
[2023-03-10 22:05:27] [INFO ] Input system was already deterministic with 808 transitions.
Support contains 28 out of 518 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 126 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 17) seen :14
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 22:05:27] [INFO ] Invariant cache hit.
[2023-03-10 22:05:27] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 22:05:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-10 22:05:27] [INFO ] [Nat]Absence check using 17 positive and 51 generalized place invariants in 15 ms returned sat
[2023-03-10 22:05:28] [INFO ] After 467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 22:05:28] [INFO ] After 786ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-03-10 22:05:28] [INFO ] After 1118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 66 ms.
Support contains 6 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 808/808 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 518 transition count 720
Reduce places removed 88 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 91 rules applied. Total rules applied 179 place count 430 transition count 717
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 182 place count 427 transition count 717
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 182 place count 427 transition count 656
Deduced a syphon composed of 61 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 322 place count 348 transition count 656
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 15 rules applied. Total rules applied 337 place count 342 transition count 647
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 346 place count 333 transition count 647
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 346 place count 333 transition count 642
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 356 place count 328 transition count 642
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 361 place count 323 transition count 637
Iterating global reduction 5 with 5 rules applied. Total rules applied 366 place count 323 transition count 637
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 4 rules applied. Total rules applied 370 place count 323 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 371 place count 322 transition count 633
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 371 place count 322 transition count 632
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 373 place count 321 transition count 632
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 445 place count 285 transition count 596
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 447 place count 285 transition count 594
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 449 place count 283 transition count 594
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 459 place count 283 transition count 584
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 470 place count 272 transition count 584
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 472 place count 272 transition count 582
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 479 place count 272 transition count 582
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 480 place count 271 transition count 581
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 483 place count 268 transition count 581
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 483 place count 268 transition count 577
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 493 place count 262 transition count 577
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 495 place count 260 transition count 575
Iterating global reduction 10 with 2 rules applied. Total rules applied 497 place count 260 transition count 575
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 499 place count 260 transition count 573
Applied a total of 499 rules in 152 ms. Remains 260 /518 variables (removed 258) and now considering 573/808 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 260/518 places, 573/808 transitions.
Incomplete random walk after 10000 steps, including 212 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Finished probabilistic random walk after 16490 steps, run visited all 3 properties in 104 ms. (steps per millisecond=158 )
Probabilistic random walk after 16490 steps, saw 7089 distinct states, run finished after 105 ms. (steps per millisecond=157 ) properties seen :3
FORMULA ASLink-PT-02a-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 808/808 transitions.
Applied a total of 0 rules in 35 ms. Remains 518 /518 variables (removed 0) and now considering 808/808 (removed 0) transitions.
[2023-03-10 22:05:30] [INFO ] Invariant cache hit.
[2023-03-10 22:05:30] [INFO ] Implicit Places using invariants in 290 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 294 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 517/518 places, 808/808 transitions.
Applied a total of 0 rules in 10 ms. Remains 517 /517 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 339 ms. Remains : 517/518 places, 808/808 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s370 0) (EQ s130 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 570 ms.
Product exploration explored 100000 steps with 33333 reset in 406 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-02a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-02a-LTLCardinality-05 finished in 1828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(p0 U p1)))'
Support contains 3 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 808/808 transitions.
Applied a total of 0 rules in 22 ms. Remains 518 /518 variables (removed 0) and now considering 808/808 (removed 0) transitions.
[2023-03-10 22:05:31] [INFO ] Invariant cache hit.
[2023-03-10 22:05:32] [INFO ] Implicit Places using invariants in 261 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 262 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 517/518 places, 808/808 transitions.
Applied a total of 0 rules in 8 ms. Remains 517 /517 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 293 ms. Remains : 517/518 places, 808/808 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-02a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s106 0) (EQ s385 1)), p0:(EQ s377 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLCardinality-06 finished in 487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 518 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 518/518 places, 808/808 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 517 transition count 716
Reduce places removed 93 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 95 rules applied. Total rules applied 186 place count 424 transition count 714
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 188 place count 422 transition count 714
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 188 place count 422 transition count 648
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 151 rules applied. Total rules applied 339 place count 337 transition count 648
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 22 rules applied. Total rules applied 361 place count 328 transition count 635
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 374 place count 315 transition count 635
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 374 place count 315 transition count 627
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 390 place count 307 transition count 627
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 397 place count 300 transition count 620
Iterating global reduction 5 with 7 rules applied. Total rules applied 404 place count 300 transition count 620
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 5 with 6 rules applied. Total rules applied 410 place count 300 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 411 place count 299 transition count 614
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 411 place count 299 transition count 613
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 413 place count 298 transition count 613
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 7 with 68 rules applied. Total rules applied 481 place count 264 transition count 579
Applied a total of 481 rules in 87 ms. Remains 264 /518 variables (removed 254) and now considering 579/808 (removed 229) transitions.
// Phase 1: matrix 579 rows 264 cols
[2023-03-10 22:05:32] [INFO ] Computed 38 place invariants in 6 ms
[2023-03-10 22:05:32] [INFO ] Implicit Places using invariants in 176 ms returned [17, 75, 92, 98, 103, 162, 183, 191, 196, 198, 261]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 177 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 253/518 places, 579/808 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 253 transition count 577
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 251 transition count 577
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 251 transition count 576
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 6 place count 250 transition count 576
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 9 place count 247 transition count 573
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 247 transition count 573
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 244 transition count 570
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 244 transition count 570
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 243 transition count 569
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 243 transition count 569
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 239 transition count 565
Applied a total of 28 rules in 43 ms. Remains 239 /253 variables (removed 14) and now considering 565/579 (removed 14) transitions.
// Phase 1: matrix 565 rows 239 cols
[2023-03-10 22:05:32] [INFO ] Computed 27 place invariants in 6 ms
[2023-03-10 22:05:32] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-10 22:05:32] [INFO ] Invariant cache hit.
[2023-03-10 22:05:33] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 239/518 places, 565/808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 999 ms. Remains : 239/518 places, 565/808 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-02a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s180 0) (EQ s168 1)), p0:(OR (EQ s184 0) (EQ s166 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2789 reset in 262 ms.
Product exploration explored 100000 steps with 2892 reset in 243 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3323 steps, including 72 resets, run visited all 2 properties in 23 ms. (steps per millisecond=144 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 416 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 565/565 transitions.
Applied a total of 0 rules in 24 ms. Remains 239 /239 variables (removed 0) and now considering 565/565 (removed 0) transitions.
[2023-03-10 22:05:35] [INFO ] Invariant cache hit.
[2023-03-10 22:05:35] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-10 22:05:35] [INFO ] Invariant cache hit.
[2023-03-10 22:05:36] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
[2023-03-10 22:05:36] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-10 22:05:36] [INFO ] Invariant cache hit.
[2023-03-10 22:05:36] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1304 ms. Remains : 239/239 places, 565/565 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 279 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 471 steps, including 10 resets, run visited all 2 properties in 9 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 338 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2883 reset in 198 ms.
Product exploration explored 100000 steps with 2818 reset in 188 ms.
Built C files in :
/tmp/ltsmin15418292431562392420
[2023-03-10 22:05:38] [INFO ] Computing symmetric may disable matrix : 565 transitions.
[2023-03-10 22:05:38] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:05:38] [INFO ] Computing symmetric may enable matrix : 565 transitions.
[2023-03-10 22:05:38] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:05:38] [INFO ] Computing Do-Not-Accords matrix : 565 transitions.
[2023-03-10 22:05:38] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:05:38] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15418292431562392420
Running compilation step : cd /tmp/ltsmin15418292431562392420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1512 ms.
Running link step : cd /tmp/ltsmin15418292431562392420;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 105 ms.
Running LTSmin : cd /tmp/ltsmin15418292431562392420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8987652968580825043.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 565/565 transitions.
Applied a total of 0 rules in 20 ms. Remains 239 /239 variables (removed 0) and now considering 565/565 (removed 0) transitions.
[2023-03-10 22:05:53] [INFO ] Invariant cache hit.
[2023-03-10 22:05:53] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-10 22:05:53] [INFO ] Invariant cache hit.
[2023-03-10 22:05:53] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
[2023-03-10 22:05:53] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-10 22:05:53] [INFO ] Invariant cache hit.
[2023-03-10 22:05:54] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 971 ms. Remains : 239/239 places, 565/565 transitions.
Built C files in :
/tmp/ltsmin12474641634878308263
[2023-03-10 22:05:54] [INFO ] Computing symmetric may disable matrix : 565 transitions.
[2023-03-10 22:05:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:05:54] [INFO ] Computing symmetric may enable matrix : 565 transitions.
[2023-03-10 22:05:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:05:54] [INFO ] Computing Do-Not-Accords matrix : 565 transitions.
[2023-03-10 22:05:54] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:05:54] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12474641634878308263
Running compilation step : cd /tmp/ltsmin12474641634878308263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1276 ms.
Running link step : cd /tmp/ltsmin12474641634878308263;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin12474641634878308263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17211781083308355343.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 22:06:09] [INFO ] Flatten gal took : 31 ms
[2023-03-10 22:06:09] [INFO ] Flatten gal took : 32 ms
[2023-03-10 22:06:09] [INFO ] Time to serialize gal into /tmp/LTL12317210380851544739.gal : 5 ms
[2023-03-10 22:06:09] [INFO ] Time to serialize properties into /tmp/LTL14537357958252960516.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12317210380851544739.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14489396947257973712.hoa' '-atoms' '/tmp/LTL14537357958252960516.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14537357958252960516.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14489396947257973712.hoa
Detected timeout of ITS tools.
[2023-03-10 22:06:24] [INFO ] Flatten gal took : 26 ms
[2023-03-10 22:06:24] [INFO ] Flatten gal took : 24 ms
[2023-03-10 22:06:24] [INFO ] Time to serialize gal into /tmp/LTL12277493699327488278.gal : 3 ms
[2023-03-10 22:06:24] [INFO ] Time to serialize properties into /tmp/LTL1624668306178392742.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12277493699327488278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1624668306178392742.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((p412==0)||(p334==1))")))||(G("((p408==0)&&(p339==1))")))))
Formula 0 simplified : G(FG!"((p412==0)||(p334==1))" & F!"((p408==0)&&(p339==1))")
Detected timeout of ITS tools.
[2023-03-10 22:06:39] [INFO ] Flatten gal took : 51 ms
[2023-03-10 22:06:39] [INFO ] Applying decomposition
[2023-03-10 22:06:39] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17152466604017874309.txt' '-o' '/tmp/graph17152466604017874309.bin' '-w' '/tmp/graph17152466604017874309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17152466604017874309.bin' '-l' '-1' '-v' '-w' '/tmp/graph17152466604017874309.weights' '-q' '0' '-e' '0.001'
[2023-03-10 22:06:39] [INFO ] Decomposing Gal with order
[2023-03-10 22:06:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 22:06:39] [INFO ] Removed a total of 1136 redundant transitions.
[2023-03-10 22:06:39] [INFO ] Flatten gal took : 72 ms
[2023-03-10 22:06:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 15 ms.
[2023-03-10 22:06:40] [INFO ] Time to serialize gal into /tmp/LTL17021412755147492983.gal : 6 ms
[2023-03-10 22:06:40] [INFO ] Time to serialize properties into /tmp/LTL5631295205460891609.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17021412755147492983.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5631295205460891609.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((i4.i0.u49.p412==0)||(i4.i1.u45.p334==1))")))||(G("((i4.i0.u48.p408==0)&&(i4.i1.u46.p339==1))")))))
Formula 0 simplified : G(FG!"((i4.i0.u49.p412==0)||(i4.i1.u45.p334==1))" & F!"((i4.i0.u48.p408==0)&&(i4.i1.u46.p339==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17323557771935151368
[2023-03-10 22:06:55] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17323557771935151368
Running compilation step : cd /tmp/ltsmin17323557771935151368;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 839 ms.
Running link step : cd /tmp/ltsmin17323557771935151368;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin17323557771935151368;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ASLink-PT-02a-LTLCardinality-07 finished in 97874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(G(p2)&&p1))))'
Support contains 5 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 808/808 transitions.
Applied a total of 0 rules in 23 ms. Remains 518 /518 variables (removed 0) and now considering 808/808 (removed 0) transitions.
// Phase 1: matrix 808 rows 518 cols
[2023-03-10 22:07:10] [INFO ] Computed 68 place invariants in 5 ms
[2023-03-10 22:07:10] [INFO ] Implicit Places using invariants in 326 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 329 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 517/518 places, 808/808 transitions.
Applied a total of 0 rules in 18 ms. Remains 517 /517 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 370 ms. Remains : 517/518 places, 808/808 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : ASLink-PT-02a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s129 0) (EQ s197 1)), p2:(EQ s367 0), p0:(OR (EQ s62 0) (EQ s174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33239 reset in 421 ms.
Product exploration explored 100000 steps with 33564 reset in 398 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (X p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 339 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 133 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 808 rows 517 cols
[2023-03-10 22:07:12] [INFO ] Computed 67 place invariants in 5 ms
[2023-03-10 22:07:12] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-10 22:07:12] [INFO ] [Real]Absence check using 20 positive and 47 generalized place invariants in 17 ms returned sat
[2023-03-10 22:07:13] [INFO ] After 540ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 22:07:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 22 ms returned sat
[2023-03-10 22:07:13] [INFO ] [Nat]Absence check using 20 positive and 47 generalized place invariants in 33 ms returned sat
[2023-03-10 22:07:14] [INFO ] After 613ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 22:07:14] [INFO ] After 1084ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 243 ms.
[2023-03-10 22:07:14] [INFO ] After 1607ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 79 ms.
Support contains 5 out of 517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 517/517 places, 808/808 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 517 transition count 724
Reduce places removed 84 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 88 rules applied. Total rules applied 172 place count 433 transition count 720
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 176 place count 429 transition count 720
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 176 place count 429 transition count 657
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 145 rules applied. Total rules applied 321 place count 347 transition count 657
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 15 rules applied. Total rules applied 336 place count 341 transition count 648
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 345 place count 332 transition count 648
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 345 place count 332 transition count 642
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 357 place count 326 transition count 642
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 362 place count 321 transition count 637
Iterating global reduction 5 with 5 rules applied. Total rules applied 367 place count 321 transition count 637
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 4 rules applied. Total rules applied 371 place count 321 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 372 place count 320 transition count 633
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 372 place count 320 transition count 632
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 374 place count 319 transition count 632
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 7 with 64 rules applied. Total rules applied 438 place count 287 transition count 600
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 440 place count 287 transition count 598
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 442 place count 285 transition count 598
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 8 with 13 rules applied. Total rules applied 455 place count 285 transition count 585
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 469 place count 271 transition count 585
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 470 place count 271 transition count 584
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 477 place count 271 transition count 584
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 479 place count 271 transition count 584
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 480 place count 271 transition count 583
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 481 place count 270 transition count 582
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 483 place count 268 transition count 582
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 483 place count 268 transition count 579
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 490 place count 264 transition count 579
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 491 place count 263 transition count 578
Iterating global reduction 10 with 1 rules applied. Total rules applied 492 place count 263 transition count 578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 493 place count 263 transition count 577
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 494 place count 263 transition count 576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 495 place count 262 transition count 576
Applied a total of 495 rules in 112 ms. Remains 262 /517 variables (removed 255) and now considering 576/808 (removed 232) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 262/517 places, 576/808 transitions.
Incomplete random walk after 10000 steps, including 198 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 576 rows 262 cols
[2023-03-10 22:07:15] [INFO ] Computed 38 place invariants in 4 ms
[2023-03-10 22:07:15] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-10 22:07:15] [INFO ] [Real]Absence check using 8 positive and 30 generalized place invariants in 11 ms returned sat
[2023-03-10 22:07:15] [INFO ] After 171ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-10 22:07:15] [INFO ] After 207ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-10 22:07:15] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 22:07:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-10 22:07:15] [INFO ] [Nat]Absence check using 8 positive and 30 generalized place invariants in 11 ms returned sat
[2023-03-10 22:07:16] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 22:07:16] [INFO ] After 332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-10 22:07:16] [INFO ] After 456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 262 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 576/576 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 262 transition count 575
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 260 transition count 575
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 3 place count 260 transition count 574
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 259 transition count 574
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 256 transition count 571
Applied a total of 11 rules in 28 ms. Remains 256 /262 variables (removed 6) and now considering 571/576 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 256/262 places, 571/576 transitions.
Incomplete random walk after 10000 steps, including 227 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Finished probabilistic random walk after 820 steps, run visited all 2 properties in 13 ms. (steps per millisecond=63 )
Probabilistic random walk after 820 steps, saw 687 distinct states, run finished after 13 ms. (steps per millisecond=63 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (X p2)), true]
False Knowledge obtained : [(F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p0)), (F (AND p1 p2))]
Knowledge based reduction with 6 factoid took 502 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Support contains 5 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 808/808 transitions.
Applied a total of 0 rules in 16 ms. Remains 517 /517 variables (removed 0) and now considering 808/808 (removed 0) transitions.
// Phase 1: matrix 808 rows 517 cols
[2023-03-10 22:07:17] [INFO ] Computed 67 place invariants in 10 ms
[2023-03-10 22:07:17] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-10 22:07:17] [INFO ] Invariant cache hit.
[2023-03-10 22:07:18] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
[2023-03-10 22:07:18] [INFO ] Invariant cache hit.
[2023-03-10 22:07:19] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1643 ms. Remains : 517/517 places, 808/808 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (X p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 406 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 109 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 22:07:20] [INFO ] Invariant cache hit.
[2023-03-10 22:07:20] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-10 22:07:20] [INFO ] [Real]Absence check using 20 positive and 47 generalized place invariants in 33 ms returned sat
[2023-03-10 22:07:20] [INFO ] After 574ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 22:07:20] [INFO ] [Nat]Absence check using 20 positive place invariants in 19 ms returned sat
[2023-03-10 22:07:20] [INFO ] [Nat]Absence check using 20 positive and 47 generalized place invariants in 18 ms returned sat
[2023-03-10 22:07:21] [INFO ] After 458ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 22:07:21] [INFO ] After 728ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-10 22:07:21] [INFO ] After 1098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 104 ms.
Support contains 5 out of 517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 517/517 places, 808/808 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 517 transition count 724
Reduce places removed 84 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 88 rules applied. Total rules applied 172 place count 433 transition count 720
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 176 place count 429 transition count 720
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 176 place count 429 transition count 657
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 145 rules applied. Total rules applied 321 place count 347 transition count 657
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 15 rules applied. Total rules applied 336 place count 341 transition count 648
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 345 place count 332 transition count 648
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 345 place count 332 transition count 642
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 357 place count 326 transition count 642
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 362 place count 321 transition count 637
Iterating global reduction 5 with 5 rules applied. Total rules applied 367 place count 321 transition count 637
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 4 rules applied. Total rules applied 371 place count 321 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 372 place count 320 transition count 633
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 372 place count 320 transition count 632
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 374 place count 319 transition count 632
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 7 with 64 rules applied. Total rules applied 438 place count 287 transition count 600
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 440 place count 287 transition count 598
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 442 place count 285 transition count 598
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 8 with 13 rules applied. Total rules applied 455 place count 285 transition count 585
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 469 place count 271 transition count 585
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 470 place count 271 transition count 584
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 477 place count 271 transition count 584
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 479 place count 271 transition count 584
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 480 place count 271 transition count 583
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 481 place count 270 transition count 582
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 483 place count 268 transition count 582
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 483 place count 268 transition count 579
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 490 place count 264 transition count 579
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 491 place count 263 transition count 578
Iterating global reduction 10 with 1 rules applied. Total rules applied 492 place count 263 transition count 578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 493 place count 263 transition count 577
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 494 place count 263 transition count 576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 495 place count 262 transition count 576
Applied a total of 495 rules in 95 ms. Remains 262 /517 variables (removed 255) and now considering 576/808 (removed 232) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 262/517 places, 576/808 transitions.
Incomplete random walk after 10000 steps, including 200 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 576 rows 262 cols
[2023-03-10 22:07:22] [INFO ] Computed 38 place invariants in 9 ms
[2023-03-10 22:07:22] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-10 22:07:22] [INFO ] [Real]Absence check using 8 positive and 30 generalized place invariants in 11 ms returned sat
[2023-03-10 22:07:22] [INFO ] After 180ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-10 22:07:22] [INFO ] After 219ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-10 22:07:22] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 22:07:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-10 22:07:22] [INFO ] [Nat]Absence check using 8 positive and 30 generalized place invariants in 19 ms returned sat
[2023-03-10 22:07:23] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 22:07:23] [INFO ] After 306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-10 22:07:23] [INFO ] After 501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 262 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 576/576 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 262 transition count 575
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 260 transition count 575
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 3 place count 260 transition count 574
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 259 transition count 574
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 256 transition count 571
Applied a total of 11 rules in 32 ms. Remains 256 /262 variables (removed 6) and now considering 571/576 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 256/262 places, 571/576 transitions.
Incomplete random walk after 10000 steps, including 213 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Finished probabilistic random walk after 820 steps, run visited all 2 properties in 11 ms. (steps per millisecond=74 )
Probabilistic random walk after 820 steps, saw 687 distinct states, run finished after 11 ms. (steps per millisecond=74 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (X p2)), true]
False Knowledge obtained : [(F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p0)), (F (AND p1 p2))]
Knowledge based reduction with 6 factoid took 394 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Stuttering acceptance computed with spot in 328 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Stuttering acceptance computed with spot in 300 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Product exploration explored 100000 steps with 33373 reset in 419 ms.
Product exploration explored 100000 steps with 33200 reset in 368 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 270 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Support contains 5 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 808/808 transitions.
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 517 transition count 808
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 87 place count 517 transition count 821
Deduced a syphon composed of 124 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 124 place count 517 transition count 821
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 130 place count 514 transition count 821
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 149 place count 495 transition count 802
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 168 place count 495 transition count 802
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 168 place count 495 transition count 802
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 495 transition count 802
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 494 transition count 801
Deduced a syphon composed of 110 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 494 transition count 801
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 171 places in 0 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 232 place count 494 transition count 810
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 259 place count 467 transition count 783
Deduced a syphon composed of 144 places in 1 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 286 place count 467 transition count 783
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 146 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 288 place count 467 transition count 803
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 147 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 289 place count 467 transition count 807
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 291 place count 465 transition count 801
Deduced a syphon composed of 145 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 293 place count 465 transition count 801
Deduced a syphon composed of 145 places in 0 ms
Applied a total of 293 rules in 118 ms. Remains 465 /517 variables (removed 52) and now considering 801/808 (removed 7) transitions.
[2023-03-10 22:07:26] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 801 rows 465 cols
[2023-03-10 22:07:26] [INFO ] Computed 64 place invariants in 6 ms
[2023-03-10 22:07:26] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 465/517 places, 801/808 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 521 ms. Remains : 465/517 places, 801/808 transitions.
Built C files in :
/tmp/ltsmin16058393887619886780
[2023-03-10 22:07:26] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16058393887619886780
Running compilation step : cd /tmp/ltsmin16058393887619886780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1372 ms.
Running link step : cd /tmp/ltsmin16058393887619886780;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin16058393887619886780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12911330440115010891.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 808/808 transitions.
Applied a total of 0 rules in 30 ms. Remains 517 /517 variables (removed 0) and now considering 808/808 (removed 0) transitions.
// Phase 1: matrix 808 rows 517 cols
[2023-03-10 22:07:41] [INFO ] Computed 67 place invariants in 13 ms
[2023-03-10 22:07:42] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-10 22:07:42] [INFO ] Invariant cache hit.
[2023-03-10 22:07:42] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1325 ms to find 0 implicit places.
[2023-03-10 22:07:42] [INFO ] Invariant cache hit.
[2023-03-10 22:07:43] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1762 ms. Remains : 517/517 places, 808/808 transitions.
Built C files in :
/tmp/ltsmin17022050747381054989
[2023-03-10 22:07:43] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17022050747381054989
Running compilation step : cd /tmp/ltsmin17022050747381054989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1300 ms.
Running link step : cd /tmp/ltsmin17022050747381054989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin17022050747381054989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12296170389850195215.hoa' '--buchi-type=spotba'
LTSmin run took 9483 ms.
FORMULA ASLink-PT-02a-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-02a-LTLCardinality-08 finished in 44110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 5 out of 518 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 518/518 places, 808/808 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 518 transition count 717
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 182 place count 427 transition count 717
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 182 place count 427 transition count 654
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 328 place count 344 transition count 654
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 15 rules applied. Total rules applied 343 place count 338 transition count 645
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 352 place count 329 transition count 645
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 352 place count 329 transition count 638
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 366 place count 322 transition count 638
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 371 place count 317 transition count 633
Iterating global reduction 4 with 5 rules applied. Total rules applied 376 place count 317 transition count 633
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 380 place count 317 transition count 629
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 381 place count 316 transition count 629
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 381 place count 316 transition count 628
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 383 place count 315 transition count 628
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 455 place count 279 transition count 592
Applied a total of 455 rules in 64 ms. Remains 279 /518 variables (removed 239) and now considering 592/808 (removed 216) transitions.
// Phase 1: matrix 592 rows 279 cols
[2023-03-10 22:07:54] [INFO ] Computed 42 place invariants in 11 ms
[2023-03-10 22:07:54] [INFO ] Implicit Places using invariants in 418 ms returned [18, 93, 99, 104, 121, 191, 200, 205, 224, 276]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 432 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 269/518 places, 592/808 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 269 transition count 590
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 267 transition count 590
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 267 transition count 585
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 262 transition count 585
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 259 transition count 582
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 259 transition count 582
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 23 place count 256 transition count 579
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 256 transition count 579
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 255 transition count 578
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 255 transition count 578
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 36 place count 251 transition count 574
Applied a total of 36 rules in 31 ms. Remains 251 /269 variables (removed 18) and now considering 574/592 (removed 18) transitions.
// Phase 1: matrix 574 rows 251 cols
[2023-03-10 22:07:54] [INFO ] Computed 32 place invariants in 5 ms
[2023-03-10 22:07:55] [INFO ] Implicit Places using invariants in 208 ms returned [93, 96, 184, 187]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 221 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 247/518 places, 574/808 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 247 transition count 572
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 245 transition count 572
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 243 transition count 570
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 243 transition count 570
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 243 transition count 568
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 3 with 2 rules applied. Total rules applied 12 place count 242 transition count 567
Applied a total of 12 rules in 15 ms. Remains 242 /247 variables (removed 5) and now considering 567/574 (removed 7) transitions.
// Phase 1: matrix 567 rows 242 cols
[2023-03-10 22:07:55] [INFO ] Computed 28 place invariants in 6 ms
[2023-03-10 22:07:55] [INFO ] Implicit Places using invariants in 165 ms returned [72, 152]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 166 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 240/518 places, 567/808 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 238 transition count 565
Applied a total of 4 rules in 9 ms. Remains 238 /240 variables (removed 2) and now considering 565/567 (removed 2) transitions.
// Phase 1: matrix 565 rows 238 cols
[2023-03-10 22:07:55] [INFO ] Computed 26 place invariants in 5 ms
[2023-03-10 22:07:55] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-10 22:07:55] [INFO ] Invariant cache hit.
[2023-03-10 22:07:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 22:07:55] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 238/518 places, 565/808 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 1588 ms. Remains : 238/518 places, 565/808 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : ASLink-PT-02a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s94 0) (EQ s171 1)), p0:(OR (EQ s130 0) (EQ s143 1) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2119 reset in 252 ms.
Product exploration explored 100000 steps with 2094 reset in 163 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 546 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 213 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Finished probabilistic random walk after 53979 steps, run visited all 3 properties in 431 ms. (steps per millisecond=125 )
Probabilistic random walk after 53979 steps, saw 24249 distinct states, run finished after 431 ms. (steps per millisecond=125 ) properties seen :3
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 8 factoid took 152 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-02a-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-02a-LTLCardinality-11 finished in 3890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 518 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 518/518 places, 808/808 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 517 transition count 714
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 97 rules applied. Total rules applied 190 place count 422 transition count 712
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 192 place count 420 transition count 712
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 192 place count 420 transition count 645
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 155 rules applied. Total rules applied 347 place count 332 transition count 645
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 22 rules applied. Total rules applied 369 place count 323 transition count 632
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 382 place count 310 transition count 632
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 382 place count 310 transition count 623
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 400 place count 301 transition count 623
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 407 place count 294 transition count 616
Iterating global reduction 5 with 7 rules applied. Total rules applied 414 place count 294 transition count 616
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 5 with 6 rules applied. Total rules applied 420 place count 294 transition count 610
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 421 place count 293 transition count 610
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 421 place count 293 transition count 609
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 423 place count 292 transition count 609
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 489 place count 259 transition count 576
Applied a total of 489 rules in 60 ms. Remains 259 /518 variables (removed 259) and now considering 576/808 (removed 232) transitions.
// Phase 1: matrix 576 rows 259 cols
[2023-03-10 22:07:58] [INFO ] Computed 36 place invariants in 9 ms
[2023-03-10 22:07:58] [INFO ] Implicit Places using invariants in 254 ms returned [17, 75, 93, 99, 104, 163, 180, 186, 191, 193, 256]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 255 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 248/518 places, 576/808 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 248 transition count 574
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 246 transition count 574
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 246 transition count 573
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 6 place count 245 transition count 573
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 9 place count 242 transition count 570
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 242 transition count 570
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 239 transition count 567
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 239 transition count 567
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 238 transition count 566
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 238 transition count 566
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 234 transition count 562
Applied a total of 28 rules in 23 ms. Remains 234 /248 variables (removed 14) and now considering 562/576 (removed 14) transitions.
// Phase 1: matrix 562 rows 234 cols
[2023-03-10 22:07:58] [INFO ] Computed 25 place invariants in 9 ms
[2023-03-10 22:07:58] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-10 22:07:58] [INFO ] Invariant cache hit.
[2023-03-10 22:07:59] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 234/518 places, 562/808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1034 ms. Remains : 234/518 places, 562/808 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s81 0) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2200 reset in 174 ms.
Product exploration explored 100000 steps with 2200 reset in 203 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 207 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 43 ms :[(NOT p0)]
Finished random walk after 549 steps, including 12 resets, run visited all 1 properties in 2 ms. (steps per millisecond=274 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 178 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 p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 562/562 transitions.
Applied a total of 0 rules in 7 ms. Remains 234 /234 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-10 22:08:00] [INFO ] Invariant cache hit.
[2023-03-10 22:08:00] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-10 22:08:00] [INFO ] Invariant cache hit.
[2023-03-10 22:08:00] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2023-03-10 22:08:00] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-10 22:08:00] [INFO ] Invariant cache hit.
[2023-03-10 22:08:01] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 989 ms. Remains : 234/234 places, 562/562 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 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 28 ms :[(NOT p0)]
Finished random walk after 1004 steps, including 18 resets, run visited all 1 properties in 5 ms. (steps per millisecond=200 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 192 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2155 reset in 230 ms.
Product exploration explored 100000 steps with 2152 reset in 178 ms.
Built C files in :
/tmp/ltsmin10084868662494815059
[2023-03-10 22:08:02] [INFO ] Computing symmetric may disable matrix : 562 transitions.
[2023-03-10 22:08:02] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:08:02] [INFO ] Computing symmetric may enable matrix : 562 transitions.
[2023-03-10 22:08:02] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:08:02] [INFO ] Computing Do-Not-Accords matrix : 562 transitions.
[2023-03-10 22:08:02] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:08:02] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10084868662494815059
Running compilation step : cd /tmp/ltsmin10084868662494815059;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1314 ms.
Running link step : cd /tmp/ltsmin10084868662494815059;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin10084868662494815059;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1707797714978030566.hoa' '--buchi-type=spotba'
LTSmin run took 2410 ms.
FORMULA ASLink-PT-02a-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-02a-LTLCardinality-12 finished in 7878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((X(G((!X(!p1)||p0))) U p2)))))'
Support contains 4 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 808/808 transitions.
Applied a total of 0 rules in 6 ms. Remains 518 /518 variables (removed 0) and now considering 808/808 (removed 0) transitions.
// Phase 1: matrix 808 rows 518 cols
[2023-03-10 22:08:06] [INFO ] Computed 68 place invariants in 5 ms
[2023-03-10 22:08:06] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-10 22:08:06] [INFO ] Invariant cache hit.
[2023-03-10 22:08:07] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
[2023-03-10 22:08:07] [INFO ] Invariant cache hit.
[2023-03-10 22:08:07] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1689 ms. Remains : 518/518 places, 808/808 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : ASLink-PT-02a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p2, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s18 0) (EQ s146 1)), p0:(OR (EQ s18 0) (EQ s146 1)), p1:(OR (EQ s293 0) (EQ s430 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7901 steps with 1260 reset in 51 ms.
FORMULA ASLink-PT-02a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLCardinality-14 finished in 2057 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
[2023-03-10 22:08:08] [INFO ] Flatten gal took : 51 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4238712885009481675
[2023-03-10 22:08:08] [INFO ] Computing symmetric may disable matrix : 808 transitions.
[2023-03-10 22:08:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:08:08] [INFO ] Computing symmetric may enable matrix : 808 transitions.
[2023-03-10 22:08:08] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:08:08] [INFO ] Applying decomposition
[2023-03-10 22:08:08] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1143054728764506320.txt' '-o' '/tmp/graph1143054728764506320.bin' '-w' '/tmp/graph1143054728764506320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1143054728764506320.bin' '-l' '-1' '-v' '-w' '/tmp/graph1143054728764506320.weights' '-q' '0' '-e' '0.001'
[2023-03-10 22:08:08] [INFO ] Decomposing Gal with order
[2023-03-10 22:08:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 22:08:08] [INFO ] Computing Do-Not-Accords matrix : 808 transitions.
[2023-03-10 22:08:08] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 22:08:08] [INFO ] Built C files in 180ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4238712885009481675
Running compilation step : cd /tmp/ltsmin4238712885009481675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-10 22:08:08] [INFO ] Removed a total of 1145 redundant transitions.
[2023-03-10 22:08:08] [INFO ] Flatten gal took : 61 ms
[2023-03-10 22:08:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 11 ms.
[2023-03-10 22:08:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality7470655409639910966.gal : 20 ms
[2023-03-10 22:08:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality13072051995240054667.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7470655409639910966.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13072051995240054667.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((i9.u121.p412==0)||(i5.i0.u98.p334==1))")))||(G("((i9.u118.p408==0)&&(i5.i0.u100.p339==1))")))))
Formula 0 simplified : G(FG!"((i9.u121.p412==0)||(i5.i0.u98.p334==1))" & F!"((i9.u118.p408==0)&&(i5.i0.u100.p339==1))")
Compilation finished in 2028 ms.
Running link step : cd /tmp/ltsmin4238712885009481675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 86 ms.
Running LTSmin : cd /tmp/ltsmin4238712885009481675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t7, t8, t9, t16, t463, t464, t652, t705, t728, t778, i2.t4, i3.i1.u38.t99, i3...502
Computing Next relation with stutter on 2.10753e+06 deadlock states
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
10101 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,101.078,1143992,1,0,1.68174e+06,93305,10784,5.37261e+06,1395,1.05583e+06,4001291
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ASLink-PT-02a-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 412112 ms.

BK_STOP 1678486336325

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="ASLink-PT-02a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ASLink-PT-02a, 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 r005-oct2-167813592600027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;