Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695100772.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-090, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100772
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 50M
-rw-r--r-- 1 mcc users 9.2K Feb 26 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 00:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 00:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 49M 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 CANInsertWithFailure-PT-090-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678666381994

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-090
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 00:13:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 00:13:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:13:05] [INFO ] Load time of PNML (sax parser for PT used): 970 ms
[2023-03-13 00:13:05] [INFO ] Transformed 17284 places.
[2023-03-13 00:13:05] [INFO ] Transformed 49140 transitions.
[2023-03-13 00:13:05] [INFO ] Parsed PT model containing 17284 places and 49140 transitions and 131400 arcs in 1222 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-090-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-090-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-090-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 17284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17284/17284 places, 49140/49140 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17283 transition count 49140
Applied a total of 1 rules in 7210 ms. Remains 17283 /17284 variables (removed 1) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2023-03-13 00:13:28] [INFO ] Computed 92 place invariants in 15156 ms
[2023-03-13 00:13:30] [INFO ] Implicit Places using invariants in 17482 ms returned []
Implicit Place search using SMT only with invariants took 17517 ms to find 0 implicit places.
[2023-03-13 00:13:30] [INFO ] Invariant cache hit.
[2023-03-13 00:13:33] [INFO ] Dead Transitions using invariants and state equation in 2259 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17283/17284 places, 49140/49140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27020 ms. Remains : 17283/17284 places, 49140/49140 transitions.
Support contains 37 out of 17283 places after structural reductions.
[2023-03-13 00:13:35] [INFO ] Flatten gal took : 1963 ms
[2023-03-13 00:13:37] [INFO ] Flatten gal took : 1737 ms
[2023-03-13 00:13:39] [INFO ] Input system was already deterministic with 49140 transitions.
Support contains 34 out of 17283 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 1131 ms. (steps per millisecond=8 ) properties (out of 28) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-13 00:13:41] [INFO ] Invariant cache hit.
[2023-03-13 00:13:49] [INFO ] [Real]Absence check using 90 positive place invariants in 297 ms returned sat
[2023-03-13 00:13:49] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 506 ms returned sat
[2023-03-13 00:13:53] [INFO ] After 11712ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-13 00:14:00] [INFO ] [Nat]Absence check using 90 positive place invariants in 342 ms returned sat
[2023-03-13 00:14:01] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 497 ms returned sat
[2023-03-13 00:14:18] [INFO ] After 11284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-13 00:14:18] [INFO ] State equation strengthened by 16110 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-13 00:14:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:14:18] [INFO ] After 25264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 23 out of 17283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 625 transitions
Trivial Post-agglo rules discarded 625 transitions
Performed 625 trivial Post agglomeration. Transition count delta: 625
Iterating post reduction 0 with 625 rules applied. Total rules applied 625 place count 17283 transition count 48515
Reduce places removed 625 places and 0 transitions.
Iterating post reduction 1 with 625 rules applied. Total rules applied 1250 place count 16658 transition count 48515
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1250 place count 16658 transition count 48513
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1254 place count 16656 transition count 48513
Performed 7997 Post agglomeration using F-continuation condition.Transition count delta: 7997
Deduced a syphon composed of 7997 places in 48 ms
Reduce places removed 7997 places and 0 transitions.
Iterating global reduction 2 with 15994 rules applied. Total rules applied 17248 place count 8659 transition count 40516
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17252 place count 8659 transition count 40512
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 17256 place count 8655 transition count 40512
Partial Free-agglomeration rule applied 8186 times.
Drop transitions removed 8186 transitions
Iterating global reduction 3 with 8186 rules applied. Total rules applied 25442 place count 8655 transition count 40512
Partial Free-agglomeration rule applied 180 times.
Drop transitions removed 180 transitions
Iterating global reduction 3 with 180 rules applied. Total rules applied 25622 place count 8655 transition count 40512
Applied a total of 25622 rules in 28618 ms. Remains 8655 /17283 variables (removed 8628) and now considering 40512/49140 (removed 8628) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28623 ms. Remains : 8655/17283 places, 40512/49140 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 792 ms. (steps per millisecond=12 ) properties (out of 20) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) 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 10) seen :0
Running SMT prover for 10 properties.
[2023-03-13 00:14:48] [INFO ] Flow matrix only has 40505 transitions (discarded 7 similar events)
// Phase 1: matrix 40505 rows 8655 cols
[2023-03-13 00:14:51] [INFO ] Computed 92 place invariants in 3362 ms
[2023-03-13 00:14:54] [INFO ] [Real]Absence check using 90 positive place invariants in 620 ms returned sat
[2023-03-13 00:14:55] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 164 ms returned sat
[2023-03-13 00:14:56] [INFO ] After 4988ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 00:14:59] [INFO ] [Nat]Absence check using 90 positive place invariants in 130 ms returned sat
[2023-03-13 00:14:59] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 174 ms returned sat
[2023-03-13 00:15:21] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 11 out of 8655 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8655/8655 places, 40512/40512 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 12 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 8649 transition count 40506
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 8649 transition count 40506
Applied a total of 15 rules in 9885 ms. Remains 8649 /8655 variables (removed 6) and now considering 40506/40512 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9885 ms. Remains : 8649/8655 places, 40506/40512 transitions.
Computed a total of 362 stabilizing places and 630 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((G(F(p0))&&(X(p1)||F(p2)))))'
Support contains 5 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 5226 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2023-03-13 00:15:53] [INFO ] Computed 92 place invariants in 15639 ms
[2023-03-13 00:15:54] [INFO ] Implicit Places using invariants in 17470 ms returned []
Implicit Place search using SMT only with invariants took 17475 ms to find 0 implicit places.
[2023-03-13 00:15:55] [INFO ] Invariant cache hit.
[2023-03-13 00:15:57] [INFO ] Dead Transitions using invariants and state equation in 2429 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25141 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 468 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s1416 1) (LT s14830 1)), p2:(AND (GEQ s91 1) (GEQ s4479 1)), p1:(GEQ s7376 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 8524 steps with 3 reset in 463 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-00 finished in 26373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0)&&X(p1)) U X(G((p0||(p1 U p2))))))'
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 5357 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2023-03-13 00:16:04] [INFO ] Invariant cache hit.
[2023-03-13 00:16:05] [INFO ] Implicit Places using invariants in 1664 ms returned []
Implicit Place search using SMT only with invariants took 1668 ms to find 0 implicit places.
[2023-03-13 00:16:05] [INFO ] Invariant cache hit.
[2023-03-13 00:16:07] [INFO ] Dead Transitions using invariants and state equation in 1729 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8759 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (AND p1 (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(OR p0 p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=1, aps=[p0:(AND (GEQ s54 1) (GEQ s329 1)), p1:(LT s11797 1), p2:(GEQ s7318 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28576 reset in 7613 ms.
Product exploration explored 100000 steps with 28450 reset in 7100 ms.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p0 p1 p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p0 p1 p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 1430 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p2)), true, (AND p1 (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 944 ms. (steps per millisecond=10 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 68872 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68872 steps, saw 67873 distinct states, run finished after 3003 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-13 00:16:28] [INFO ] Invariant cache hit.
[2023-03-13 00:16:33] [INFO ] [Real]Absence check using 90 positive place invariants in 184 ms returned sat
[2023-03-13 00:16:34] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 351 ms returned sat
[2023-03-13 00:16:34] [INFO ] After 5972ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 00:16:39] [INFO ] [Nat]Absence check using 90 positive place invariants in 244 ms returned sat
[2023-03-13 00:16:39] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 522 ms returned sat
[2023-03-13 00:16:59] [INFO ] After 17832ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 00:17:00] [INFO ] State equation strengthened by 16110 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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 00:17:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:17:00] [INFO ] After 25434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 17283 transition count 48512
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 16655 transition count 48512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 16655 transition count 48511
Deduced a syphon composed of 1 places in 29 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 16654 transition count 48511
Performed 8008 Post agglomeration using F-continuation condition.Transition count delta: 8008
Deduced a syphon composed of 8008 places in 23 ms
Reduce places removed 8008 places and 0 transitions.
Iterating global reduction 2 with 16016 rules applied. Total rules applied 17274 place count 8646 transition count 40503
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17276 place count 8646 transition count 40501
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17278 place count 8644 transition count 40501
Partial Free-agglomeration rule applied 8191 times.
Drop transitions removed 8191 transitions
Iterating global reduction 3 with 8191 rules applied. Total rules applied 25469 place count 8644 transition count 40501
Partial Free-agglomeration rule applied 90 times.
Drop transitions removed 90 transitions
Iterating global reduction 3 with 90 rules applied. Total rules applied 25559 place count 8644 transition count 40501
Applied a total of 25559 rules in 24600 ms. Remains 8644 /17283 variables (removed 8639) and now considering 40501/49140 (removed 8639) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24605 ms. Remains : 8644/17283 places, 40501/49140 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 874 ms. (steps per millisecond=11 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-13 00:17:26] [INFO ] Flow matrix only has 40500 transitions (discarded 1 similar events)
// Phase 1: matrix 40500 rows 8644 cols
[2023-03-13 00:17:29] [INFO ] Computed 92 place invariants in 3738 ms
[2023-03-13 00:17:31] [INFO ] [Real]Absence check using 90 positive place invariants in 97 ms returned sat
[2023-03-13 00:17:31] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 176 ms returned sat
[2023-03-13 00:17:32] [INFO ] After 2562ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 00:17:34] [INFO ] [Nat]Absence check using 90 positive place invariants in 96 ms returned sat
[2023-03-13 00:17:34] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 177 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 00:17:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:17:57] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 8644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8644/8644 places, 40501/40501 transitions.
Applied a total of 0 rules in 3143 ms. Remains 8644 /8644 variables (removed 0) and now considering 40501/40501 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3143 ms. Remains : 8644/8644 places, 40501/40501 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 572 ms. (steps per millisecond=17 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-13 00:18:01] [INFO ] Flow matrix only has 40500 transitions (discarded 1 similar events)
[2023-03-13 00:18:01] [INFO ] Invariant cache hit.
[2023-03-13 00:18:03] [INFO ] [Real]Absence check using 90 positive place invariants in 113 ms returned sat
[2023-03-13 00:18:03] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 175 ms returned sat
[2023-03-13 00:18:03] [INFO ] After 2338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 00:18:05] [INFO ] [Nat]Absence check using 90 positive place invariants in 119 ms returned sat
[2023-03-13 00:18:05] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 159 ms returned sat
[2023-03-13 00:18:28] [INFO ] After 22142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 00:18:29] [INFO ] State equation strengthened by 40226 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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 00:18:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:18:29] [INFO ] After 25612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 8644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8644/8644 places, 40501/40501 transitions.
Applied a total of 0 rules in 3248 ms. Remains 8644 /8644 variables (removed 0) and now considering 40501/40501 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3250 ms. Remains : 8644/8644 places, 40501/40501 transitions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p0 p1 p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p0 p1 p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 19 factoid took 1452 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) (NOT p2)), true, (AND p1 (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p2)), true, (AND p1 (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 49140 rows 17283 cols
[2023-03-13 00:18:48] [INFO ] Computed 92 place invariants in 13451 ms
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 17283 transition count 48512
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 16655 transition count 48512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 16655 transition count 48511
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 16654 transition count 48511
Performed 8008 Post agglomeration using F-continuation condition.Transition count delta: 8008
Deduced a syphon composed of 8008 places in 27 ms
Reduce places removed 8008 places and 0 transitions.
Iterating global reduction 2 with 16016 rules applied. Total rules applied 17274 place count 8646 transition count 40503
Applied a total of 17274 rules in 15446 ms. Remains 8646 /17283 variables (removed 8637) and now considering 40503/49140 (removed 8637) transitions.
[2023-03-13 00:19:19] [INFO ] Flow matrix only has 32672 transitions (discarded 7831 similar events)
// Phase 1: matrix 32672 rows 8646 cols
[2023-03-13 00:19:25] [INFO ] Computed 92 place invariants in 5903 ms
[2023-03-13 00:19:26] [INFO ] Implicit Places using invariants in 7007 ms returned []
Implicit Place search using SMT only with invariants took 7013 ms to find 0 implicit places.
[2023-03-13 00:19:26] [INFO ] Flow matrix only has 32672 transitions (discarded 7831 similar events)
[2023-03-13 00:19:26] [INFO ] Invariant cache hit.
[2023-03-13 00:19:51] [INFO ] Dead Transitions using invariants and state equation in 24838 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8646/17283 places, 40503/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47304 ms. Remains : 8646/17283 places, 40503/49140 transitions.
Computed a total of 271 stabilizing places and 450 stable transitions
Computed a total of 271 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (OR p0 p1 p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p0 p1 p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1040 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p2)), true, (AND p1 (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 21 resets, run finished after 719 ms. (steps per millisecond=13 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 00:19:53] [INFO ] Flow matrix only has 32672 transitions (discarded 7831 similar events)
[2023-03-13 00:19:53] [INFO ] Invariant cache hit.
[2023-03-13 00:19:54] [INFO ] [Real]Absence check using 90 positive place invariants in 129 ms returned sat
[2023-03-13 00:19:54] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 149 ms returned sat
[2023-03-13 00:19:55] [INFO ] After 1665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 00:19:56] [INFO ] [Nat]Absence check using 90 positive place invariants in 78 ms returned sat
[2023-03-13 00:19:56] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 131 ms returned sat
[2023-03-13 00:20:19] [INFO ] After 23209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 00:20:20] [INFO ] State equation strengthened by 24206 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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 00:20:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:20:20] [INFO ] After 25084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 4 out of 8646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8646/8646 places, 40503/40503 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8646 transition count 40501
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 8644 transition count 40501
Partial Free-agglomeration rule applied 8191 times.
Drop transitions removed 8191 transitions
Iterating global reduction 1 with 8191 rules applied. Total rules applied 8195 place count 8644 transition count 40501
Partial Free-agglomeration rule applied 90 times.
Drop transitions removed 90 transitions
Iterating global reduction 1 with 90 rules applied. Total rules applied 8285 place count 8644 transition count 40501
Applied a total of 8285 rules in 12276 ms. Remains 8644 /8646 variables (removed 2) and now considering 40501/40503 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12278 ms. Remains : 8644/8646 places, 40501/40503 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 81006 steps, run timeout after 3002 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 81006 steps, saw 77024 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 00:20:36] [INFO ] Flow matrix only has 40500 transitions (discarded 1 similar events)
// Phase 1: matrix 40500 rows 8644 cols
[2023-03-13 00:20:39] [INFO ] Computed 92 place invariants in 3457 ms
[2023-03-13 00:20:40] [INFO ] [Real]Absence check using 90 positive place invariants in 133 ms returned sat
[2023-03-13 00:20:41] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 183 ms returned sat
[2023-03-13 00:21:04] [INFO ] After 23134ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-13 00:21:05] [INFO ] State equation strengthened by 40226 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:339)
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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 00:21:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:21:05] [INFO ] After 25554ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 8644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8644/8644 places, 40501/40501 transitions.
Applied a total of 0 rules in 3236 ms. Remains 8644 /8644 variables (removed 0) and now considering 40501/40501 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3237 ms. Remains : 8644/8644 places, 40501/40501 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8644/8644 places, 40501/40501 transitions.
Applied a total of 0 rules in 3147 ms. Remains 8644 /8644 variables (removed 0) and now considering 40501/40501 (removed 0) transitions.
[2023-03-13 00:21:11] [INFO ] Flow matrix only has 40500 transitions (discarded 1 similar events)
[2023-03-13 00:21:11] [INFO ] Invariant cache hit.
[2023-03-13 00:21:19] [INFO ] Implicit Places using invariants in 8020 ms returned []
Implicit Place search using SMT only with invariants took 8022 ms to find 0 implicit places.
[2023-03-13 00:21:19] [INFO ] Flow matrix only has 40500 transitions (discarded 1 similar events)
[2023-03-13 00:21:19] [INFO ] Invariant cache hit.
[2023-03-13 00:21:20] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12140 ms. Remains : 8644/8644 places, 40501/40501 transitions.
Graph (trivial) has 39775 edges and 8644 vertex of which 8187 / 8644 are part of one of the 2 SCC in 35 ms
Free SCC test removed 8185 places
Drop transitions removed 31502 transitions
Ensure Unique test removed 8179 transitions
Reduce isomorphic transitions removed 39681 transitions.
Graph (complete) has 1363 edges and 459 vertex of which 192 are kept as prefixes of interest. Removing 267 places using SCC suffix rule.1 ms
Discarding 267 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Drop transitions removed 267 transitions
Reduce isomorphic transitions removed 267 transitions.
Iterating post reduction 0 with 267 rules applied. Total rules applied 269 place count 192 transition count 465
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 269 place count 192 transition count 464
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 271 place count 191 transition count 464
Discarding 175 places :
Symmetric choice reduction at 1 with 175 rule applications. Total rules 446 place count 16 transition count 115
Iterating global reduction 1 with 175 rules applied. Total rules applied 621 place count 16 transition count 115
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 708 place count 16 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 710 place count 15 transition count 27
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 713 place count 15 transition count 24
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 714 place count 15 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 715 place count 14 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 716 place count 14 transition count 23
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 717 place count 13 transition count 22
Iterating global reduction 3 with 1 rules applied. Total rules applied 718 place count 13 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 720 place count 13 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 721 place count 12 transition count 19
Applied a total of 721 rules in 396 ms. Remains 12 /8644 variables (removed 8632) and now considering 19/40501 (removed 40482) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 19 rows 12 cols
[2023-03-13 00:21:21] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 00:21:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 00:21:21] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 00:21:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 00:21:21] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 00:21:21] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-13 00:21:21] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (OR p0 p1 p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p0 p1 p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (NOT (OR p0 p1 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1 p2)))
Knowledge based reduction with 18 factoid took 422 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-090-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-01 finished in 322969 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 U (p1||G(p0))))))'
Support contains 2 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 17283 transition count 48510
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 16653 transition count 48510
Performed 8008 Post agglomeration using F-continuation condition.Transition count delta: 8008
Deduced a syphon composed of 8008 places in 34 ms
Reduce places removed 8008 places and 0 transitions.
Iterating global reduction 2 with 16016 rules applied. Total rules applied 17276 place count 8645 transition count 40502
Applied a total of 17276 rules in 15964 ms. Remains 8645 /17283 variables (removed 8638) and now considering 40502/49140 (removed 8638) transitions.
[2023-03-13 00:21:37] [INFO ] Flow matrix only has 32672 transitions (discarded 7830 similar events)
// Phase 1: matrix 32672 rows 8645 cols
[2023-03-13 00:21:44] [INFO ] Computed 92 place invariants in 6647 ms
[2023-03-13 00:21:45] [INFO ] Implicit Places using invariants in 7738 ms returned []
Implicit Place search using SMT only with invariants took 7740 ms to find 0 implicit places.
[2023-03-13 00:21:45] [INFO ] Flow matrix only has 32672 transitions (discarded 7830 similar events)
[2023-03-13 00:21:45] [INFO ] Invariant cache hit.
[2023-03-13 00:21:46] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8645/17283 places, 40502/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24533 ms. Remains : 8645/17283 places, 40502/49140 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s1455 1) (GEQ s4401 1)), p0:(GEQ s4401 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 447 steps with 0 reset in 22 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-02 finished in 24760 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)&&X(X(G((X(p2)&&p1)))))))'
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 7403 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2023-03-13 00:22:07] [INFO ] Computed 92 place invariants in 13366 ms
[2023-03-13 00:22:08] [INFO ] Implicit Places using invariants in 15176 ms returned []
Implicit Place search using SMT only with invariants took 15178 ms to find 0 implicit places.
[2023-03-13 00:22:08] [INFO ] Invariant cache hit.
[2023-03-13 00:22:10] [INFO ] Dead Transitions using invariants and state equation in 1586 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24172 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 334 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1118 1) (GEQ s1197 1)), p1:(AND (GEQ s1118 1) (GEQ s1197 1)), p2:(GEQ s7512 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-03 finished in 24692 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((p0||F(G(p1)))))'
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 7104 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2023-03-13 00:22:18] [INFO ] Invariant cache hit.
[2023-03-13 00:22:19] [INFO ] Implicit Places using invariants in 1754 ms returned []
Implicit Place search using SMT only with invariants took 1757 ms to find 0 implicit places.
[2023-03-13 00:22:19] [INFO ] Invariant cache hit.
[2023-03-13 00:22:21] [INFO ] Dead Transitions using invariants and state equation in 1575 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10443 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GEQ s5074 1), p1:(OR (LT s91 1) (LT s782 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 44 reset in 3785 ms.
Product exploration explored 100000 steps with 45 reset in 3781 ms.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 141523 steps, run timeout after 3008 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 141523 steps, saw 139294 distinct states, run finished after 3009 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 00:22:33] [INFO ] Invariant cache hit.
[2023-03-13 00:22:35] [INFO ] [Real]Absence check using 90 positive place invariants in 230 ms returned sat
[2023-03-13 00:22:35] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 384 ms returned sat
[2023-03-13 00:22:58] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 17283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 17283 transition count 48512
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 16655 transition count 48512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 16655 transition count 48511
Deduced a syphon composed of 1 places in 23 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 16654 transition count 48511
Performed 8009 Post agglomeration using F-continuation condition.Transition count delta: 8009
Deduced a syphon composed of 8009 places in 30 ms
Reduce places removed 8009 places and 0 transitions.
Iterating global reduction 2 with 16018 rules applied. Total rules applied 17276 place count 8645 transition count 40502
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17278 place count 8645 transition count 40500
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17280 place count 8643 transition count 40500
Partial Free-agglomeration rule applied 8192 times.
Drop transitions removed 8192 transitions
Iterating global reduction 3 with 8192 rules applied. Total rules applied 25472 place count 8643 transition count 40500
Partial Free-agglomeration rule applied 90 times.
Drop transitions removed 90 transitions
Iterating global reduction 3 with 90 rules applied. Total rules applied 25562 place count 8643 transition count 40500
Applied a total of 25562 rules in 33435 ms. Remains 8643 /17283 variables (removed 8640) and now considering 40500/49140 (removed 8640) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33437 ms. Remains : 8643/17283 places, 40500/49140 transitions.
Finished random walk after 767 steps, including 1 resets, run visited all 1 properties in 43 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Support contains 2 out of 17283 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 17283 transition count 48512
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 16655 transition count 48512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 16655 transition count 48511
Deduced a syphon composed of 1 places in 23 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 16654 transition count 48511
Performed 8008 Post agglomeration using F-continuation condition.Transition count delta: 8008
Deduced a syphon composed of 8008 places in 28 ms
Reduce places removed 8008 places and 0 transitions.
Iterating global reduction 2 with 16016 rules applied. Total rules applied 17274 place count 8646 transition count 40503
Applied a total of 17274 rules in 17783 ms. Remains 8646 /17283 variables (removed 8637) and now considering 40503/49140 (removed 8637) transitions.
[2023-03-13 00:23:49] [INFO ] Flow matrix only has 32672 transitions (discarded 7831 similar events)
// Phase 1: matrix 32672 rows 8646 cols
[2023-03-13 00:23:55] [INFO ] Computed 92 place invariants in 6037 ms
[2023-03-13 00:23:56] [INFO ] Implicit Places using invariants in 7002 ms returned []
Implicit Place search using SMT only with invariants took 7006 ms to find 0 implicit places.
[2023-03-13 00:23:56] [INFO ] Flow matrix only has 32672 transitions (discarded 7831 similar events)
[2023-03-13 00:23:56] [INFO ] Invariant cache hit.
[2023-03-13 00:24:21] [INFO ] Dead Transitions using invariants and state equation in 24317 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8646/17283 places, 40503/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49112 ms. Remains : 8646/17283 places, 40503/49140 transitions.
Computed a total of 271 stabilizing places and 450 stable transitions
Computed a total of 271 stabilizing places and 450 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Finished random walk after 8246 steps, including 17 resets, run visited all 1 properties in 388 ms. (steps per millisecond=21 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Product exploration explored 100000 steps with 221 reset in 4568 ms.
Stack based approach found an accepted trace after 33507 steps with 72 reset with depth 456 and stack size 454 in 1540 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-05 finished in 137394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p1 U (p2||G(p1)))))'
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 17283 transition count 48512
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 16655 transition count 48512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 16655 transition count 48511
Deduced a syphon composed of 1 places in 21 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 16654 transition count 48511
Performed 8007 Post agglomeration using F-continuation condition.Transition count delta: 8007
Deduced a syphon composed of 8007 places in 30 ms
Reduce places removed 8007 places and 0 transitions.
Iterating global reduction 2 with 16014 rules applied. Total rules applied 17272 place count 8647 transition count 40504
Applied a total of 17272 rules in 17292 ms. Remains 8647 /17283 variables (removed 8636) and now considering 40504/49140 (removed 8636) transitions.
[2023-03-13 00:24:45] [INFO ] Flow matrix only has 32674 transitions (discarded 7830 similar events)
// Phase 1: matrix 32674 rows 8647 cols
[2023-03-13 00:24:51] [INFO ] Computed 92 place invariants in 6017 ms
[2023-03-13 00:24:53] [INFO ] Implicit Places using invariants in 7358 ms returned []
Implicit Place search using SMT only with invariants took 7360 ms to find 0 implicit places.
[2023-03-13 00:24:53] [INFO ] Flow matrix only has 32674 transitions (discarded 7830 similar events)
[2023-03-13 00:24:53] [INFO ] Invariant cache hit.
[2023-03-13 00:24:54] [INFO ] Dead Transitions using invariants and state equation in 939 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8647/17283 places, 40504/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25608 ms. Remains : 8647/17283 places, 40504/49140 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(AND (LT s3004 1) (OR (AND (GEQ s66 1) (GEQ s186 1)) (GEQ s2124 1))), p1:(OR (AND (GEQ s66 1) (GEQ s186 1)) (GEQ s2124 1)), p0:(OR (LT s66 1) (LT s186 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 653 steps with 1 reset in 33 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-07 finished in 25915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(p1)))))'
Support contains 2 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 7136 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2023-03-13 00:25:20] [INFO ] Computed 92 place invariants in 19253 ms
[2023-03-13 00:25:22] [INFO ] Implicit Places using invariants in 20945 ms returned []
Implicit Place search using SMT only with invariants took 20946 ms to find 0 implicit places.
[2023-03-13 00:25:22] [INFO ] Invariant cache hit.
[2023-03-13 00:25:24] [INFO ] Dead Transitions using invariants and state equation in 1617 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29703 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s3305 1), p1:(GEQ s884 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1784 steps with 0 reset in 113 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-08 finished in 30057 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 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 7058 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2023-03-13 00:25:31] [INFO ] Invariant cache hit.
[2023-03-13 00:25:33] [INFO ] Implicit Places using invariants in 1672 ms returned []
Implicit Place search using SMT only with invariants took 1676 ms to find 0 implicit places.
[2023-03-13 00:25:33] [INFO ] Invariant cache hit.
[2023-03-13 00:25:34] [INFO ] Dead Transitions using invariants and state equation in 1660 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10400 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s49 1) (GEQ s1202 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2452 steps with 0 reset in 119 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-10 finished in 10810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((p1||F(p2)||G(p3))))))'
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 6965 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2023-03-13 00:25:42] [INFO ] Invariant cache hit.
[2023-03-13 00:25:43] [INFO ] Implicit Places using invariants in 1666 ms returned []
Implicit Place search using SMT only with invariants took 1667 ms to find 0 implicit places.
[2023-03-13 00:25:43] [INFO ] Invariant cache hit.
[2023-03-13 00:25:45] [INFO ] Dead Transitions using invariants and state equation in 1610 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10250 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4969 1), p1:(LT s4418 1), p2:(LT s6941 1), p3:(LT s2741 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration timeout after 95850 steps with 47925 reset in 10001 ms.
Product exploration timeout after 94950 steps with 47475 reset in 10001 ms.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1 p2 p3)
Knowledge based reduction with 5 factoid took 220 ms. Reduced automaton from 2 states, 3 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-090-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-11 finished in 30882 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(p0)||G(p1))))'
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 7305 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2023-03-13 00:26:13] [INFO ] Invariant cache hit.
[2023-03-13 00:26:15] [INFO ] Implicit Places using invariants in 1787 ms returned []
Implicit Place search using SMT only with invariants took 1788 ms to find 0 implicit places.
[2023-03-13 00:26:15] [INFO ] Invariant cache hit.
[2023-03-13 00:26:16] [INFO ] Dead Transitions using invariants and state equation in 1702 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10799 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s152 1) (LT s791 1)), p0:(AND (GEQ s712 1) (GEQ s833 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2195 steps with 0 reset in 92 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-12 finished in 11258 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((X(F(p0))||X(!(p0 U p1)))))'
Support contains 2 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 7726 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2023-03-13 00:26:25] [INFO ] Invariant cache hit.
[2023-03-13 00:26:26] [INFO ] Implicit Places using invariants in 1642 ms returned []
Implicit Place search using SMT only with invariants took 1657 ms to find 0 implicit places.
[2023-03-13 00:26:26] [INFO ] Invariant cache hit.
[2023-03-13 00:26:28] [INFO ] Dead Transitions using invariants and state equation in 1753 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11145 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s2949 1), p1:(OR (GEQ s15114 1) (GEQ s2949 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 86680 steps with 43340 reset in 10001 ms.
Product exploration explored 100000 steps with 50000 reset in 9535 ms.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-090-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-14 finished in 31200 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 1 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 17283 transition count 48510
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 16653 transition count 48510
Performed 8009 Post agglomeration using F-continuation condition.Transition count delta: 8009
Deduced a syphon composed of 8009 places in 21 ms
Reduce places removed 8009 places and 0 transitions.
Iterating global reduction 2 with 16018 rules applied. Total rules applied 17278 place count 8644 transition count 40501
Applied a total of 17278 rules in 17542 ms. Remains 8644 /17283 variables (removed 8639) and now considering 40501/49140 (removed 8639) transitions.
[2023-03-13 00:27:06] [INFO ] Flow matrix only has 32670 transitions (discarded 7831 similar events)
// Phase 1: matrix 32670 rows 8644 cols
[2023-03-13 00:27:12] [INFO ] Computed 92 place invariants in 6659 ms
[2023-03-13 00:27:13] [INFO ] Implicit Places using invariants in 7717 ms returned []
Implicit Place search using SMT only with invariants took 7720 ms to find 0 implicit places.
[2023-03-13 00:27:13] [INFO ] Flow matrix only has 32670 transitions (discarded 7831 similar events)
[2023-03-13 00:27:13] [INFO ] Invariant cache hit.
[2023-03-13 00:27:14] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8644/17283 places, 40501/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26179 ms. Remains : 8644/17283 places, 40501/49140 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-15 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:(GEQ s5184 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 455 steps with 0 reset in 84 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-15 finished in 26496 ms.
All properties solved by simple procedures.
Total runtime 850681 ms.
ITS solved all properties within timeout

BK_STOP 1678667235232

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="CANInsertWithFailure-PT-090"
export BK_EXAMINATION="LTLFireability"
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 CANInsertWithFailure-PT-090, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695100772"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-090.tgz
mv CANInsertWithFailure-PT-090 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;