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.r105-tall-167814482001011.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 ltsminxred
Input is DNAwalker-PT-18lozangeBlock, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814482001011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.0K Feb 25 13:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 13:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 13:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 13:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 15 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678410011588

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-18lozangeBlock
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 01:00:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 01:00:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 01:00:13] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2023-03-10 01:00:13] [INFO ] Transformed 164 places.
[2023-03-10 01:00:13] [INFO ] Transformed 3697 transitions.
[2023-03-10 01:00:13] [INFO ] Parsed PT model containing 164 places and 3697 transitions and 10898 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DNAwalker-PT-18lozangeBlock-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 47 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
// Phase 1: matrix 3697 rows 164 cols
[2023-03-10 01:00:13] [INFO ] Computed 0 place invariants in 40 ms
[2023-03-10 01:00:15] [INFO ] Dead Transitions using invariants and state equation in 1280 ms found 0 transitions.
[2023-03-10 01:00:15] [INFO ] Invariant cache hit.
[2023-03-10 01:00:15] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-10 01:00:15] [INFO ] Invariant cache hit.
[2023-03-10 01:00:15] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:00:16] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2023-03-10 01:00:16] [INFO ] Invariant cache hit.
[2023-03-10 01:00:17] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3522 ms. Remains : 164/164 places, 3697/3697 transitions.
Support contains 33 out of 164 places after structural reductions.
[2023-03-10 01:00:17] [INFO ] Flatten gal took : 319 ms
[2023-03-10 01:00:17] [INFO ] Flatten gal took : 125 ms
[2023-03-10 01:00:18] [INFO ] Input system was already deterministic with 3697 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 543 ms. (steps per millisecond=18 ) properties (out of 30) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-10 01:00:18] [INFO ] Invariant cache hit.
[2023-03-10 01:00:21] [INFO ] After 2386ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:3
[2023-03-10 01:00:46] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Graph (complete) has 3632 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 163 transition count 3610
Reduce places removed 63 places and 63 transitions.
Iterating global reduction 1 with 63 rules applied. Total rules applied 150 place count 100 transition count 3547
Applied a total of 150 rules in 182 ms. Remains 100 /164 variables (removed 64) and now considering 3547/3697 (removed 150) transitions.
// Phase 1: matrix 3547 rows 100 cols
[2023-03-10 01:00:46] [INFO ] Computed 0 place invariants in 12 ms
[2023-03-10 01:00:47] [INFO ] Dead Transitions using invariants and state equation in 917 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1101 ms. Remains : 100/164 places, 3547/3697 transitions.
Incomplete random walk after 10000 steps, including 109 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 152433 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152433 steps, saw 42494 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-10 01:00:50] [INFO ] Invariant cache hit.
[2023-03-10 01:00:52] [INFO ] After 1974ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 01:01:17] [INFO ] After 24975ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 01:01:17] [INFO ] State equation strengthened by 56 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
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-10 01:01:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 01:01:17] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 3547/3547 transitions.
Applied a total of 0 rules in 61 ms. Remains 100 /100 variables (removed 0) and now considering 3547/3547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 100/100 places, 3547/3547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 3547/3547 transitions.
Applied a total of 0 rules in 67 ms. Remains 100 /100 variables (removed 0) and now considering 3547/3547 (removed 0) transitions.
[2023-03-10 01:01:17] [INFO ] Invariant cache hit.
[2023-03-10 01:01:18] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-10 01:01:18] [INFO ] Invariant cache hit.
[2023-03-10 01:01:18] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-10 01:01:18] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
[2023-03-10 01:01:19] [INFO ] Redundant transitions in 366 ms returned []
[2023-03-10 01:01:19] [INFO ] Invariant cache hit.
[2023-03-10 01:01:20] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2314 ms. Remains : 100/100 places, 3547/3547 transitions.
Applied a total of 0 rules in 39 ms. Remains 100 /100 variables (removed 0) and now considering 3547/3547 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-10 01:01:20] [INFO ] Invariant cache hit.
[2023-03-10 01:01:22] [INFO ] After 1962ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 01:01:59] [INFO ] After 37383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
FORMULA DNAwalker-PT-18lozangeBlock-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA DNAwalker-PT-18lozangeBlock-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-18lozangeBlock-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 164 stabilizing places and 3696 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' '!(F(p0))'
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 85 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
// Phase 1: matrix 3697 rows 164 cols
[2023-03-10 01:02:00] [INFO ] Computed 0 place invariants in 9 ms
[2023-03-10 01:02:00] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
[2023-03-10 01:02:00] [INFO ] Invariant cache hit.
[2023-03-10 01:02:01] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-10 01:02:01] [INFO ] Invariant cache hit.
[2023-03-10 01:02:01] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:02:01] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
[2023-03-10 01:02:02] [INFO ] Redundant transitions in 242 ms returned []
[2023-03-10 01:02:02] [INFO ] Invariant cache hit.
[2023-03-10 01:02:03] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3029 ms. Remains : 164/164 places, 3697/3697 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0)]
Running random walk in product with property : DNAwalker-PT-18lozangeBlock-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 6 ms.
FORMULA DNAwalker-PT-18lozangeBlock-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-18lozangeBlock-LTLCardinality-00 finished in 3354 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))&&(G(!p0)||F(p1))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 61 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
[2023-03-10 01:02:03] [INFO ] Invariant cache hit.
[2023-03-10 01:02:04] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
[2023-03-10 01:02:04] [INFO ] Invariant cache hit.
[2023-03-10 01:02:04] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-10 01:02:04] [INFO ] Invariant cache hit.
[2023-03-10 01:02:04] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:02:05] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
[2023-03-10 01:02:05] [INFO ] Redundant transitions in 183 ms returned []
[2023-03-10 01:02:05] [INFO ] Invariant cache hit.
[2023-03-10 01:02:06] [INFO ] Dead Transitions using invariants and state equation in 847 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2945 ms. Remains : 164/164 places, 3697/3697 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : DNAwalker-PT-18lozangeBlock-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s107 s76), p1:(OR (LEQ 3 s21) (LEQ 2 s43))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 168 ms.
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 2 ms.
FORMULA DNAwalker-PT-18lozangeBlock-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-18lozangeBlock-LTLCardinality-02 finished in 3307 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))||(G(!p0)&&X(p1))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
[2023-03-10 01:02:06] [INFO ] Invariant cache hit.
[2023-03-10 01:02:07] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
[2023-03-10 01:02:07] [INFO ] Invariant cache hit.
[2023-03-10 01:02:07] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-10 01:02:07] [INFO ] Invariant cache hit.
[2023-03-10 01:02:08] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:02:08] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1017 ms to find 0 implicit places.
[2023-03-10 01:02:08] [INFO ] Invariant cache hit.
[2023-03-10 01:02:09] [INFO ] Dead Transitions using invariants and state equation in 877 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2779 ms. Remains : 164/164 places, 3697/3697 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DNAwalker-PT-18lozangeBlock-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(GT 2 s8), p1:(LEQ 1 s117)], 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 50000 reset in 925 ms.
Product exploration explored 100000 steps with 50000 reset in 876 ms.
Computed a total of 164 stabilizing places and 3696 stable transitions
Computed a total of 164 stabilizing places and 3696 stable transitions
Detected a total of 164/164 stabilizing places and 3696/3697 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 103 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DNAwalker-PT-18lozangeBlock-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DNAwalker-PT-18lozangeBlock-LTLCardinality-04 finished in 4857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0))||F((p1 U (G(p1)||(p1&&(p0 U (p2||G(p0))))))))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 53 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
[2023-03-10 01:02:11] [INFO ] Invariant cache hit.
[2023-03-10 01:02:12] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
[2023-03-10 01:02:12] [INFO ] Invariant cache hit.
[2023-03-10 01:02:12] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-10 01:02:12] [INFO ] Invariant cache hit.
[2023-03-10 01:02:13] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:02:13] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
[2023-03-10 01:02:13] [INFO ] Redundant transitions in 175 ms returned []
[2023-03-10 01:02:13] [INFO ] Invariant cache hit.
[2023-03-10 01:02:14] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2952 ms. Remains : 164/164 places, 3697/3697 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DNAwalker-PT-18lozangeBlock-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 3 s118), p2:(AND (GT 1 s124) (GT 1 s146)), p0:(GT 1 s124)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 94 ms.
Product exploration explored 100000 steps with 1 reset in 103 ms.
Computed a total of 164 stabilizing places and 3696 stable transitions
Computed a total of 164 stabilizing places and 3696 stable transitions
Detected a total of 164/164 stabilizing places and 3696/3697 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
Knowledge based reduction with 6 factoid took 304 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 97 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 01:02:15] [INFO ] Invariant cache hit.
[2023-03-10 01:02:16] [INFO ] After 1310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 01:02:36] [INFO ] After 19369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Graph (complete) has 3632 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 163 transition count 3611
Reduce places removed 63 places and 63 transitions.
Iterating global reduction 1 with 63 rules applied. Total rules applied 149 place count 100 transition count 3548
Applied a total of 149 rules in 98 ms. Remains 100 /164 variables (removed 64) and now considering 3548/3697 (removed 149) transitions.
// Phase 1: matrix 3548 rows 100 cols
[2023-03-10 01:02:36] [INFO ] Computed 0 place invariants in 12 ms
[2023-03-10 01:02:36] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 911 ms. Remains : 100/164 places, 3548/3697 transitions.
Incomplete random walk after 10000 steps, including 112 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 155663 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 155663 steps, saw 44092 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 01:02:40] [INFO ] Invariant cache hit.
[2023-03-10 01:02:40] [INFO ] After 759ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 01:03:05] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 3548/3548 transitions.
Applied a total of 0 rules in 42 ms. Remains 100 /100 variables (removed 0) and now considering 3548/3548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 100/100 places, 3548/3548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 3548/3548 transitions.
Applied a total of 0 rules in 34 ms. Remains 100 /100 variables (removed 0) and now considering 3548/3548 (removed 0) transitions.
[2023-03-10 01:03:06] [INFO ] Invariant cache hit.
[2023-03-10 01:03:06] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-10 01:03:06] [INFO ] Invariant cache hit.
[2023-03-10 01:03:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 01:03:06] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
[2023-03-10 01:03:07] [INFO ] Redundant transitions in 164 ms returned []
[2023-03-10 01:03:07] [INFO ] Invariant cache hit.
[2023-03-10 01:03:07] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1868 ms. Remains : 100/100 places, 3548/3548 transitions.
Applied a total of 0 rules in 35 ms. Remains 100 /100 variables (removed 0) and now considering 3548/3548 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-10 01:03:07] [INFO ] Invariant cache hit.
[2023-03-10 01:03:08] [INFO ] After 767ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 01:03:37] [INFO ] After 28457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (NOT (AND p1 (NOT p0) (NOT p2))))]
Knowledge based reduction with 6 factoid took 314 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 41 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
// Phase 1: matrix 3697 rows 164 cols
[2023-03-10 01:03:37] [INFO ] Computed 0 place invariants in 17 ms
[2023-03-10 01:03:38] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
[2023-03-10 01:03:38] [INFO ] Invariant cache hit.
[2023-03-10 01:03:38] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-10 01:03:38] [INFO ] Invariant cache hit.
[2023-03-10 01:03:39] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:03:39] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
[2023-03-10 01:03:39] [INFO ] Redundant transitions in 171 ms returned []
[2023-03-10 01:03:39] [INFO ] Invariant cache hit.
[2023-03-10 01:03:40] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2851 ms. Remains : 164/164 places, 3697/3697 transitions.
Computed a total of 164 stabilizing places and 3696 stable transitions
Computed a total of 164 stabilizing places and 3696 stable transitions
Detected a total of 164/164 stabilizing places and 3696/3697 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 362 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 96 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 01:03:41] [INFO ] Invariant cache hit.
[2023-03-10 01:03:42] [INFO ] After 1296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 01:04:01] [INFO ] After 19381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Graph (complete) has 3632 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 163 transition count 3611
Reduce places removed 63 places and 63 transitions.
Iterating global reduction 1 with 63 rules applied. Total rules applied 149 place count 100 transition count 3548
Applied a total of 149 rules in 86 ms. Remains 100 /164 variables (removed 64) and now considering 3548/3697 (removed 149) transitions.
// Phase 1: matrix 3548 rows 100 cols
[2023-03-10 01:04:01] [INFO ] Computed 0 place invariants in 15 ms
[2023-03-10 01:04:02] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 911 ms. Remains : 100/164 places, 3548/3697 transitions.
Incomplete random walk after 10000 steps, including 109 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 153525 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153525 steps, saw 43611 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 01:04:06] [INFO ] Invariant cache hit.
[2023-03-10 01:04:06] [INFO ] After 744ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 01:04:31] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 3548/3548 transitions.
Applied a total of 0 rules in 34 ms. Remains 100 /100 variables (removed 0) and now considering 3548/3548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 100/100 places, 3548/3548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 3548/3548 transitions.
Applied a total of 0 rules in 37 ms. Remains 100 /100 variables (removed 0) and now considering 3548/3548 (removed 0) transitions.
[2023-03-10 01:04:31] [INFO ] Invariant cache hit.
[2023-03-10 01:04:32] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-10 01:04:32] [INFO ] Invariant cache hit.
[2023-03-10 01:04:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 01:04:36] [INFO ] Implicit Places using invariants and state equation in 4716 ms returned []
Implicit Place search using SMT with State Equation took 4914 ms to find 0 implicit places.
[2023-03-10 01:04:36] [INFO ] Redundant transitions in 167 ms returned []
[2023-03-10 01:04:36] [INFO ] Invariant cache hit.
[2023-03-10 01:04:37] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5941 ms. Remains : 100/100 places, 3548/3548 transitions.
Applied a total of 0 rules in 34 ms. Remains 100 /100 variables (removed 0) and now considering 3548/3548 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-10 01:04:37] [INFO ] Invariant cache hit.
[2023-03-10 01:04:38] [INFO ] After 757ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 01:05:07] [INFO ] After 28448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (NOT (AND p1 (NOT p2) (NOT p0))))]
Knowledge based reduction with 6 factoid took 306 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 62 ms.
Product exploration explored 100000 steps with 1 reset in 107 ms.
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 42 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
// Phase 1: matrix 3697 rows 164 cols
[2023-03-10 01:05:07] [INFO ] Computed 0 place invariants in 12 ms
[2023-03-10 01:05:08] [INFO ] Dead Transitions using invariants and state equation in 902 ms found 0 transitions.
[2023-03-10 01:05:08] [INFO ] Invariant cache hit.
[2023-03-10 01:05:08] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-10 01:05:08] [INFO ] Invariant cache hit.
[2023-03-10 01:05:09] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:05:09] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
[2023-03-10 01:05:09] [INFO ] Redundant transitions in 175 ms returned []
[2023-03-10 01:05:09] [INFO ] Invariant cache hit.
[2023-03-10 01:05:10] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2898 ms. Remains : 164/164 places, 3697/3697 transitions.
Treatment of property DNAwalker-PT-18lozangeBlock-LTLCardinality-05 finished in 179424 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||X(p1)))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
[2023-03-10 01:05:10] [INFO ] Invariant cache hit.
[2023-03-10 01:05:11] [INFO ] Dead Transitions using invariants and state equation in 960 ms found 0 transitions.
[2023-03-10 01:05:11] [INFO ] Invariant cache hit.
[2023-03-10 01:05:12] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-10 01:05:12] [INFO ] Invariant cache hit.
[2023-03-10 01:05:12] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:05:12] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
[2023-03-10 01:05:12] [INFO ] Invariant cache hit.
[2023-03-10 01:05:13] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2805 ms. Remains : 164/164 places, 3697/3697 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DNAwalker-PT-18lozangeBlock-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(GT 1 s124), p1:(LEQ 1 s39)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 2 ms.
FORMULA DNAwalker-PT-18lozangeBlock-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-18lozangeBlock-LTLCardinality-06 finished in 2903 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(p0)))'
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 9 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
[2023-03-10 01:05:13] [INFO ] Invariant cache hit.
[2023-03-10 01:05:14] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
[2023-03-10 01:05:14] [INFO ] Invariant cache hit.
[2023-03-10 01:05:14] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-10 01:05:14] [INFO ] Invariant cache hit.
[2023-03-10 01:05:15] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:05:15] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 980 ms to find 0 implicit places.
[2023-03-10 01:05:15] [INFO ] Invariant cache hit.
[2023-03-10 01:05:16] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2709 ms. Remains : 164/164 places, 3697/3697 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-18lozangeBlock-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s79)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-18lozangeBlock-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-18lozangeBlock-LTLCardinality-08 finished in 2792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(p0||F(p1)))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 49 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
[2023-03-10 01:05:16] [INFO ] Invariant cache hit.
[2023-03-10 01:05:17] [INFO ] Dead Transitions using invariants and state equation in 886 ms found 0 transitions.
[2023-03-10 01:05:17] [INFO ] Invariant cache hit.
[2023-03-10 01:05:17] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-10 01:05:17] [INFO ] Invariant cache hit.
[2023-03-10 01:05:18] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:05:18] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
[2023-03-10 01:05:18] [INFO ] Redundant transitions in 174 ms returned []
[2023-03-10 01:05:18] [INFO ] Invariant cache hit.
[2023-03-10 01:05:19] [INFO ] Dead Transitions using invariants and state equation in 879 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2868 ms. Remains : 164/164 places, 3697/3697 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : DNAwalker-PT-18lozangeBlock-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 s71), p1:(GT s8 s103)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 80 ms.
Product exploration explored 100000 steps with 2 reset in 142 ms.
Computed a total of 164 stabilizing places and 3696 stable transitions
Computed a total of 164 stabilizing places and 3696 stable transitions
Detected a total of 164/164 stabilizing places and 3696/3697 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 287 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 1469 steps, including 13 resets, run visited all 3 properties in 28 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 355 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 44 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
[2023-03-10 01:05:20] [INFO ] Invariant cache hit.
[2023-03-10 01:05:21] [INFO ] Dead Transitions using invariants and state equation in 909 ms found 0 transitions.
[2023-03-10 01:05:21] [INFO ] Invariant cache hit.
[2023-03-10 01:05:21] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-10 01:05:21] [INFO ] Invariant cache hit.
[2023-03-10 01:05:22] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:05:22] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
[2023-03-10 01:05:22] [INFO ] Redundant transitions in 176 ms returned []
[2023-03-10 01:05:22] [INFO ] Invariant cache hit.
[2023-03-10 01:05:23] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2885 ms. Remains : 164/164 places, 3697/3697 transitions.
Computed a total of 164 stabilizing places and 3696 stable transitions
Computed a total of 164 stabilizing places and 3696 stable transitions
Detected a total of 164/164 stabilizing places and 3696/3697 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 120 steps, including 1 resets, run visited all 3 properties in 4 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 320 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 103 ms.
Product exploration explored 100000 steps with 0 reset in 104 ms.
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 38 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
[2023-03-10 01:05:25] [INFO ] Invariant cache hit.
[2023-03-10 01:05:25] [INFO ] Dead Transitions using invariants and state equation in 942 ms found 0 transitions.
[2023-03-10 01:05:25] [INFO ] Invariant cache hit.
[2023-03-10 01:05:26] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-10 01:05:26] [INFO ] Invariant cache hit.
[2023-03-10 01:05:26] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:05:26] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
[2023-03-10 01:05:26] [INFO ] Redundant transitions in 171 ms returned []
[2023-03-10 01:05:26] [INFO ] Invariant cache hit.
[2023-03-10 01:05:27] [INFO ] Dead Transitions using invariants and state equation in 866 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2891 ms. Remains : 164/164 places, 3697/3697 transitions.
Treatment of property DNAwalker-PT-18lozangeBlock-LTLCardinality-09 finished in 11440 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 ((X(p0)&&(p1 U G(p2))&&F(!p1))||X(G(p0))))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
[2023-03-10 01:05:28] [INFO ] Invariant cache hit.
[2023-03-10 01:05:28] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
[2023-03-10 01:05:28] [INFO ] Invariant cache hit.
[2023-03-10 01:05:29] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-10 01:05:29] [INFO ] Invariant cache hit.
[2023-03-10 01:05:29] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:05:29] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
[2023-03-10 01:05:29] [INFO ] Invariant cache hit.
[2023-03-10 01:05:30] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2704 ms. Remains : 164/164 places, 3697/3697 transitions.
Stuttering acceptance computed with spot in 435 ms :[true, (OR (NOT p2) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : DNAwalker-PT-18lozangeBlock-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 7}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 10}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 7}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 10}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 12}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=p1, acceptance={} source=6 dest: 8}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 9}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 7}, { cond=(AND p1 p0), acceptance={} source=7 dest: 8}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=7 dest: 9}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=(AND p1 p0), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 7}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=8 dest: 10}], [{ cond=(NOT p0), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=9 dest: 8}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=9 dest: 10}, { cond=(AND p2 p1 p0), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=10 dest: 8}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=10 dest: 10}, { cond=(AND p2 p1 p0), acceptance={} source=10 dest: 11}, { cond=(AND p2 (NOT p0)), acceptance={} source=10 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=11 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=11 dest: 2}, { cond=(AND p2 p1 p0), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=11 dest: 7}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=11 dest: 10}, { cond=(AND p2 (NOT p0)), acceptance={} source=11 dest: 12}], [{ cond=(NOT p2), acceptance={} source=12 dest: 0}, { cond=p2, acceptance={} source=12 dest: 12}]], initial=5, aps=[p2:(LEQ 1 s47), p1:(LEQ 2 s27), p0:(GT s31 s118)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-18lozangeBlock-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-18lozangeBlock-LTLCardinality-11 finished in 3181 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((p0 U X(p1)))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 9 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
[2023-03-10 01:05:31] [INFO ] Invariant cache hit.
[2023-03-10 01:05:32] [INFO ] Dead Transitions using invariants and state equation in 870 ms found 0 transitions.
[2023-03-10 01:05:32] [INFO ] Invariant cache hit.
[2023-03-10 01:05:32] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-10 01:05:32] [INFO ] Invariant cache hit.
[2023-03-10 01:05:32] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:05:33] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
[2023-03-10 01:05:33] [INFO ] Invariant cache hit.
[2023-03-10 01:05:33] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2711 ms. Remains : 164/164 places, 3697/3697 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : DNAwalker-PT-18lozangeBlock-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 s159), p1:(OR (LEQ 1 s146) (LEQ 2 s159))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 148 steps with 37 reset in 4 ms.
FORMULA DNAwalker-PT-18lozangeBlock-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-18lozangeBlock-LTLCardinality-12 finished in 2878 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 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
[2023-03-10 01:05:34] [INFO ] Invariant cache hit.
[2023-03-10 01:05:34] [INFO ] Dead Transitions using invariants and state equation in 864 ms found 0 transitions.
[2023-03-10 01:05:34] [INFO ] Invariant cache hit.
[2023-03-10 01:05:35] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-10 01:05:35] [INFO ] Invariant cache hit.
[2023-03-10 01:05:35] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:05:35] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
[2023-03-10 01:05:35] [INFO ] Invariant cache hit.
[2023-03-10 01:05:36] [INFO ] Dead Transitions using invariants and state equation in 861 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2612 ms. Remains : 164/164 places, 3697/3697 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-18lozangeBlock-LTLCardinality-13 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 s103 s68)], 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 249 steps with 3 reset in 7 ms.
FORMULA DNAwalker-PT-18lozangeBlock-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-18lozangeBlock-LTLCardinality-13 finished in 2693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 49 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
[2023-03-10 01:05:36] [INFO ] Invariant cache hit.
[2023-03-10 01:05:37] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
[2023-03-10 01:05:37] [INFO ] Invariant cache hit.
[2023-03-10 01:05:37] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-10 01:05:37] [INFO ] Invariant cache hit.
[2023-03-10 01:05:38] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:05:38] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
[2023-03-10 01:05:38] [INFO ] Redundant transitions in 175 ms returned []
[2023-03-10 01:05:38] [INFO ] Invariant cache hit.
[2023-03-10 01:05:39] [INFO ] Dead Transitions using invariants and state equation in 862 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2861 ms. Remains : 164/164 places, 3697/3697 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-18lozangeBlock-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s162 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 73 ms.
Product exploration explored 100000 steps with 4 reset in 111 ms.
Computed a total of 164 stabilizing places and 3696 stable transitions
Computed a total of 164 stabilizing places and 3696 stable transitions
Detected a total of 164/164 stabilizing places and 3696/3697 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 43 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
[2023-03-10 01:05:40] [INFO ] Invariant cache hit.
[2023-03-10 01:05:41] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
[2023-03-10 01:05:41] [INFO ] Invariant cache hit.
[2023-03-10 01:05:41] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-10 01:05:41] [INFO ] Invariant cache hit.
[2023-03-10 01:05:41] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:05:42] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
[2023-03-10 01:05:42] [INFO ] Redundant transitions in 171 ms returned []
[2023-03-10 01:05:42] [INFO ] Invariant cache hit.
[2023-03-10 01:05:43] [INFO ] Dead Transitions using invariants and state equation in 870 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2820 ms. Remains : 164/164 places, 3697/3697 transitions.
Computed a total of 164 stabilizing places and 3696 stable transitions
Computed a total of 164 stabilizing places and 3696 stable transitions
Detected a total of 164/164 stabilizing places and 3696/3697 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 97 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=32 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 103 ms.
Stuttering criterion allowed to conclude after 358 steps with 4 reset in 5 ms.
FORMULA DNAwalker-PT-18lozangeBlock-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-18lozangeBlock-LTLCardinality-14 finished in 7316 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(p0)&&(p1||G(p2)))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
[2023-03-10 01:05:44] [INFO ] Invariant cache hit.
[2023-03-10 01:05:44] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 0 transitions.
[2023-03-10 01:05:44] [INFO ] Invariant cache hit.
[2023-03-10 01:05:45] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-10 01:05:45] [INFO ] Invariant cache hit.
[2023-03-10 01:05:45] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2023-03-10 01:05:45] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 980 ms to find 0 implicit places.
[2023-03-10 01:05:45] [INFO ] Invariant cache hit.
[2023-03-10 01:05:46] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2702 ms. Remains : 164/164 places, 3697/3697 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-18lozangeBlock-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ s65 s132), p1:(LEQ 3 s91), p2:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 59 steps with 0 reset in 2 ms.
FORMULA DNAwalker-PT-18lozangeBlock-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-18lozangeBlock-LTLCardinality-15 finished in 2895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0))||F((p1 U (G(p1)||(p1&&(p0 U (p2||G(p0))))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(p0||F(p1)))))'
[2023-03-10 01:05:47] [INFO ] Flatten gal took : 113 ms
[2023-03-10 01:05:47] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-10 01:05:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 164 places, 3697 transitions and 10898 arcs took 21 ms.
Total runtime 334080 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1604/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1604/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DNAwalker-PT-18lozangeBlock-LTLCardinality-05
Could not compute solution for formula : DNAwalker-PT-18lozangeBlock-LTLCardinality-09

BK_STOP 1678410349828

--------------------
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
mcc2023
ltl formula name DNAwalker-PT-18lozangeBlock-LTLCardinality-05
ltl formula formula --ltl=/tmp/1604/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.790 real 0.120 user 0.140 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1604/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1604/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1604/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1604/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x564c3d7133f4]
1: pnml2lts-mc(+0xa2496) [0x564c3d713496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fd87792e140]
3: pnml2lts-mc(+0x405be5) [0x564c3da76be5]
4: pnml2lts-mc(+0x16b3f9) [0x564c3d7dc3f9]
5: pnml2lts-mc(+0x164ac4) [0x564c3d7d5ac4]
6: pnml2lts-mc(+0x272e0a) [0x564c3d8e3e0a]
7: pnml2lts-mc(+0xb61f0) [0x564c3d7271f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fd8777814d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fd87778167a]
10: pnml2lts-mc(+0xa1581) [0x564c3d712581]
11: pnml2lts-mc(+0xa1910) [0x564c3d712910]
12: pnml2lts-mc(+0xa32a2) [0x564c3d7142a2]
13: pnml2lts-mc(+0xa50f4) [0x564c3d7160f4]
14: pnml2lts-mc(+0xa516b) [0x564c3d71616b]
15: pnml2lts-mc(+0x3f34b3) [0x564c3da644b3]
16: pnml2lts-mc(+0x7c63d) [0x564c3d6ed63d]
17: pnml2lts-mc(+0x67d86) [0x564c3d6d8d86]
18: pnml2lts-mc(+0x60a8a) [0x564c3d6d1a8a]
19: pnml2lts-mc(+0x5eb15) [0x564c3d6cfb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fd877769d0a]
21: pnml2lts-mc(+0x6075e) [0x564c3d6d175e]
ltl formula name DNAwalker-PT-18lozangeBlock-LTLCardinality-09
ltl formula formula --ltl=/tmp/1604/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.130 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1604/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1604/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1604/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1604/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="DNAwalker-PT-18lozangeBlock"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DNAwalker-PT-18lozangeBlock, 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 r105-tall-167814482001011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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