fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r295-tall-167873948000531
Last Updated
May 14, 2023

About the Execution of LoLa+red for PolyORBLF-PT-S02J06T10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
693.487 278105.00 309306.00 1136.90 ?FTTTTTFFFFFFFTF normal

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.r295-tall-167873948000531.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is PolyORBLF-PT-S02J06T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948000531
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 16K Feb 26 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 26 13:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 204K Feb 26 13:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 26 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 59K Feb 26 13:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 299K Feb 26 13:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:23 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 PolyORBLF-PT-S02J06T10-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678858598067

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 05:36:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 05:36:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 05:36:39] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-15 05:36:39] [INFO ] Transformed 844 places.
[2023-03-15 05:36:39] [INFO ] Transformed 1812 transitions.
[2023-03-15 05:36:39] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 204 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Applied a total of 22 rules in 106 ms. Remains 832 /844 variables (removed 12) and now considering 1642/1652 (removed 10) transitions.
[2023-03-15 05:36:40] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
// Phase 1: matrix 1622 rows 832 cols
[2023-03-15 05:36:40] [INFO ] Computed 56 place invariants in 108 ms
[2023-03-15 05:36:42] [INFO ] Dead Transitions using invariants and state equation in 2702 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
[2023-03-15 05:36:42] [INFO ] Flow matrix only has 1512 transitions (discarded 20 similar events)
// Phase 1: matrix 1512 rows 832 cols
[2023-03-15 05:36:42] [INFO ] Computed 56 place invariants in 43 ms
[2023-03-15 05:36:43] [INFO ] Implicit Places using invariants in 656 ms returned [105, 204, 254, 453, 529, 572, 575, 632, 786, 829]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 660 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 822/844 places, 1532/1652 transitions.
Reduce places removed 0 places and 20 transitions.
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 0 places and 20 transitions.
Applied a total of 0 rules in 23 ms. Remains 822 /822 variables (removed 0) and now considering 1492/1532 (removed 40) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3516 ms. Remains : 822/844 places, 1492/1652 transitions.
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Support contains 162 out of 800 places after structural reductions.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 05:36:43] [INFO ] Flatten gal took : 147 ms
[2023-03-15 05:36:44] [INFO ] Flatten gal took : 90 ms
[2023-03-15 05:36:44] [INFO ] Input system was already deterministic with 1492 transitions.
Support contains 123 out of 800 places (down from 162) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 543 ms. (steps per millisecond=18 ) properties (out of 26) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-15 05:36:45] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
// Phase 1: matrix 1472 rows 800 cols
[2023-03-15 05:36:45] [INFO ] Computed 46 place invariants in 29 ms
[2023-03-15 05:36:45] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-15 05:36:45] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 27 ms returned sat
[2023-03-15 05:36:45] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 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((G(F(p0)) U (p1 U p2))))'
Support contains 37 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Applied a total of 0 rules in 24 ms. Remains 800 /800 variables (removed 0) and now considering 1492/1492 (removed 0) transitions.
[2023-03-15 05:36:46] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-15 05:36:46] [INFO ] Invariant cache hit.
[2023-03-15 05:36:47] [INFO ] Dead Transitions using invariants and state equation in 1800 ms found 0 transitions.
[2023-03-15 05:36:47] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-15 05:36:47] [INFO ] Invariant cache hit.
[2023-03-15 05:36:48] [INFO ] Implicit Places using invariants in 730 ms returned []
[2023-03-15 05:36:48] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-15 05:36:48] [INFO ] Invariant cache hit.
[2023-03-15 05:36:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:36:54] [INFO ] Implicit Places using invariants and state equation in 5685 ms returned []
Implicit Place search using SMT with State Equation took 6419 ms to find 0 implicit places.
[2023-03-15 05:36:54] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-15 05:36:54] [INFO ] Invariant cache hit.
[2023-03-15 05:36:56] [INFO ] Dead Transitions using invariants and state equation in 1766 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10018 ms. Remains : 800/800 places, 1492/1492 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GT (ADD s111 s291 s392 s432 s455 s556 s557 s601 s668 s752) (ADD s16 s160 s245 s316 s317 s439 s444 s498 s654 s759)), p1:(LEQ 1 (ADD s13 s158 s364 s453 ...], nbAcceptance=1, 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]]
Product exploration explored 100000 steps with 4809 reset in 558 ms.
Product exploration explored 100000 steps with 4806 reset in 473 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 p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p2)), (X (X (NOT p0))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 474 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p2)), (X (X (NOT p0))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 414 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
[2023-03-15 05:36:58] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-15 05:36:58] [INFO ] Invariant cache hit.
[2023-03-15 05:36:59] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 05:36:59] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 160 ms returned sat
[2023-03-15 05:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:37:01] [INFO ] [Real]Absence check using state equation in 1884 ms returned sat
[2023-03-15 05:37:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:37:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 05:37:02] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 86 ms returned sat
[2023-03-15 05:37:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:37:05] [INFO ] [Nat]Absence check using state equation in 2469 ms returned sat
[2023-03-15 05:37:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:37:06] [INFO ] [Nat]Added 120 Read/Feed constraints in 953 ms returned sat
[2023-03-15 05:37:06] [INFO ] Deduced a trap composed of 71 places in 192 ms of which 4 ms to minimize.
[2023-03-15 05:37:06] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 1 ms to minimize.
[2023-03-15 05:37:06] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 2 ms to minimize.
[2023-03-15 05:37:07] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 1 ms to minimize.
[2023-03-15 05:37:07] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 0 ms to minimize.
[2023-03-15 05:37:07] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 0 ms to minimize.
[2023-03-15 05:37:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1359 ms
[2023-03-15 05:37:07] [INFO ] Computed and/alt/rep : 780/1518/770 causal constraints (skipped 700 transitions) in 127 ms.
[2023-03-15 05:37:15] [INFO ] Added : 389 causal constraints over 79 iterations in 8450 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-15 05:37:15] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-15 05:37:15] [INFO ] Invariant cache hit.
[2023-03-15 05:37:16] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2023-03-15 05:37:16] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 72 ms returned sat
[2023-03-15 05:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:37:19] [INFO ] [Real]Absence check using state equation in 2565 ms returned sat
[2023-03-15 05:37:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:37:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 05:37:20] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 82 ms returned sat
[2023-03-15 05:37:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:37:24] [INFO ] [Nat]Absence check using state equation in 4456 ms returned sat
[2023-03-15 05:37:24] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:37:25] [INFO ] [Nat]Added 120 Read/Feed constraints in 502 ms returned sat
[2023-03-15 05:37:25] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 0 ms to minimize.
[2023-03-15 05:37:25] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2023-03-15 05:37:26] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 0 ms to minimize.
[2023-03-15 05:37:26] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2023-03-15 05:37:26] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 0 ms to minimize.
[2023-03-15 05:37:27] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 0 ms to minimize.
[2023-03-15 05:37:27] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 0 ms to minimize.
[2023-03-15 05:37:27] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 0 ms to minimize.
[2023-03-15 05:37:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2422 ms
[2023-03-15 05:37:27] [INFO ] Computed and/alt/rep : 780/1518/770 causal constraints (skipped 700 transitions) in 87 ms.
[2023-03-15 05:37:34] [INFO ] Deduced a trap composed of 2 places in 402 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 05:37:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 37 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Applied a total of 0 rules in 21 ms. Remains 800 /800 variables (removed 0) and now considering 1492/1492 (removed 0) transitions.
[2023-03-15 05:37:34] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-15 05:37:34] [INFO ] Invariant cache hit.
[2023-03-15 05:37:36] [INFO ] Dead Transitions using invariants and state equation in 1829 ms found 0 transitions.
[2023-03-15 05:37:36] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-15 05:37:36] [INFO ] Invariant cache hit.
[2023-03-15 05:37:37] [INFO ] Implicit Places using invariants in 752 ms returned []
[2023-03-15 05:37:37] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-15 05:37:37] [INFO ] Invariant cache hit.
[2023-03-15 05:37:38] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:37:45] [INFO ] Implicit Places using invariants and state equation in 8197 ms returned []
Implicit Place search using SMT with State Equation took 8964 ms to find 0 implicit places.
[2023-03-15 05:37:45] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-15 05:37:45] [INFO ] Invariant cache hit.
[2023-03-15 05:37:47] [INFO ] Dead Transitions using invariants and state equation in 1747 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12572 ms. Remains : 800/800 places, 1492/1492 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 (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), true, (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 338 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), true, (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 453 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
[2023-03-15 05:37:48] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-15 05:37:48] [INFO ] Invariant cache hit.
[2023-03-15 05:37:49] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-15 05:37:49] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 162 ms returned sat
[2023-03-15 05:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:37:51] [INFO ] [Real]Absence check using state equation in 1906 ms returned sat
[2023-03-15 05:37:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:37:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 05:37:52] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 77 ms returned sat
[2023-03-15 05:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:37:54] [INFO ] [Nat]Absence check using state equation in 2379 ms returned sat
[2023-03-15 05:37:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:37:55] [INFO ] [Nat]Added 120 Read/Feed constraints in 933 ms returned sat
[2023-03-15 05:37:56] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 1 ms to minimize.
[2023-03-15 05:37:56] [INFO ] Deduced a trap composed of 71 places in 135 ms of which 0 ms to minimize.
[2023-03-15 05:37:56] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 0 ms to minimize.
[2023-03-15 05:37:56] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 0 ms to minimize.
[2023-03-15 05:37:56] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 0 ms to minimize.
[2023-03-15 05:37:57] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 0 ms to minimize.
[2023-03-15 05:37:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1224 ms
[2023-03-15 05:37:57] [INFO ] Computed and/alt/rep : 780/1518/770 causal constraints (skipped 700 transitions) in 71 ms.
[2023-03-15 05:38:05] [INFO ] Added : 389 causal constraints over 79 iterations in 8694 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-15 05:38:05] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-15 05:38:05] [INFO ] Invariant cache hit.
[2023-03-15 05:38:06] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-03-15 05:38:06] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 68 ms returned sat
[2023-03-15 05:38:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 05:38:09] [INFO ] [Real]Absence check using state equation in 2501 ms returned sat
[2023-03-15 05:38:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 05:38:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 05:38:10] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 79 ms returned sat
[2023-03-15 05:38:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 05:38:14] [INFO ] [Nat]Absence check using state equation in 4541 ms returned sat
[2023-03-15 05:38:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:38:15] [INFO ] [Nat]Added 120 Read/Feed constraints in 482 ms returned sat
[2023-03-15 05:38:15] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 1 ms to minimize.
[2023-03-15 05:38:15] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2023-03-15 05:38:16] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 0 ms to minimize.
[2023-03-15 05:38:16] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 0 ms to minimize.
[2023-03-15 05:38:16] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2023-03-15 05:38:17] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 0 ms to minimize.
[2023-03-15 05:38:17] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2023-03-15 05:38:17] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2023-03-15 05:38:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2326 ms
[2023-03-15 05:38:17] [INFO ] Computed and/alt/rep : 780/1518/770 causal constraints (skipped 700 transitions) in 80 ms.
[2023-03-15 05:38:24] [INFO ] Added : 330 causal constraints over 66 iterations in 6707 ms. Result :unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4827 reset in 385 ms.
Product exploration explored 100000 steps with 4809 reset in 402 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Support contains 37 out of 800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 800 transition count 1492
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 38 place count 800 transition count 1602
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 138 place count 800 transition count 1602
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 146 place count 792 transition count 1594
Deduced a syphon composed of 130 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 154 place count 792 transition count 1594
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 212 places in 1 ms
Iterating global reduction 1 with 82 rules applied. Total rules applied 236 place count 792 transition count 1594
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 267 place count 761 transition count 1563
Deduced a syphon composed of 190 places in 1 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 298 place count 761 transition count 1563
Deduced a syphon composed of 190 places in 1 ms
Applied a total of 298 rules in 200 ms. Remains 761 /800 variables (removed 39) and now considering 1563/1492 (removed -71) transitions.
[2023-03-15 05:38:25] [INFO ] Flow matrix only has 1543 transitions (discarded 20 similar events)
// Phase 1: matrix 1543 rows 761 cols
[2023-03-15 05:38:25] [INFO ] Computed 46 place invariants in 31 ms
[2023-03-15 05:38:27] [INFO ] Dead Transitions using invariants and state equation in 1422 ms found 0 transitions.
[2023-03-15 05:38:27] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-15 05:38:27] [INFO ] Flow matrix only has 1543 transitions (discarded 20 similar events)
[2023-03-15 05:38:27] [INFO ] Invariant cache hit.
[2023-03-15 05:38:28] [INFO ] Dead Transitions using invariants and state equation in 1463 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 761/800 places, 1563/1492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3212 ms. Remains : 761/800 places, 1563/1492 transitions.
Support contains 37 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Applied a total of 0 rules in 11 ms. Remains 800 /800 variables (removed 0) and now considering 1492/1492 (removed 0) transitions.
[2023-03-15 05:38:28] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
// Phase 1: matrix 1472 rows 800 cols
[2023-03-15 05:38:28] [INFO ] Computed 46 place invariants in 47 ms
[2023-03-15 05:38:30] [INFO ] Dead Transitions using invariants and state equation in 1835 ms found 0 transitions.
[2023-03-15 05:38:30] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-15 05:38:30] [INFO ] Invariant cache hit.
[2023-03-15 05:38:31] [INFO ] Implicit Places using invariants in 753 ms returned []
[2023-03-15 05:38:31] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-15 05:38:31] [INFO ] Invariant cache hit.
[2023-03-15 05:38:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:38:39] [INFO ] Implicit Places using invariants and state equation in 8277 ms returned []
Implicit Place search using SMT with State Equation took 9037 ms to find 0 implicit places.
[2023-03-15 05:38:39] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-15 05:38:39] [INFO ] Invariant cache hit.
[2023-03-15 05:38:41] [INFO ] Dead Transitions using invariants and state equation in 1823 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12710 ms. Remains : 800/800 places, 1492/1492 transitions.
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-00 finished in 115730 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((p0&&X(X(G(p0))))))'
Support contains 15 out of 800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 800 transition count 1442
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 750 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 740 transition count 1432
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 120 place count 740 transition count 1322
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 340 place count 630 transition count 1322
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 460 place count 570 transition count 1262
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 469 place count 561 transition count 1253
Iterating global reduction 3 with 9 rules applied. Total rules applied 478 place count 561 transition count 1253
Applied a total of 478 rules in 108 ms. Remains 561 /800 variables (removed 239) and now considering 1253/1492 (removed 239) transitions.
[2023-03-15 05:38:41] [INFO ] Flow matrix only has 1233 transitions (discarded 20 similar events)
// Phase 1: matrix 1233 rows 561 cols
[2023-03-15 05:38:41] [INFO ] Computed 46 place invariants in 25 ms
[2023-03-15 05:38:42] [INFO ] Dead Transitions using invariants and state equation in 951 ms found 0 transitions.
[2023-03-15 05:38:42] [INFO ] Flow matrix only has 1233 transitions (discarded 20 similar events)
[2023-03-15 05:38:42] [INFO ] Invariant cache hit.
[2023-03-15 05:38:43] [INFO ] Implicit Places using invariants in 538 ms returned []
[2023-03-15 05:38:43] [INFO ] Flow matrix only has 1233 transitions (discarded 20 similar events)
[2023-03-15 05:38:43] [INFO ] Invariant cache hit.
[2023-03-15 05:38:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:38:51] [INFO ] Implicit Places using invariants and state equation in 7794 ms returned []
Implicit Place search using SMT with State Equation took 8334 ms to find 0 implicit places.
[2023-03-15 05:38:51] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-15 05:38:51] [INFO ] Flow matrix only has 1233 transitions (discarded 20 similar events)
[2023-03-15 05:38:51] [INFO ] Invariant cache hit.
[2023-03-15 05:38:52] [INFO ] Dead Transitions using invariants and state equation in 1004 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/800 places, 1253/1492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10480 ms. Remains : 561/800 places, 1253/1492 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s32 (ADD s8 s23 s29 s59 s118 s142 s235 s256 s332 s389 s437 s461 s489 s521))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 7081 steps with 0 reset in 43 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-01 finished in 10711 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(X(F(p0))))'
Support contains 17 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 790 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 790 transition count 1482
Applied a total of 20 rules in 28 ms. Remains 790 /800 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-15 05:38:52] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
// Phase 1: matrix 1462 rows 790 cols
[2023-03-15 05:38:52] [INFO ] Computed 46 place invariants in 30 ms
[2023-03-15 05:38:54] [INFO ] Dead Transitions using invariants and state equation in 1741 ms found 0 transitions.
[2023-03-15 05:38:54] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:38:54] [INFO ] Invariant cache hit.
[2023-03-15 05:38:54] [INFO ] Implicit Places using invariants in 737 ms returned []
[2023-03-15 05:38:54] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:38:54] [INFO ] Invariant cache hit.
[2023-03-15 05:38:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:39:08] [INFO ] Implicit Places using invariants and state equation in 13881 ms returned []
Implicit Place search using SMT with State Equation took 14621 ms to find 0 implicit places.
[2023-03-15 05:39:08] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:39:08] [INFO ] Invariant cache hit.
[2023-03-15 05:39:10] [INFO ] Dead Transitions using invariants and state equation in 1843 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/800 places, 1482/1492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18238 ms. Remains : 790/800 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-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:(LEQ (ADD s5 s76 s142 s198 s249 s265 s564 s647 s712 s733) (ADD s84 s157 s232 s305 s573 s721 s744))], 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 453 ms.
Product exploration explored 100000 steps with 33333 reset in 478 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-05 finished in 19391 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)))'
Support contains 11 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 790 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 790 transition count 1482
Applied a total of 20 rules in 29 ms. Remains 790 /800 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-15 05:39:11] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:39:11] [INFO ] Invariant cache hit.
[2023-03-15 05:39:13] [INFO ] Dead Transitions using invariants and state equation in 1757 ms found 0 transitions.
[2023-03-15 05:39:13] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:39:13] [INFO ] Invariant cache hit.
[2023-03-15 05:39:14] [INFO ] Implicit Places using invariants in 719 ms returned []
[2023-03-15 05:39:14] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:39:14] [INFO ] Invariant cache hit.
[2023-03-15 05:39:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:39:25] [INFO ] Implicit Places using invariants and state equation in 11304 ms returned []
Implicit Place search using SMT with State Equation took 12028 ms to find 0 implicit places.
[2023-03-15 05:39:25] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:39:25] [INFO ] Invariant cache hit.
[2023-03-15 05:39:27] [INFO ] Dead Transitions using invariants and state equation in 1827 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/800 places, 1482/1492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15644 ms. Remains : 790/800 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s527 (ADD s95 s96 s194 s322 s339 s373 s395 s590 s592 s734))], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 564 ms.
Product exploration explored 100000 steps with 50000 reset in 576 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 : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-06 finished in 16931 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)))'
Support contains 10 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 790 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 790 transition count 1482
Applied a total of 20 rules in 29 ms. Remains 790 /800 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-15 05:39:28] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:39:28] [INFO ] Invariant cache hit.
[2023-03-15 05:39:30] [INFO ] Dead Transitions using invariants and state equation in 1829 ms found 0 transitions.
[2023-03-15 05:39:30] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:39:30] [INFO ] Invariant cache hit.
[2023-03-15 05:39:31] [INFO ] Implicit Places using invariants in 761 ms returned []
[2023-03-15 05:39:31] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:39:31] [INFO ] Invariant cache hit.
[2023-03-15 05:39:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:39:41] [INFO ] Implicit Places using invariants and state equation in 10324 ms returned []
Implicit Place search using SMT with State Equation took 11090 ms to find 0 implicit places.
[2023-03-15 05:39:41] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:39:41] [INFO ] Invariant cache hit.
[2023-03-15 05:39:43] [INFO ] Dead Transitions using invariants and state equation in 1872 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/800 places, 1482/1492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14823 ms. Remains : 790/800 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s60 s91 s127 s238 s444 s563 s610 s648 s749 s784))], 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][false, false]]
Stuttering criterion allowed to conclude after 2717 steps with 16 reset in 13 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-07 finished in 14937 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) U G(p1))))'
Support contains 3 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 790 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 790 transition count 1482
Applied a total of 20 rules in 31 ms. Remains 790 /800 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-15 05:39:43] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:39:43] [INFO ] Invariant cache hit.
[2023-03-15 05:39:45] [INFO ] Dead Transitions using invariants and state equation in 1835 ms found 0 transitions.
[2023-03-15 05:39:45] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:39:45] [INFO ] Invariant cache hit.
[2023-03-15 05:39:46] [INFO ] Implicit Places using invariants in 758 ms returned []
[2023-03-15 05:39:46] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:39:46] [INFO ] Invariant cache hit.
[2023-03-15 05:39:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:39:56] [INFO ] Implicit Places using invariants and state equation in 9895 ms returned []
Implicit Place search using SMT with State Equation took 10658 ms to find 0 implicit places.
[2023-03-15 05:39:56] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:39:56] [INFO ] Invariant cache hit.
[2023-03-15 05:39:58] [INFO ] Dead Transitions using invariants and state equation in 1822 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/800 places, 1482/1492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14350 ms. Remains : 790/800 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s613), p0:(LEQ s635 s606)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 8718 steps with 0 reset in 39 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-09 finished in 14532 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(X(X(F((p0&&X(X(X(G(p1))))))))))'
Support contains 2 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 790 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 790 transition count 1482
Applied a total of 20 rules in 35 ms. Remains 790 /800 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-15 05:39:58] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:39:58] [INFO ] Invariant cache hit.
[2023-03-15 05:40:00] [INFO ] Dead Transitions using invariants and state equation in 1838 ms found 0 transitions.
[2023-03-15 05:40:00] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:40:00] [INFO ] Invariant cache hit.
[2023-03-15 05:40:00] [INFO ] Implicit Places using invariants in 751 ms returned []
[2023-03-15 05:40:00] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:40:00] [INFO ] Invariant cache hit.
[2023-03-15 05:40:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:40:14] [INFO ] Implicit Places using invariants and state equation in 13147 ms returned []
Implicit Place search using SMT with State Equation took 13900 ms to find 0 implicit places.
[2023-03-15 05:40:14] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:40:14] [INFO ] Invariant cache hit.
[2023-03-15 05:40:15] [INFO ] Dead Transitions using invariants and state equation in 1810 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/800 places, 1482/1492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17586 ms. Remains : 790/800 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 439 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 5}, { cond=p0, acceptance={0} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 7}, { cond=p0, acceptance={0} source=5 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 9}, { cond=p0, acceptance={0} source=6 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 7}, { cond=(AND p0 p1), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 9}, { cond=(AND p0 p1), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 7}, { cond=(AND p0 p1), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=10 dest: 9}, { cond=(AND p0 p1), acceptance={} source=10 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p0:(LEQ 1 s737), p1:(LEQ 1 s686)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6978 steps with 0 reset in 39 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-10 finished in 18094 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((X(p0) U p1)))'
Support contains 3 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 790 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 790 transition count 1482
Applied a total of 20 rules in 28 ms. Remains 790 /800 variables (removed 10) and now considering 1482/1492 (removed 10) transitions.
[2023-03-15 05:40:16] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:40:16] [INFO ] Invariant cache hit.
[2023-03-15 05:40:18] [INFO ] Dead Transitions using invariants and state equation in 1780 ms found 0 transitions.
[2023-03-15 05:40:18] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:40:18] [INFO ] Invariant cache hit.
[2023-03-15 05:40:18] [INFO ] Implicit Places using invariants in 724 ms returned []
[2023-03-15 05:40:18] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:40:18] [INFO ] Invariant cache hit.
[2023-03-15 05:40:19] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:40:29] [INFO ] Implicit Places using invariants and state equation in 10926 ms returned []
Implicit Place search using SMT with State Equation took 11652 ms to find 0 implicit places.
[2023-03-15 05:40:29] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-15 05:40:29] [INFO ] Invariant cache hit.
[2023-03-15 05:40:31] [INFO ] Dead Transitions using invariants and state equation in 1884 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/800 places, 1482/1492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15358 ms. Remains : 790/800 places, 1482/1492 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(LEQ 1 s719), p0:(LEQ s43 s658)], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-12 finished in 15536 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 800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 800/800 places, 1492/1492 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 800 transition count 1422
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 730 transition count 1422
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 140 place count 730 transition count 1322
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 340 place count 630 transition count 1322
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 518 place count 541 transition count 1233
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 527 place count 532 transition count 1224
Iterating global reduction 2 with 9 rules applied. Total rules applied 536 place count 532 transition count 1224
Applied a total of 536 rules in 81 ms. Remains 532 /800 variables (removed 268) and now considering 1224/1492 (removed 268) transitions.
[2023-03-15 05:40:31] [INFO ] Flow matrix only has 1204 transitions (discarded 20 similar events)
// Phase 1: matrix 1204 rows 532 cols
[2023-03-15 05:40:31] [INFO ] Computed 46 place invariants in 15 ms
[2023-03-15 05:40:32] [INFO ] Dead Transitions using invariants and state equation in 937 ms found 0 transitions.
[2023-03-15 05:40:32] [INFO ] Flow matrix only has 1204 transitions (discarded 20 similar events)
[2023-03-15 05:40:32] [INFO ] Invariant cache hit.
[2023-03-15 05:40:33] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-15 05:40:33] [INFO ] Flow matrix only has 1204 transitions (discarded 20 similar events)
[2023-03-15 05:40:33] [INFO ] Invariant cache hit.
[2023-03-15 05:40:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:40:43] [INFO ] Implicit Places using invariants and state equation in 10068 ms returned []
Implicit Place search using SMT with State Equation took 10621 ms to find 0 implicit places.
[2023-03-15 05:40:43] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-15 05:40:43] [INFO ] Flow matrix only has 1204 transitions (discarded 20 similar events)
[2023-03-15 05:40:43] [INFO ] Invariant cache hit.
[2023-03-15 05:40:44] [INFO ] Dead Transitions using invariants and state equation in 970 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 532/800 places, 1224/1492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12653 ms. Remains : 532/800 places, 1224/1492 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s427 s313)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 64801 steps with 24 reset in 304 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLCardinality-13 finished in 13008 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((G(F(p0)) U (p1 U p2))))'
[2023-03-15 05:40:45] [INFO ] Flatten gal took : 67 ms
[2023-03-15 05:40:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-15 05:40:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 800 places, 1492 transitions and 6350 arcs took 11 ms.
Total runtime 245605 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBLF-PT-S02J06T10
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality

BK_STOP 1678858876172

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 PolyORBLF-PT-S02J06T10-LTLCardinality-00
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S02J06T10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 6/32 PolyORBLF-PT-S02J06T10-LTLCardinality-00 464565 m, 92913 m/sec, 921196 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S02J06T10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 12/32 PolyORBLF-PT-S02J06T10-LTLCardinality-00 935689 m, 94224 m/sec, 1880156 t fired, .

Time elapsed: 10 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S02J06T10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 18/32 PolyORBLF-PT-S02J06T10-LTLCardinality-00 1387160 m, 90294 m/sec, 2835361 t fired, .

Time elapsed: 15 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S02J06T10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 23/32 PolyORBLF-PT-S02J06T10-LTLCardinality-00 1819295 m, 86427 m/sec, 3764650 t fired, .

Time elapsed: 20 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S02J06T10-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 29/32 PolyORBLF-PT-S02J06T10-LTLCardinality-00 2249028 m, 85946 m/sec, 4699684 t fired, .

Time elapsed: 25 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for PolyORBLF-PT-S02J06T10-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S02J06T10-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-PT-S02J06T10-LTLCardinality-00: LTL unknown AGGR


Time elapsed: 30 secs. Pages in use: 32

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="PolyORBLF-PT-S02J06T10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is PolyORBLF-PT-S02J06T10, 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 r295-tall-167873948000531"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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