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-167813695100779.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-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100779
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 61M
-rw-r--r-- 1 mcc users 8.8K Feb 26 00:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 00:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 00:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:19 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.0K 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 11K Feb 26 00:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 00:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 00:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 00:39 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 60M 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-100-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678667246236

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 00:27:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 00:27:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:27:29] [INFO ] Load time of PNML (sax parser for PT used): 1558 ms
[2023-03-13 00:27:29] [INFO ] Transformed 21204 places.
[2023-03-13 00:27:29] [INFO ] Transformed 60600 transitions.
[2023-03-13 00:27:29] [INFO ] Parsed PT model containing 21204 places and 60600 transitions and 162000 arcs in 1991 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 21204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21204/21204 places, 60600/60600 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21203 transition count 60600
Applied a total of 1 rules in 5557 ms. Remains 21203 /21204 variables (removed 1) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-13 00:27:57] [INFO ] Computed 102 place invariants in 21580 ms
[2023-03-13 00:27:59] [INFO ] Implicit Places using invariants in 23632 ms returned []
Implicit Place search using SMT only with invariants took 23658 ms to find 0 implicit places.
[2023-03-13 00:27:59] [INFO ] Invariant cache hit.
[2023-03-13 00:28:01] [INFO ] Dead Transitions using invariants and state equation in 2238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21203/21204 places, 60600/60600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31473 ms. Remains : 21203/21204 places, 60600/60600 transitions.
Support contains 52 out of 21203 places after structural reductions.
[2023-03-13 00:28:04] [INFO ] Flatten gal took : 1769 ms
[2023-03-13 00:28:06] [INFO ] Flatten gal took : 1417 ms
[2023-03-13 00:28:09] [INFO ] Input system was already deterministic with 60600 transitions.
Support contains 50 out of 21203 places (down from 52) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 794 ms. (steps per millisecond=12 ) properties (out of 33) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) seen :0
Interrupted probabilistic random walk after 65150 steps, run timeout after 3003 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65150 steps, saw 64320 distinct states, run finished after 3004 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 30 properties.
[2023-03-13 00:28:13] [INFO ] Invariant cache hit.
[2023-03-13 00:28:25] [INFO ] [Real]Absence check using 100 positive place invariants in 268 ms returned sat
[2023-03-13 00:28:26] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 630 ms returned sat
[2023-03-13 00:28:26] [INFO ] After 12867ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-03-13 00:28:38] [INFO ] [Nat]Absence check using 100 positive place invariants in 277 ms returned sat
[2023-03-13 00:28:39] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 629 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.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:28:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:28:51] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:30
Fused 30 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 42 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 697 transitions
Trivial Post-agglo rules discarded 697 transitions
Performed 697 trivial Post agglomeration. Transition count delta: 697
Iterating post reduction 0 with 697 rules applied. Total rules applied 697 place count 21203 transition count 59903
Reduce places removed 697 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 698 rules applied. Total rules applied 1395 place count 20506 transition count 59902
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1396 place count 20505 transition count 59902
Performed 9881 Post agglomeration using F-continuation condition.Transition count delta: 9881
Deduced a syphon composed of 9881 places in 45 ms
Reduce places removed 9881 places and 0 transitions.
Iterating global reduction 3 with 19762 rules applied. Total rules applied 21158 place count 10624 transition count 50021
Partial Free-agglomeration rule applied 10177 times.
Drop transitions removed 10177 transitions
Iterating global reduction 3 with 10177 rules applied. Total rules applied 31335 place count 10624 transition count 50021
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 3 with 100 rules applied. Total rules applied 31435 place count 10624 transition count 50021
Applied a total of 31435 rules in 29177 ms. Remains 10624 /21203 variables (removed 10579) and now considering 50021/60600 (removed 10579) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29181 ms. Remains : 10624/21203 places, 50021/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 812 ms. (steps per millisecond=12 ) properties (out of 27) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) seen :0
Running SMT prover for 23 properties.
[2023-03-13 00:29:21] [INFO ] Flow matrix only has 50000 transitions (discarded 21 similar events)
// Phase 1: matrix 50000 rows 10624 cols
[2023-03-13 00:29:30] [INFO ] Computed 102 place invariants in 8937 ms
[2023-03-13 00:29:36] [INFO ] [Real]Absence check using 100 positive place invariants in 159 ms returned sat
[2023-03-13 00:29:36] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 237 ms returned sat
[2023-03-13 00:29:37] [INFO ] After 6181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-13 00:29:42] [INFO ] [Nat]Absence check using 100 positive place invariants in 154 ms returned sat
[2023-03-13 00:29:42] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 230 ms returned sat
[2023-03-13 00:30:02] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 23 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 32 out of 10624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10624/10624 places, 50021/50021 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 18 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 10621 transition count 50018
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 10621 transition count 50018
Applied a total of 14 rules in 15556 ms. Remains 10621 /10624 variables (removed 3) and now considering 50018/50021 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15558 ms. Remains : 10621/10624 places, 50018/50021 transitions.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 402 stabilizing places and 700 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(p0)))'
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9899 Post agglomeration using F-continuation condition.Transition count delta: 9899
Deduced a syphon composed of 9899 places in 43 ms
Reduce places removed 9899 places and 0 transitions.
Iterating global reduction 2 with 19798 rules applied. Total rules applied 21198 place count 10604 transition count 50001
Applied a total of 21198 rules in 15829 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
[2023-03-13 00:30:33] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
// Phase 1: matrix 40300 rows 10604 cols
[2023-03-13 00:30:43] [INFO ] Computed 102 place invariants in 9710 ms
[2023-03-13 00:30:44] [INFO ] Implicit Places using invariants in 10766 ms returned []
Implicit Place search using SMT only with invariants took 10770 ms to find 0 implicit places.
[2023-03-13 00:30:44] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-13 00:30:44] [INFO ] Invariant cache hit.
[2023-03-13 00:30:45] [INFO ] Dead Transitions using invariants and state equation in 1014 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10604/21203 places, 50001/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27625 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s3764)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 199 reset in 4050 ms.
Product exploration explored 100000 steps with 199 reset in 3813 ms.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 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 42 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 71946 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71946 steps, saw 65479 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 00:30:57] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-13 00:30:57] [INFO ] Invariant cache hit.
[2023-03-13 00:30:59] [INFO ] [Real]Absence check using 100 positive place invariants in 114 ms returned sat
[2023-03-13 00:30:59] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 163 ms returned sat
[2023-03-13 00:31:22] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10604 transition count 50000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10603 transition count 50000
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10603 transition count 50000
Applied a total of 10103 rules in 14039 ms. Remains 10603 /10604 variables (removed 1) and now considering 50000/50001 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14044 ms. Remains : 10603/10604 places, 50000/50001 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 97898 steps, run timeout after 3003 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97898 steps, saw 93143 distinct states, run finished after 3003 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 50000 rows 10603 cols
[2023-03-13 00:31:49] [INFO ] Computed 102 place invariants in 9136 ms
[2023-03-13 00:31:51] [INFO ] [Real]Absence check using 100 positive place invariants in 130 ms returned sat
[2023-03-13 00:31:51] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 170 ms returned sat
[2023-03-13 00:32:14] [INFO ] After 25021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10603/10603 places, 50000/50000 transitions.
Applied a total of 0 rules in 5269 ms. Remains 10603 /10603 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5269 ms. Remains : 10603/10603 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10603/10603 places, 50000/50000 transitions.
Applied a total of 0 rules in 4853 ms. Remains 10603 /10603 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2023-03-13 00:32:24] [INFO ] Invariant cache hit.
[2023-03-13 00:32:25] [INFO ] Implicit Places using invariants in 1005 ms returned []
Implicit Place search using SMT only with invariants took 1015 ms to find 0 implicit places.
[2023-03-13 00:32:25] [INFO ] Invariant cache hit.
[2023-03-13 00:32:27] [INFO ] Dead Transitions using invariants and state equation in 1212 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7095 ms. Remains : 10603/10603 places, 50000/50000 transitions.
Graph (trivial) has 49397 edges and 10603 vertex of which 10199 / 10603 are part of one of the 2 SCC in 20 ms
Free SCC test removed 10197 places
Drop transitions removed 39499 transitions
Ensure Unique test removed 10092 transitions
Reduce isomorphic transitions removed 49591 transitions.
Graph (complete) has 1011 edges and 406 vertex of which 105 are kept as prefixes of interest. Removing 301 places using SCC suffix rule.1 ms
Discarding 301 places :
Also discarding 99 output transitions
Drop transitions removed 99 transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 202 rules applied. Total rules applied 204 place count 105 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 205 place count 104 transition count 108
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 303 place count 6 transition count 10
Iterating global reduction 2 with 98 rules applied. Total rules applied 401 place count 6 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 403 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 406 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 407 place count 4 transition count 5
Applied a total of 407 rules in 317 ms. Remains 4 /10603 variables (removed 10599) and now considering 5/50000 (removed 49995) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2023-03-13 00:32:27] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-13 00:32:27] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 00:32:27] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-13 00:32:27] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 174 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 1 out of 10604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4562 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-13 00:32:32] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
// Phase 1: matrix 40300 rows 10604 cols
[2023-03-13 00:32:42] [INFO ] Computed 102 place invariants in 9661 ms
[2023-03-13 00:32:43] [INFO ] Implicit Places using invariants in 10791 ms returned []
Implicit Place search using SMT only with invariants took 10794 ms to find 0 implicit places.
[2023-03-13 00:32:43] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-13 00:32:43] [INFO ] Invariant cache hit.
[2023-03-13 00:32:44] [INFO ] Dead Transitions using invariants and state equation in 1017 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16377 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 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 p0)]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 674 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Finished Best-First random walk after 2920 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=292 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 193 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 199 reset in 4491 ms.
Product exploration explored 100000 steps with 198 reset in 4445 ms.
Support contains 1 out of 10604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4286 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-13 00:32:59] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-13 00:32:59] [INFO ] Invariant cache hit.
[2023-03-13 00:33:00] [INFO ] Implicit Places using invariants in 1175 ms returned []
Implicit Place search using SMT only with invariants took 1178 ms to find 0 implicit places.
[2023-03-13 00:33:00] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-13 00:33:00] [INFO ] Invariant cache hit.
[2023-03-13 00:33:01] [INFO ] Dead Transitions using invariants and state equation in 1116 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6584 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-01 finished in 165842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G((F(p1)&&F(p2)))))))'
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 5225 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-13 00:33:29] [INFO ] Computed 102 place invariants in 20414 ms
[2023-03-13 00:33:31] [INFO ] Implicit Places using invariants in 22620 ms returned []
Implicit Place search using SMT only with invariants took 22622 ms to find 0 implicit places.
[2023-03-13 00:33:31] [INFO ] Invariant cache hit.
[2023-03-13 00:33:33] [INFO ] Dead Transitions using invariants and state equation in 2013 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29871 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 438 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 2 s20212), p1:(LEQ s5790 s6935), p2:(LEQ 3 s19191)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-02 finished in 30516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 33 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 2 with 19796 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Applied a total of 21196 rules in 16662 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
[2023-03-13 00:33:51] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-13 00:34:00] [INFO ] Computed 102 place invariants in 9819 ms
[2023-03-13 00:34:01] [INFO ] Implicit Places using invariants in 10775 ms returned []
Implicit Place search using SMT only with invariants took 10777 ms to find 0 implicit places.
[2023-03-13 00:34:01] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 00:34:01] [INFO ] Invariant cache hit.
[2023-03-13 00:34:03] [INFO ] Dead Transitions using invariants and state equation in 1228 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10605/21203 places, 50002/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28670 ms. Remains : 10605/21203 places, 50002/60600 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 3 s3501), p0:(GT s3925 s10165)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 199 reset in 4035 ms.
Product exploration explored 100000 steps with 199 reset in 4011 ms.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 249 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 647 ms. (steps per millisecond=15 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 69136 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69136 steps, saw 65044 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 00:34:15] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 00:34:15] [INFO ] Invariant cache hit.
[2023-03-13 00:34:17] [INFO ] [Real]Absence check using 100 positive place invariants in 156 ms returned sat
[2023-03-13 00:34:17] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 237 ms returned sat
[2023-03-13 00:34:17] [INFO ] After 1854ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 00:34:19] [INFO ] [Nat]Absence check using 100 positive place invariants in 143 ms returned sat
[2023-03-13 00:34:19] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 222 ms returned sat
[2023-03-13 00:34:42] [INFO ] After 22942ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 00:34:43] [INFO ] State equation strengthened by 29896 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:34:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:34:43] [INFO ] After 25514ms 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 0 ms.
Support contains 3 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10100 times.
Drop transitions removed 10100 transitions
Iterating global reduction 1 with 10100 rules applied. Total rules applied 10102 place count 10604 transition count 50001
Applied a total of 10102 rules in 13307 ms. Remains 10604 /10605 variables (removed 1) and now considering 50001/50002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13308 ms. Remains : 10604/10605 places, 50001/50002 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 95953 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95953 steps, saw 92820 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 00:35:00] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
// Phase 1: matrix 50000 rows 10604 cols
[2023-03-13 00:35:09] [INFO ] Computed 102 place invariants in 8990 ms
[2023-03-13 00:35:10] [INFO ] [Real]Absence check using 100 positive place invariants in 143 ms returned sat
[2023-03-13 00:35:11] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 224 ms returned sat
[2023-03-13 00:35:11] [INFO ] After 2078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 00:35:12] [INFO ] [Nat]Absence check using 100 positive place invariants in 115 ms returned sat
[2023-03-13 00:35:12] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 168 ms returned sat
[2023-03-13 00:35:36] [INFO ] After 23010ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 00:35:36] [INFO ] State equation strengthened by 49694 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:35:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:35:36] [INFO ] After 25526ms 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 0 ms.
Support contains 3 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4849 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4849 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4760 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-13 00:35:46] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
[2023-03-13 00:35:46] [INFO ] Invariant cache hit.
[2023-03-13 00:35:47] [INFO ] Implicit Places using invariants in 1255 ms returned []
Implicit Place search using SMT only with invariants took 1257 ms to find 0 implicit places.
[2023-03-13 00:35:47] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
[2023-03-13 00:35:47] [INFO ] Invariant cache hit.
[2023-03-13 00:35:48] [INFO ] Dead Transitions using invariants and state equation in 1078 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7104 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Graph (trivial) has 49389 edges and 10604 vertex of which 10198 / 10604 are part of one of the 2 SCC in 13 ms
Free SCC test removed 10196 places
Drop transitions removed 39493 transitions
Ensure Unique test removed 10093 transitions
Reduce isomorphic transitions removed 49586 transitions.
Graph (complete) has 1017 edges and 408 vertex of which 107 are kept as prefixes of interest. Removing 301 places using SCC suffix rule.1 ms
Discarding 301 places :
Also discarding 99 output transitions
Drop transitions removed 99 transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 202 rules applied. Total rules applied 204 place count 107 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 205 place count 106 transition count 114
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 303 place count 8 transition count 16
Iterating global reduction 2 with 98 rules applied. Total rules applied 401 place count 8 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 403 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 406 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 407 place count 6 transition count 11
Applied a total of 407 rules in 215 ms. Remains 6 /10604 variables (removed 10598) and now considering 11/50001 (removed 49990) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 6 cols
[2023-03-13 00:35:48] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-13 00:35:48] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 00:35:49] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 00:35:49] [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 5 ms.
[2023-03-13 00:35:49] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 10605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 4074 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-13 00:35:53] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-13 00:36:02] [INFO ] Computed 102 place invariants in 9162 ms
[2023-03-13 00:36:03] [INFO ] Implicit Places using invariants in 10159 ms returned []
Implicit Place search using SMT only with invariants took 10162 ms to find 0 implicit places.
[2023-03-13 00:36:03] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 00:36:03] [INFO ] Invariant cache hit.
[2023-03-13 00:36:04] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15152 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 681 ms. (steps per millisecond=14 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 70176 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70176 steps, saw 65202 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 00:36:08] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 00:36:08] [INFO ] Invariant cache hit.
[2023-03-13 00:36:10] [INFO ] [Real]Absence check using 100 positive place invariants in 117 ms returned sat
[2023-03-13 00:36:10] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 168 ms returned sat
[2023-03-13 00:36:10] [INFO ] After 1767ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 00:36:12] [INFO ] [Nat]Absence check using 100 positive place invariants in 126 ms returned sat
[2023-03-13 00:36:12] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 222 ms returned sat
[2023-03-13 00:36:35] [INFO ] After 22850ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 00:36:35] [INFO ] State equation strengthened by 29896 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:36:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:36:35] [INFO ] After 25425ms 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 0 ms.
Support contains 3 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10100 times.
Drop transitions removed 10100 transitions
Iterating global reduction 1 with 10100 rules applied. Total rules applied 10102 place count 10604 transition count 50001
Applied a total of 10102 rules in 13225 ms. Remains 10604 /10605 variables (removed 1) and now considering 50001/50002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13227 ms. Remains : 10604/10605 places, 50001/50002 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 644 ms. (steps per millisecond=15 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 97201 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97201 steps, saw 93018 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 00:36:52] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
// Phase 1: matrix 50000 rows 10604 cols
[2023-03-13 00:37:01] [INFO ] Computed 102 place invariants in 8744 ms
[2023-03-13 00:37:03] [INFO ] [Real]Absence check using 100 positive place invariants in 155 ms returned sat
[2023-03-13 00:37:03] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 236 ms returned sat
[2023-03-13 00:37:03] [INFO ] After 2016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 00:37:05] [INFO ] [Nat]Absence check using 100 positive place invariants in 150 ms returned sat
[2023-03-13 00:37:05] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 182 ms returned sat
[2023-03-13 00:37:28] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4906 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4906 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 5092 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-13 00:37:38] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
[2023-03-13 00:37:38] [INFO ] Invariant cache hit.
[2023-03-13 00:37:39] [INFO ] Implicit Places using invariants in 1078 ms returned []
Implicit Place search using SMT only with invariants took 1087 ms to find 0 implicit places.
[2023-03-13 00:37:39] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
[2023-03-13 00:37:39] [INFO ] Invariant cache hit.
[2023-03-13 00:37:40] [INFO ] Dead Transitions using invariants and state equation in 1091 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7281 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Graph (trivial) has 49389 edges and 10604 vertex of which 10198 / 10604 are part of one of the 2 SCC in 14 ms
Free SCC test removed 10196 places
Drop transitions removed 39493 transitions
Ensure Unique test removed 10093 transitions
Reduce isomorphic transitions removed 49586 transitions.
Graph (complete) has 1017 edges and 408 vertex of which 107 are kept as prefixes of interest. Removing 301 places using SCC suffix rule.1 ms
Discarding 301 places :
Also discarding 99 output transitions
Drop transitions removed 99 transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 202 rules applied. Total rules applied 204 place count 107 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 205 place count 106 transition count 114
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 303 place count 8 transition count 16
Iterating global reduction 2 with 98 rules applied. Total rules applied 401 place count 8 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 403 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 406 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 407 place count 6 transition count 11
Applied a total of 407 rules in 229 ms. Remains 6 /10604 variables (removed 10598) and now considering 11/50001 (removed 49990) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 6 cols
[2023-03-13 00:37:41] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-13 00:37:41] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 00:37:41] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 00:37:41] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 00:37:41] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 199 reset in 4651 ms.
Product exploration explored 100000 steps with 198 reset in 4074 ms.
Support contains 3 out of 10605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 4722 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-13 00:37:55] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-13 00:38:05] [INFO ] Computed 102 place invariants in 10657 ms
[2023-03-13 00:38:06] [INFO ] Implicit Places using invariants in 11702 ms returned []
Implicit Place search using SMT only with invariants took 11704 ms to find 0 implicit places.
[2023-03-13 00:38:06] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 00:38:06] [INFO ] Invariant cache hit.
[2023-03-13 00:38:08] [INFO ] Dead Transitions using invariants and state equation in 1151 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17579 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-03 finished in 275313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1||X(F((p1&&F(p2)))))))'
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 48 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 2 with 19796 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Applied a total of 21196 rules in 16887 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
[2023-03-13 00:38:26] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-13 00:38:36] [INFO ] Computed 102 place invariants in 9859 ms
[2023-03-13 00:38:37] [INFO ] Implicit Places using invariants in 10990 ms returned []
Implicit Place search using SMT only with invariants took 10991 ms to find 0 implicit places.
[2023-03-13 00:38:37] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 00:38:37] [INFO ] Invariant cache hit.
[2023-03-13 00:38:38] [INFO ] Dead Transitions using invariants and state equation in 1174 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10605/21203 places, 50002/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29057 ms. Remains : 10605/21203 places, 50002/60600 transitions.
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ 3 s2964), p2:(LEQ s9485 s5763), p1:(LEQ 3 s8585)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 518 steps with 0 reset in 29 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-04 finished in 29654 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&&(p1 U p2))))'
Support contains 6 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 4437 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-13 00:39:03] [INFO ] Computed 102 place invariants in 19679 ms
[2023-03-13 00:39:05] [INFO ] Implicit Places using invariants in 21808 ms returned []
Implicit Place search using SMT only with invariants took 21812 ms to find 0 implicit places.
[2023-03-13 00:39:05] [INFO ] Invariant cache hit.
[2023-03-13 00:39:07] [INFO ] Dead Transitions using invariants and state equation in 1867 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28119 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(GT s8491 s5011), p1:(LEQ s1561 s9306), p0:(LEQ s14748 s5353)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2436 steps with 0 reset in 124 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-05 finished in 28607 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)||X((X(G(p2))||F(p3)||p1)))))'
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 5113 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-13 00:39:13] [INFO ] Invariant cache hit.
[2023-03-13 00:39:15] [INFO ] Implicit Places using invariants in 2126 ms returned []
Implicit Place search using SMT only with invariants took 2130 ms to find 0 implicit places.
[2023-03-13 00:39:15] [INFO ] Invariant cache hit.
[2023-03-13 00:39:17] [INFO ] Dead Transitions using invariants and state equation in 2007 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9254 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s7406), p1:(OR (LEQ 3 s14294) (LEQ s18922 s14766)), p3:(LEQ s18922 s14766), p2:(LEQ 3 s14294)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 69070 steps with 23051 reset in 10004 ms.
Product exploration timeout after 74830 steps with 24869 reset in 10008 ms.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 612 ms. (steps per millisecond=16 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 75236 steps, run timeout after 3003 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75236 steps, saw 74264 distinct states, run finished after 3004 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 00:39:42] [INFO ] Invariant cache hit.
[2023-03-13 00:39:46] [INFO ] [Real]Absence check using 100 positive place invariants in 295 ms returned sat
[2023-03-13 00:39:46] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 673 ms returned sat
[2023-03-13 00:39:47] [INFO ] After 5005ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 00:39:51] [INFO ] [Nat]Absence check using 100 positive place invariants in 179 ms returned sat
[2023-03-13 00:39:51] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 447 ms returned sat
[2023-03-13 00:40:12] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9896 Post agglomeration using F-continuation condition.Transition count delta: 9896
Deduced a syphon composed of 9896 places in 31 ms
Reduce places removed 9896 places and 0 transitions.
Iterating global reduction 2 with 19792 rules applied. Total rules applied 21192 place count 10607 transition count 50004
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21193 place count 10607 transition count 50003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21194 place count 10606 transition count 50003
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 3 with 10101 rules applied. Total rules applied 31295 place count 10606 transition count 50003
Applied a total of 31295 rules in 26302 ms. Remains 10606 /21203 variables (removed 10597) and now considering 50003/60600 (removed 10597) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26304 ms. Remains : 10606/21203 places, 50003/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 581 ms. (steps per millisecond=17 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 89584 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89584 steps, saw 87617 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50003 rows 10606 cols
[2023-03-13 00:40:51] [INFO ] Computed 102 place invariants in 9433 ms
[2023-03-13 00:40:54] [INFO ] [Real]Absence check using 100 positive place invariants in 153 ms returned sat
[2023-03-13 00:40:54] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 229 ms returned sat
[2023-03-13 00:40:54] [INFO ] After 2661ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 00:40:56] [INFO ] [Nat]Absence check using 100 positive place invariants in 120 ms returned sat
[2023-03-13 00:40:56] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 231 ms returned sat
[2023-03-13 00:41:19] [INFO ] After 21895ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 00:41:20] [INFO ] State equation strengthened by 49692 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:41:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:41:20] [INFO ] After 25807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 5030 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5030 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 5034 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
[2023-03-13 00:41:30] [INFO ] Invariant cache hit.
[2023-03-13 00:41:31] [INFO ] Implicit Places using invariants in 1001 ms returned []
Implicit Place search using SMT only with invariants took 1002 ms to find 0 implicit places.
[2023-03-13 00:41:31] [INFO ] Invariant cache hit.
[2023-03-13 00:41:32] [INFO ] Dead Transitions using invariants and state equation in 1025 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7071 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 287 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 4884 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-13 00:41:58] [INFO ] Computed 102 place invariants in 20376 ms
[2023-03-13 00:42:00] [INFO ] Implicit Places using invariants in 22539 ms returned []
Implicit Place search using SMT only with invariants took 22543 ms to find 0 implicit places.
[2023-03-13 00:42:00] [INFO ] Invariant cache hit.
[2023-03-13 00:42:03] [INFO ] Dead Transitions using invariants and state equation in 2344 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29780 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 315 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 616 ms. (steps per millisecond=16 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 79148 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79148 steps, saw 78114 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 00:42:07] [INFO ] Invariant cache hit.
[2023-03-13 00:42:11] [INFO ] [Real]Absence check using 100 positive place invariants in 275 ms returned sat
[2023-03-13 00:42:12] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 648 ms returned sat
[2023-03-13 00:42:12] [INFO ] After 5046ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 00:42:16] [INFO ] [Nat]Absence check using 100 positive place invariants in 284 ms returned sat
[2023-03-13 00:42:17] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 657 ms returned sat
[2023-03-13 00:42:37] [INFO ] After 18832ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 00:42:38] [INFO ] State equation strengthened by 19900 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:42:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:42:38] [INFO ] After 25309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9896 Post agglomeration using F-continuation condition.Transition count delta: 9896
Deduced a syphon composed of 9896 places in 42 ms
Reduce places removed 9896 places and 0 transitions.
Iterating global reduction 2 with 19792 rules applied. Total rules applied 21192 place count 10607 transition count 50004
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21193 place count 10607 transition count 50003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21194 place count 10606 transition count 50003
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 3 with 10101 rules applied. Total rules applied 31295 place count 10606 transition count 50003
Applied a total of 31295 rules in 26058 ms. Remains 10606 /21203 variables (removed 10597) and now considering 50003/60600 (removed 10597) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26058 ms. Remains : 10606/21203 places, 50003/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 618 ms. (steps per millisecond=16 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 84621 steps, run timeout after 3002 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84621 steps, saw 82779 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50003 rows 10606 cols
[2023-03-13 00:43:17] [INFO ] Computed 102 place invariants in 9048 ms
[2023-03-13 00:43:19] [INFO ] [Real]Absence check using 100 positive place invariants in 152 ms returned sat
[2023-03-13 00:43:19] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 226 ms returned sat
[2023-03-13 00:43:19] [INFO ] After 2537ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 00:43:21] [INFO ] [Nat]Absence check using 100 positive place invariants in 149 ms returned sat
[2023-03-13 00:43:22] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 232 ms returned sat
[2023-03-13 00:43:44] [INFO ] After 21718ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 00:43:45] [INFO ] State equation strengthened by 49692 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:43:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:43:45] [INFO ] After 25592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 4955 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4955 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 4908 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
[2023-03-13 00:43:55] [INFO ] Invariant cache hit.
[2023-03-13 00:43:56] [INFO ] Implicit Places using invariants in 1137 ms returned []
Implicit Place search using SMT only with invariants took 1139 ms to find 0 implicit places.
[2023-03-13 00:43:56] [INFO ] Invariant cache hit.
[2023-03-13 00:43:57] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7059 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration timeout after 76400 steps with 25388 reset in 10004 ms.
Product exploration timeout after 79640 steps with 26641 reset in 10001 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Performed 500 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 21203 transition count 60600
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 500 place count 21203 transition count 60600
Deduced a syphon composed of 600 places in 32 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 600 place count 21203 transition count 60600
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 800 place count 21003 transition count 60400
Deduced a syphon composed of 400 places in 20 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 1000 place count 21003 transition count 60400
Performed 9996 Post agglomeration using F-continuation condition.Transition count delta: -19592
Deduced a syphon composed of 10396 places in 25 ms
Iterating global reduction 1 with 9996 rules applied. Total rules applied 10996 place count 21003 transition count 79992
Discarding 400 places :
Symmetric choice reduction at 1 with 400 rule applications. Total rules 11396 place count 20603 transition count 79592
Deduced a syphon composed of 9996 places in 16 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 11796 place count 20603 transition count 79592
Deduced a syphon composed of 9996 places in 14 ms
Applied a total of 11796 rules in 42661 ms. Remains 20603 /21203 variables (removed 600) and now considering 79592/60600 (removed -18992) transitions.
[2023-03-13 00:45:01] [INFO ] Flow matrix only has 69894 transitions (discarded 9698 similar events)
// Phase 1: matrix 69894 rows 20603 cols
[2023-03-13 00:45:26] [INFO ] Computed 102 place invariants in 24909 ms
[2023-03-13 00:45:28] [INFO ] Dead Transitions using invariants and state equation in 26666 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20603/21203 places, 79592/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69332 ms. Remains : 20603/21203 places, 79592/60600 transitions.
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 6826 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-13 00:45:55] [INFO ] Computed 102 place invariants in 20552 ms
[2023-03-13 00:45:57] [INFO ] Implicit Places using invariants in 22172 ms returned []
Implicit Place search using SMT only with invariants took 22185 ms to find 0 implicit places.
[2023-03-13 00:45:57] [INFO ] Invariant cache hit.
[2023-03-13 00:45:58] [INFO ] Dead Transitions using invariants and state equation in 1476 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30498 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-07 finished in 412597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((p0||F(G(p1)))))))))'
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 7208 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-13 00:46:07] [INFO ] Invariant cache hit.
[2023-03-13 00:46:09] [INFO ] Implicit Places using invariants in 1634 ms returned []
Implicit Place search using SMT only with invariants took 1649 ms to find 0 implicit places.
[2023-03-13 00:46:09] [INFO ] Invariant cache hit.
[2023-03-13 00:46:11] [INFO ] Dead Transitions using invariants and state equation in 1998 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10861 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-09 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}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(LEQ 1 s11305), p1:(GT s7659 s1554)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2377 steps with 0 reset in 93 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-09 finished in 11450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U p1)||X(G(!p0))||X(p2))))'
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 6973 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-13 00:46:18] [INFO ] Invariant cache hit.
[2023-03-13 00:46:21] [INFO ] Implicit Places using invariants in 2201 ms returned []
Implicit Place search using SMT only with invariants took 2202 ms to find 0 implicit places.
[2023-03-13 00:46:21] [INFO ] Invariant cache hit.
[2023-03-13 00:46:23] [INFO ] Dead Transitions using invariants and state equation in 2077 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11256 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 250 ms :[true, (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), p0]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(LEQ 3 s15135), p1:(LEQ 2 s18032), p2:(LEQ 1 s9719)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 40 reset in 3495 ms.
Product exploration explored 100000 steps with 40 reset in 3698 ms.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, p0, p0, p0, p0]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 158652 steps, run timeout after 3002 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 158652 steps, saw 156495 distinct states, run finished after 3003 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 00:46:35] [INFO ] Invariant cache hit.
[2023-03-13 00:46:37] [INFO ] [Real]Absence check using 100 positive place invariants in 254 ms returned sat
[2023-03-13 00:46:38] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 452 ms returned sat
[2023-03-13 00:47:00] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9900 Post agglomeration using F-continuation condition.Transition count delta: 9900
Deduced a syphon composed of 9900 places in 28 ms
Reduce places removed 9900 places and 0 transitions.
Iterating global reduction 2 with 19800 rules applied. Total rules applied 21200 place count 10603 transition count 50000
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21201 place count 10603 transition count 49999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21202 place count 10602 transition count 49999
Partial Free-agglomeration rule applied 10100 times.
Drop transitions removed 10100 transitions
Iterating global reduction 3 with 10100 rules applied. Total rules applied 31302 place count 10602 transition count 49999
Applied a total of 31302 rules in 39970 ms. Remains 10602 /21203 variables (removed 10601) and now considering 49999/60600 (removed 10601) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39972 ms. Remains : 10602/21203 places, 49999/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 99946 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99946 steps, saw 93451 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 00:47:43] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
// Phase 1: matrix 49998 rows 10602 cols
[2023-03-13 00:47:51] [INFO ] Computed 102 place invariants in 8184 ms
[2023-03-13 00:47:53] [INFO ] [Real]Absence check using 100 positive place invariants in 101 ms returned sat
[2023-03-13 00:47:53] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 279 ms returned sat
[2023-03-13 00:48:16] [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 1 out of 10602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10602/10602 places, 49999/49999 transitions.
Applied a total of 0 rules in 9469 ms. Remains 10602 /10602 variables (removed 0) and now considering 49999/49999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9469 ms. Remains : 10602/10602 places, 49999/49999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10602/10602 places, 49999/49999 transitions.
Applied a total of 0 rules in 9296 ms. Remains 10602 /10602 variables (removed 0) and now considering 49999/49999 (removed 0) transitions.
[2023-03-13 00:48:35] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
[2023-03-13 00:48:35] [INFO ] Invariant cache hit.
[2023-03-13 00:48:36] [INFO ] Implicit Places using invariants in 1207 ms returned []
Implicit Place search using SMT only with invariants took 1212 ms to find 0 implicit places.
[2023-03-13 00:48:36] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
[2023-03-13 00:48:36] [INFO ] Invariant cache hit.
[2023-03-13 00:48:37] [INFO ] Dead Transitions using invariants and state equation in 1154 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11674 ms. Remains : 10602/10602 places, 49999/49999 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 165 ms :[true, p0, p0, p0, p0]
Support contains 1 out of 21203 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 6775 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-13 00:49:03] [INFO ] Computed 102 place invariants in 18516 ms
[2023-03-13 00:49:05] [INFO ] Implicit Places using invariants in 20297 ms returned []
Implicit Place search using SMT only with invariants took 20315 ms to find 0 implicit places.
[2023-03-13 00:49:05] [INFO ] Invariant cache hit.
[2023-03-13 00:49:07] [INFO ] Dead Transitions using invariants and state equation in 1536 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28636 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, p0, p0, p0, p0]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 626 ms. (steps per millisecond=15 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 131476 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131476 steps, saw 129689 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 00:49:11] [INFO ] Invariant cache hit.
[2023-03-13 00:49:14] [INFO ] [Real]Absence check using 100 positive place invariants in 272 ms returned sat
[2023-03-13 00:49:15] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 471 ms returned sat
[2023-03-13 00:49:36] [INFO ] After 25027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9900 Post agglomeration using F-continuation condition.Transition count delta: 9900
Deduced a syphon composed of 9900 places in 25 ms
Reduce places removed 9900 places and 0 transitions.
Iterating global reduction 2 with 19800 rules applied. Total rules applied 21200 place count 10603 transition count 50000
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21201 place count 10603 transition count 49999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21202 place count 10602 transition count 49999
Partial Free-agglomeration rule applied 10100 times.
Drop transitions removed 10100 transitions
Iterating global reduction 3 with 10100 rules applied. Total rules applied 31302 place count 10602 transition count 49999
Applied a total of 31302 rules in 39492 ms. Remains 10602 /21203 variables (removed 10601) and now considering 49999/60600 (removed 10601) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39495 ms. Remains : 10602/21203 places, 49999/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 99982 steps, run timeout after 3002 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99982 steps, saw 93452 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 00:50:19] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
// Phase 1: matrix 49998 rows 10602 cols
[2023-03-13 00:50:28] [INFO ] Computed 102 place invariants in 8660 ms
[2023-03-13 00:50:29] [INFO ] [Real]Absence check using 100 positive place invariants in 157 ms returned sat
[2023-03-13 00:50:29] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 184 ms returned sat
[2023-03-13 00:50:53] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10602/10602 places, 49999/49999 transitions.
Applied a total of 0 rules in 9119 ms. Remains 10602 /10602 variables (removed 0) and now considering 49999/49999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9119 ms. Remains : 10602/10602 places, 49999/49999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10602/10602 places, 49999/49999 transitions.
Applied a total of 0 rules in 9094 ms. Remains 10602 /10602 variables (removed 0) and now considering 49999/49999 (removed 0) transitions.
[2023-03-13 00:51:11] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
[2023-03-13 00:51:11] [INFO ] Invariant cache hit.
[2023-03-13 00:51:12] [INFO ] Implicit Places using invariants in 964 ms returned []
Implicit Place search using SMT only with invariants took 975 ms to find 0 implicit places.
[2023-03-13 00:51:12] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
[2023-03-13 00:51:12] [INFO ] Invariant cache hit.
[2023-03-13 00:51:13] [INFO ] Dead Transitions using invariants and state equation in 1163 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11262 ms. Remains : 10602/10602 places, 49999/49999 transitions.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 178 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 181 ms :[true, p0, p0, p0, p0]
Product exploration explored 100000 steps with 39 reset in 3952 ms.
Product exploration explored 100000 steps with 40 reset in 3397 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 195 ms :[true, p0, p0, p0, p0]
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Performed 500 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 21203 transition count 60600
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 500 place count 21203 transition count 60600
Deduced a syphon composed of 600 places in 19 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 600 place count 21203 transition count 60600
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 800 place count 21003 transition count 60400
Deduced a syphon composed of 400 places in 16 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 1000 place count 21003 transition count 60400
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: -19600
Deduced a syphon composed of 10400 places in 34 ms
Iterating global reduction 1 with 10000 rules applied. Total rules applied 11000 place count 21003 transition count 80000
Discarding 400 places :
Symmetric choice reduction at 1 with 400 rule applications. Total rules 11400 place count 20603 transition count 79600
Deduced a syphon composed of 10000 places in 14 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 11800 place count 20603 transition count 79600
Deduced a syphon composed of 10000 places in 20 ms
Applied a total of 11800 rules in 54815 ms. Remains 20603 /21203 variables (removed 600) and now considering 79600/60600 (removed -19000) transitions.
[2023-03-13 00:52:17] [INFO ] Flow matrix only has 69898 transitions (discarded 9702 similar events)
// Phase 1: matrix 69898 rows 20603 cols
[2023-03-13 00:52:39] [INFO ] Computed 102 place invariants in 22779 ms
[2023-03-13 00:52:41] [INFO ] Dead Transitions using invariants and state equation in 24613 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20603/21203 places, 79600/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79449 ms. Remains : 20603/21203 places, 79600/60600 transitions.
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 7744 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-13 00:53:08] [INFO ] Computed 102 place invariants in 19087 ms
[2023-03-13 00:53:10] [INFO ] Implicit Places using invariants in 21398 ms returned []
Implicit Place search using SMT only with invariants took 21401 ms to find 0 implicit places.
[2023-03-13 00:53:10] [INFO ] Invariant cache hit.
[2023-03-13 00:53:12] [INFO ] Dead Transitions using invariants and state equation in 1739 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30896 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-10 finished in 422199 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))'
Support contains 2 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 21203 transition count 59901
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 20504 transition count 59901
Performed 9900 Post agglomeration using F-continuation condition.Transition count delta: 9900
Deduced a syphon composed of 9900 places in 33 ms
Reduce places removed 9900 places and 0 transitions.
Iterating global reduction 2 with 19800 rules applied. Total rules applied 21198 place count 10604 transition count 50001
Applied a total of 21198 rules in 23197 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
[2023-03-13 00:53:37] [INFO ] Flow matrix only has 40299 transitions (discarded 9702 similar events)
// Phase 1: matrix 40299 rows 10604 cols
[2023-03-13 00:53:46] [INFO ] Computed 102 place invariants in 8798 ms
[2023-03-13 00:53:47] [INFO ] Implicit Places using invariants in 10037 ms returned []
Implicit Place search using SMT only with invariants took 10040 ms to find 0 implicit places.
[2023-03-13 00:53:47] [INFO ] Flow matrix only has 40299 transitions (discarded 9702 similar events)
[2023-03-13 00:53:47] [INFO ] Invariant cache hit.
[2023-03-13 00:53:48] [INFO ] Dead Transitions using invariants and state equation in 1251 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10604/21203 places, 50001/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34492 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s2611 s75)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 3685 steps with 7 reset in 175 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-12 finished in 34860 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 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 6869 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-13 00:54:14] [INFO ] Computed 102 place invariants in 18830 ms
[2023-03-13 00:54:16] [INFO ] Implicit Places using invariants in 20677 ms returned []
Implicit Place search using SMT only with invariants took 20681 ms to find 0 implicit places.
[2023-03-13 00:54:16] [INFO ] Invariant cache hit.
[2023-03-13 00:54:18] [INFO ] Dead Transitions using invariants and state equation in 1946 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29501 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ 2 s14960) (GT 3 s9185))], 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 2367 steps with 0 reset in 175 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-13 finished in 29926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 51 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 2 with 19796 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Applied a total of 21196 rules in 23572 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
[2023-03-13 00:54:42] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-13 00:54:51] [INFO ] Computed 102 place invariants in 8978 ms
[2023-03-13 00:54:52] [INFO ] Implicit Places using invariants in 10227 ms returned []
Implicit Place search using SMT only with invariants took 10241 ms to find 0 implicit places.
[2023-03-13 00:54:52] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 00:54:52] [INFO ] Invariant cache hit.
[2023-03-13 00:54:53] [INFO ] Dead Transitions using invariants and state equation in 1031 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10605/21203 places, 50002/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34849 ms. Remains : 10605/21203 places, 50002/60600 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s8342 s3443)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 198 reset in 3563 ms.
Product exploration explored 100000 steps with 199 reset in 3551 ms.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 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 24 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 72503 steps, run timeout after 3002 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72503 steps, saw 65570 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 00:55:04] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 00:55:04] [INFO ] Invariant cache hit.
[2023-03-13 00:55:06] [INFO ] After 1352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 00:55:07] [INFO ] [Nat]Absence check using 100 positive place invariants in 153 ms returned sat
[2023-03-13 00:55:07] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 181 ms returned sat
[2023-03-13 00:55:31] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10604 transition count 50001
Applied a total of 10103 rules in 26186 ms. Remains 10604 /10605 variables (removed 1) and now considering 50001/50002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26188 ms. Remains : 10604/10605 places, 50001/50002 transitions.
Finished random walk after 5575 steps, including 9 resets, run visited all 1 properties in 240 ms. (steps per millisecond=23 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 199 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 2 out of 10605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 8516 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-13 00:56:06] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 00:56:06] [INFO ] Invariant cache hit.
[2023-03-13 00:56:07] [INFO ] Implicit Places using invariants in 1198 ms returned []
Implicit Place search using SMT only with invariants took 1212 ms to find 0 implicit places.
[2023-03-13 00:56:07] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 00:56:07] [INFO ] Invariant cache hit.
[2023-03-13 00:56:08] [INFO ] Dead Transitions using invariants and state equation in 917 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10664 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 6473 steps, including 12 resets, run visited all 1 properties in 310 ms. (steps per millisecond=20 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 159 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 197 reset in 5163 ms.
Product exploration explored 100000 steps with 198 reset in 3493 ms.
Support contains 2 out of 10605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 8157 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-13 00:56:26] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 00:56:26] [INFO ] Invariant cache hit.
[2023-03-13 00:56:27] [INFO ] Implicit Places using invariants in 1123 ms returned []
Implicit Place search using SMT only with invariants took 1124 ms to find 0 implicit places.
[2023-03-13 00:56:27] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 00:56:27] [INFO ] Invariant cache hit.
[2023-03-13 00:56:28] [INFO ] Dead Transitions using invariants and state equation in 1070 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10355 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-14 finished in 131195 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))&&F(((p1 U p2)&&(!p1 U (p3||G(!p1)))))))'
Support contains 7 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9899 Post agglomeration using F-continuation condition.Transition count delta: 9899
Deduced a syphon composed of 9899 places in 50 ms
Reduce places removed 9899 places and 0 transitions.
Iterating global reduction 2 with 19798 rules applied. Total rules applied 21198 place count 10604 transition count 50001
Applied a total of 21198 rules in 24621 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
[2023-03-13 00:56:54] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
// Phase 1: matrix 40300 rows 10604 cols
[2023-03-13 00:57:05] [INFO ] Computed 102 place invariants in 10338 ms
[2023-03-13 00:57:06] [INFO ] Implicit Places using invariants in 11462 ms returned []
Implicit Place search using SMT only with invariants took 11468 ms to find 0 implicit places.
[2023-03-13 00:57:06] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-13 00:57:06] [INFO ] Invariant cache hit.
[2023-03-13 00:57:07] [INFO ] Dead Transitions using invariants and state equation in 1042 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10604/21203 places, 50001/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37146 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p2) (AND p1 (NOT p3))), (NOT p0), (NOT p0), (OR (NOT p2) (AND p1 (NOT p3))), (NOT p2), (AND p1 (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND p1 (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 5}], [{ 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=(OR (AND (NOT p2) (NOT p1)) (AND p1 (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1 p3), acceptance={0} source=3 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s852 s8369), p2:(LEQ s8093 s731), p1:(LEQ s5991 s706), p3:(AND (GT 1 s1093) (GT s5991 s706))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 484 steps with 0 reset in 21 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-15 finished in 37502 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
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)||X((X(G(p2))||F(p3)||p1)))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-100-LTLCardinality-07
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9896 Post agglomeration using F-continuation condition.Transition count delta: 9896
Deduced a syphon composed of 9896 places in 47 ms
Reduce places removed 9896 places and 0 transitions.
Iterating global reduction 2 with 19792 rules applied. Total rules applied 21192 place count 10607 transition count 50004
Applied a total of 21192 rules in 23520 ms. Remains 10607 /21203 variables (removed 10596) and now considering 50004/60600 (removed 10596) transitions.
[2023-03-13 00:57:31] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
// Phase 1: matrix 40306 rows 10607 cols
[2023-03-13 00:57:40] [INFO ] Computed 102 place invariants in 8891 ms
[2023-03-13 00:57:41] [INFO ] Implicit Places using invariants in 10105 ms returned []
Implicit Place search using SMT only with invariants took 10107 ms to find 0 implicit places.
[2023-03-13 00:57:41] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-13 00:57:41] [INFO ] Invariant cache hit.
[2023-03-13 00:57:42] [INFO ] Dead Transitions using invariants and state equation in 1116 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 10607/21203 places, 50004/60600 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 34747 ms. Remains : 10607/21203 places, 50004/60600 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s3635), p1:(OR (LEQ 3 s7115) (LEQ s9454 s7354)), p3:(LEQ s9454 s7354), p2:(LEQ 3 s7115)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 96040 steps with 32081 reset in 10004 ms.
Product exploration explored 100000 steps with 33450 reset in 9549 ms.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 261 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 630 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 68649 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68649 steps, saw 64969 distinct states, run finished after 3003 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 00:58:07] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-13 00:58:07] [INFO ] Invariant cache hit.
[2023-03-13 00:58:08] [INFO ] [Real]Absence check using 100 positive place invariants in 149 ms returned sat
[2023-03-13 00:58:09] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 228 ms returned sat
[2023-03-13 00:58:09] [INFO ] After 2326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 00:58:11] [INFO ] [Nat]Absence check using 100 positive place invariants in 165 ms returned sat
[2023-03-13 00:58:11] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 283 ms returned sat
[2023-03-13 00:58:34] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10607/10607 places, 50004/50004 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10607 transition count 50003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10606 transition count 50003
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10606 transition count 50003
Applied a total of 10103 rules in 25595 ms. Remains 10606 /10607 variables (removed 1) and now considering 50003/50004 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25597 ms. Remains : 10606/10607 places, 50003/50004 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 95528 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95528 steps, saw 92744 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50003 rows 10606 cols
[2023-03-13 00:59:12] [INFO ] Computed 102 place invariants in 8919 ms
[2023-03-13 00:59:14] [INFO ] [Real]Absence check using 100 positive place invariants in 147 ms returned sat
[2023-03-13 00:59:14] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 227 ms returned sat
[2023-03-13 00:59:14] [INFO ] After 2343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 00:59:17] [INFO ] [Nat]Absence check using 100 positive place invariants in 146 ms returned sat
[2023-03-13 00:59:17] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 225 ms returned sat
[2023-03-13 00:59:40] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 9393 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9393 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 9298 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
[2023-03-13 00:59:58] [INFO ] Invariant cache hit.
[2023-03-13 00:59:59] [INFO ] Implicit Places using invariants in 1225 ms returned []
Implicit Place search using SMT only with invariants took 1226 ms to find 0 implicit places.
[2023-03-13 00:59:59] [INFO ] Invariant cache hit.
[2023-03-13 01:00:00] [INFO ] Dead Transitions using invariants and state equation in 1057 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11592 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 228 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 10607 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10607/10607 places, 50004/50004 transitions.
Applied a total of 0 rules in 9188 ms. Remains 10607 /10607 variables (removed 0) and now considering 50004/50004 (removed 0) transitions.
[2023-03-13 01:00:10] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
// Phase 1: matrix 40306 rows 10607 cols
[2023-03-13 01:00:22] [INFO ] Computed 102 place invariants in 11290 ms
[2023-03-13 01:00:23] [INFO ] Implicit Places using invariants in 12252 ms returned []
Implicit Place search using SMT only with invariants took 12257 ms to find 0 implicit places.
[2023-03-13 01:00:23] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-13 01:00:23] [INFO ] Invariant cache hit.
[2023-03-13 01:00:23] [INFO ] Dead Transitions using invariants and state equation in 970 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22433 ms. Remains : 10607/10607 places, 50004/50004 transitions.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 643 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) 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 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 53781 steps, run timeout after 3003 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 53781 steps, saw 53078 distinct states, run finished after 3003 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 01:00:28] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-13 01:00:28] [INFO ] Invariant cache hit.
[2023-03-13 01:00:30] [INFO ] [Real]Absence check using 100 positive place invariants in 138 ms returned sat
[2023-03-13 01:00:30] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 226 ms returned sat
[2023-03-13 01:00:30] [INFO ] After 2200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 01:00:32] [INFO ] [Nat]Absence check using 100 positive place invariants in 136 ms returned sat
[2023-03-13 01:00:32] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 220 ms returned sat
[2023-03-13 01:00:55] [INFO ] After 22020ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 01:00:56] [INFO ] State equation strengthened by 29894 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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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 01:00:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 01:00:56] [INFO ] After 25339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10607/10607 places, 50004/50004 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10607 transition count 50003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10606 transition count 50003
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10606 transition count 50003
Applied a total of 10103 rules in 26272 ms. Remains 10606 /10607 variables (removed 1) and now considering 50003/50004 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26274 ms. Remains : 10606/10607 places, 50003/50004 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 628 ms. (steps per millisecond=15 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 95754 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95754 steps, saw 92775 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50003 rows 10606 cols
[2023-03-13 01:01:34] [INFO ] Computed 102 place invariants in 8406 ms
[2023-03-13 01:01:36] [INFO ] [Real]Absence check using 100 positive place invariants in 148 ms returned sat
[2023-03-13 01:01:36] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 222 ms returned sat
[2023-03-13 01:01:36] [INFO ] After 2360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 01:01:38] [INFO ] [Nat]Absence check using 100 positive place invariants in 134 ms returned sat
[2023-03-13 01:01:39] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 218 ms returned sat
[2023-03-13 01:02:01] [INFO ] After 21938ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 01:02:02] [INFO ] State equation strengthened by 49692 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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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 01:02:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 01:02:02] [INFO ] After 25485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 9417 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9417 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 9270 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
[2023-03-13 01:02:21] [INFO ] Invariant cache hit.
[2023-03-13 01:02:22] [INFO ] Implicit Places using invariants in 994 ms returned []
Implicit Place search using SMT only with invariants took 997 ms to find 0 implicit places.
[2023-03-13 01:02:22] [INFO ] Invariant cache hit.
[2023-03-13 01:02:22] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11149 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 225 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 33347 reset in 8776 ms.
Product exploration explored 100000 steps with 33285 reset in 9885 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 10607 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10607/10607 places, 50004/50004 transitions.
Applied a total of 0 rules in 8729 ms. Remains 10607 /10607 variables (removed 0) and now considering 50004/50004 (removed 0) transitions.
[2023-03-13 01:02:51] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
// Phase 1: matrix 40306 rows 10607 cols
[2023-03-13 01:03:00] [INFO ] Computed 102 place invariants in 9245 ms
[2023-03-13 01:03:01] [INFO ] Dead Transitions using invariants and state equation in 10236 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18969 ms. Remains : 10607/10607 places, 50004/50004 transitions.
Support contains 4 out of 10607 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10607/10607 places, 50004/50004 transitions.
Applied a total of 0 rules in 8101 ms. Remains 10607 /10607 variables (removed 0) and now considering 50004/50004 (removed 0) transitions.
[2023-03-13 01:03:09] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-13 01:03:09] [INFO ] Invariant cache hit.
[2023-03-13 01:03:10] [INFO ] Implicit Places using invariants in 946 ms returned []
Implicit Place search using SMT only with invariants took 960 ms to find 0 implicit places.
[2023-03-13 01:03:10] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-13 01:03:10] [INFO ] Invariant cache hit.
[2023-03-13 01:03:11] [INFO ] Dead Transitions using invariants and state equation in 967 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10054 ms. Remains : 10607/10607 places, 50004/50004 transitions.
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-07 finished in 365099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U p1)||X(G(!p0))||X(p2))))'
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)))'
[2023-03-13 01:03:15] [INFO ] Flatten gal took : 1664 ms
[2023-03-13 01:03:15] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-13 01:03:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 21203 places, 60600 transitions and 161800 arcs took 260 ms.
Total runtime 2147383 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2091/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2091/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2091/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2091/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2091/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANInsertWithFailure-PT-100-LTLCardinality-01
Could not compute solution for formula : CANInsertWithFailure-PT-100-LTLCardinality-03
Could not compute solution for formula : CANInsertWithFailure-PT-100-LTLCardinality-07
Could not compute solution for formula : CANInsertWithFailure-PT-100-LTLCardinality-10
Could not compute solution for formula : CANInsertWithFailure-PT-100-LTLCardinality-14

BK_STOP 1678669976646

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name CANInsertWithFailure-PT-100-LTLCardinality-01
ltl formula formula --ltl=/tmp/2091/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 21203 places, 60600 transitions and 161800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 9.830 real 1.790 user 2.440 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2091/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2091/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2091/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2091/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CANInsertWithFailure-PT-100-LTLCardinality-03
ltl formula formula --ltl=/tmp/2091/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 21203 places, 60600 transitions and 161800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2091/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 11.170 real 2.250 user 3.590 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2091/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2091/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2091/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name CANInsertWithFailure-PT-100-LTLCardinality-07
ltl formula formula --ltl=/tmp/2091/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 21203 places, 60600 transitions and 161800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2091/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2091/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2091/ltl_2_
pnml2lts-mc( 0/ 4): Loading Petri net took 11.070 real 1.960 user 3.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2091/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CANInsertWithFailure-PT-100-LTLCardinality-10
ltl formula formula --ltl=/tmp/2091/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 21203 places, 60600 transitions and 161800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 11.480 real 2.120 user 2.780 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2091/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2091/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2091/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2091/ltl_3_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name CANInsertWithFailure-PT-100-LTLCardinality-14
ltl formula formula --ltl=/tmp/2091/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 21203 places, 60600 transitions and 161800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2091/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2091/ltl_4_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 11.180 real 2.160 user 2.810 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2091/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2091/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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-100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695100779"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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